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.r355-tall-171683759700855.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 ShieldRVs-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759700855
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 320K May 18 16:43 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 ShieldRVs-PT-050A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717063049083

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 09:57:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 09:57:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 09:57:30] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-30 09:57:30] [INFO ] Transformed 703 places.
[2024-05-30 09:57:30] [INFO ] Transformed 953 transitions.
[2024-05-30 09:57:30] [INFO ] Found NUPN structural information;
[2024-05-30 09:57:30] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (60 resets) in 1921 ms. (20 steps per ms) remains 5/16 properties
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 828 ms. (48 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 930 ms. (42 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 292 ms. (136 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 5/5 properties
// Phase 1: matrix 953 rows 703 cols
[2024-05-30 09:57:32] [INFO ] Computed 201 invariants in 35 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 330/559 variables, 151/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/559 variables, 330/710 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 144/703 variables, 50/760 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 144/904 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 953/1656 variables, 703/1607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1656 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1656 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1656/1656 variables, and 1607 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1510 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 703/703 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/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 330/559 variables, 151/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/559 variables, 330/710 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 09:57:34] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 10 ms to minimize.
[2024-05-30 09:57:34] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-30 09:57:34] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-30 09:57:34] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
[2024-05-30 09:57:34] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 5/715 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 144/703 variables, 50/765 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 144/909 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 09:57:34] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-30 09:57:34] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
[2024-05-30 09:57:35] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-30 09:57:35] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 4/913 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 953/1656 variables, 703/1616 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1656 variables, 5/1621 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 09:57:36] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-30 09:57:37] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:57:37] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1656 variables, 3/1624 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 09:57:38] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-30 09:57:38] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1656/1656 variables, and 1626 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5012 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 703/703 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 14/14 constraints]
After SMT, in 6809ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 229 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 59 times.
Drop transitions (Partial Free agglomeration) removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 61 place count 702 transition count 952
Applied a total of 61 rules in 163 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 702/703 places, 952/953 transitions.
RANDOM walk for 40000 steps (64 resets) in 1196 ms. (33 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 300 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 4/5 properties
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 09:57:40] [INFO ] Computed 201 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 332/555 variables, 150/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 332/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 147/702 variables, 51/756 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 147/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 952/1654 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 1605 constraints, problems are : Problem set: 0 solved, 4 unsolved in 920 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 332/555 variables, 150/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 332/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:57:41] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-30 09:57:41] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 09:57:41] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-30 09:57:41] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-30 09:57:41] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 09:57:41] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 6/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:57:41] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-30 09:57:41] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 2/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:57:41] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:57:41] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 147/702 variables, 51/766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 147/913 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:57:42] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 09:57:42] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-30 09:57:42] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 09:57:42] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-30 09:57:42] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 09:57:42] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 09:57:42] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 09:57:42] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 09:57:42] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2024-05-30 09:57:42] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 3 ms to minimize.
[2024-05-30 09:57:42] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 11/924 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/702 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 952/1654 variables, 702/1626 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1654 variables, 4/1630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:57:44] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-30 09:57:44] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:57:44] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-30 09:57:44] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-30 09:57:45] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 09:57:45] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 09:57:45] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 09:57:45] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 09:57:45] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 09:57:46] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 09:57:46] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1654 variables, 11/1641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:57:47] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1654 variables, 1/1642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1654 variables, 0/1642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1654 variables, 0/1642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 1642 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9164 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 33/33 constraints]
After SMT, in 10211ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 4819 ms.
Support contains 223 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 34 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 702/702 places, 952/952 transitions.
RANDOM walk for 40000 steps (64 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 188927 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 4
Probabilistic random walk after 188927 steps, saw 43443 distinct states, run finished after 3010 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-30 09:57:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 332/555 variables, 150/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 332/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 147/702 variables, 51/756 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 147/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 952/1654 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 1605 constraints, problems are : Problem set: 0 solved, 4 unsolved in 870 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 332/555 variables, 150/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 332/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:57:59] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-30 09:57:59] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-30 09:57:59] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 09:57:59] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-30 09:57:59] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 5/710 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:58:00] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:58:00] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 147/702 variables, 51/763 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 147/910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:58:00] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:58:00] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-05-30 09:58:00] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-30 09:58:00] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-30 09:58:00] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 09:58:00] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-30 09:58:00] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-30 09:58:00] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-30 09:58:00] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 09:58:00] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 10/920 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:58:01] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-30 09:58:01] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 2/922 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:58:01] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/702 variables, 1/923 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:58:01] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/702 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/702 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 952/1654 variables, 702/1626 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1654 variables, 4/1630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:58:03] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 3 ms to minimize.
[2024-05-30 09:58:03] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-30 09:58:03] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-30 09:58:03] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-30 09:58:03] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-30 09:58:04] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 09:58:04] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-30 09:58:04] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-30 09:58:04] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 09:58:05] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 09:58:05] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1654 variables, 11/1641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:58:06] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-30 09:58:06] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-30 09:58:06] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1654 variables, 3/1644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:58:07] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 09:58:07] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1654 variables, 2/1646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1654 variables, 0/1646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1654 variables, 0/1646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 1646 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9814 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 37/37 constraints]
After SMT, in 10787ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3602 ms.
Support contains 202 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 52 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 702/702 places, 952/952 transitions.
RANDOM walk for 40000 steps (64 resets) in 344 ms. (115 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 335 ms. (119 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 198714 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 3
Probabilistic random walk after 198714 steps, saw 45679 distinct states, run finished after 3003 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 09:58:16] [INFO ] Computed 201 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 317/519 variables, 140/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 317/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 183/702 variables, 61/720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 183/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 952/1654 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 1605 constraints, problems are : Problem set: 0 solved, 3 unsolved in 698 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 317/519 variables, 140/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 317/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 09:58:17] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-30 09:58:17] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 183/702 variables, 61/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 183/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 09:58:17] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-05-30 09:58:17] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-30 09:58:17] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-30 09:58:18] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2024-05-30 09:58:18] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 09:58:18] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-30 09:58:18] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-30 09:58:18] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-30 09:58:18] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 9/914 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 09:58:18] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-30 09:58:18] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 2/916 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 952/1654 variables, 702/1618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1654 variables, 3/1621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 09:58:19] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 3 ms to minimize.
[2024-05-30 09:58:20] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-30 09:58:20] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-05-30 09:58:20] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-30 09:58:20] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-30 09:58:20] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-30 09:58:20] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-30 09:58:21] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-30 09:58:21] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-30 09:58:21] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-30 09:58:21] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-30 09:58:21] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-30 09:58:22] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 09:58:22] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-30 09:58:22] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1654 variables, 15/1636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1654 variables, 0/1636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1654 variables, 0/1636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 1636 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7228 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 28/28 constraints]
After SMT, in 8051ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 8699 ms.
Support contains 202 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 40 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 21 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2024-05-30 09:58:33] [INFO ] Invariant cache hit.
[2024-05-30 09:58:33] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-30 09:58:33] [INFO ] Invariant cache hit.
[2024-05-30 09:58:34] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2024-05-30 09:58:34] [INFO ] Redundant transitions in 150 ms returned []
Running 951 sub problems to find dead transitions.
[2024-05-30 09:58:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 09:59:03] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 3 ms to minimize.
[2024-05-30 09:59:03] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 3 ms to minimize.
[2024-05-30 09:59:03] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 3 ms to minimize.
[2024-05-30 09:59:03] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 3 ms to minimize.
[2024-05-30 09:59:04] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 3 ms to minimize.
[2024-05-30 09:59:04] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 4 ms to minimize.
[2024-05-30 09:59:04] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 3 ms to minimize.
[2024-05-30 09:59:04] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 3 ms to minimize.
[2024-05-30 09:59:05] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 3 ms to minimize.
SMT process timed out in 30590ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31884 ms. Remains : 702/702 places, 952/952 transitions.
[2024-05-30 09:59:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-30 09:59:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 702 places, 952 transitions and 4720 arcs took 9 ms.
[2024-05-30 09:59:05] [INFO ] Flatten gal took : 156 ms
Total runtime 95086 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVs-PT-050A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 702
TRANSITIONS: 952
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.020s, Sys 0.007s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 949
MODEL NAME: /home/mcc/execution/413/model
702 places, 952 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

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="ShieldRVs-PT-050A"
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 ShieldRVs-PT-050A, 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 r355-tall-171683759700855"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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