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.r601-tall-171774424100262.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 BlocksWorld-PT-13, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r601-tall-171774424100262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 35M
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.9M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.9M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 42K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 134K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 684K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 1.2M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.8M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 848K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.3M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 73K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 173K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 4.4M Jun 7 06:26 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 BlocksWorld-PT-13-ReachabilityCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-13-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717782546177

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 17:49:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 17:49:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 17:49:07] [INFO ] Load time of PNML (sax parser for PT used): 405 ms
[2024-06-07 17:49:07] [INFO ] Transformed 4691 places.
[2024-06-07 17:49:07] [INFO ] Transformed 9113 transitions.
[2024-06-07 17:49:07] [INFO ] Found NUPN structural information;
[2024-06-07 17:49:07] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52, pred_on_table_53, pred_on_table_54, pred_on_table_55, pred_on_table_56, pred_on_table_57, pred_on_table_58, pred_on_table_59, pred_on_table_60, pred_on_table_61, pred_on_table_62, pred_on_table_63, pred_on_table_64, pred_on_table_65, pred_on_table_66]
[2024-06-07 17:49:07] [INFO ] Parsed PT model containing 4691 places and 9113 transitions and 45542 arcs in 577 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 140 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 10962 ms. (3 steps per ms) remains 14/16 properties
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 4059 ms. (9 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1116 ms. (35 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 15925 ms. (2 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 11127 ms. (3 steps per ms) remains 13/14 properties
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 10983 ms. (3 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 964 ms. (41 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3724 ms. (10 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 939 ms. (42 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1489 ms. (26 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 921 ms. (43 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 909 ms. (43 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1085 ms. (36 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 937 ms. (42 steps per ms) remains 13/13 properties
// Phase 1: matrix 9113 rows 4691 cols
[2024-06-07 17:49:25] [INFO ] Computed 135 invariants in 135 ms
[2024-06-07 17:49:25] [INFO ] State equation strengthened by 119 read => feed constraints.
Problem BlocksWorld-PT-13-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-13-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-13-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-13-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-13-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-13-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-13-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-13-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-13-ReachabilityCardinality-2024-12 is UNSAT
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4691 variables, 135/135 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4691 variables, 0/135 constraints. Problems are: Problem set: 9 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13803/13804 variables, and 4826 constraints, problems are : Problem set: 9 solved, 4 unsolved in 5123 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, State Equation: 4691/4691 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3149/3189 variables, 59/59 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-06-07 17:49:38] [INFO ] Deduced a trap composed of 68 places in 437 ms of which 51 ms to minimize.
[2024-06-07 17:49:39] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3189 variables, 2/61 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-06-07 17:49:40] [INFO ] Deduced a trap composed of 68 places in 419 ms of which 4 ms to minimize.
[2024-06-07 17:49:40] [INFO ] Deduced a trap composed of 198 places in 236 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3189 variables, 2/63 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3189 variables, 0/63 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1502/4691 variables, 76/139 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4691 variables, 0/139 constraints. Problems are: Problem set: 9 solved, 4 unsolved
SMT process timed out in 17769ms, After SMT, problems are : Problem set: 9 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 4691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4691/4691 places, 9113/9113 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 1 place count 4691 transition count 9112
Applied a total of 1 rules in 71671 ms. Remains 4691 /4691 variables (removed 0) and now considering 9112/9113 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71685 ms. Remains : 4691/4691 places, 9112/9113 transitions.
RANDOM walk for 40000 steps (8 resets) in 6084 ms. (6 steps per ms) remains 3/4 properties
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 727 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 707 ms. (56 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 618 ms. (64 steps per ms) remains 3/3 properties
// Phase 1: matrix 9112 rows 4691 cols
[2024-06-07 17:50:57] [INFO ] Computed 135 invariants in 53 ms
[2024-06-07 17:50:57] [INFO ] State equation strengthened by 118 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2610/2637 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2637 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2054/4691 variables, 89/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4691 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9112/13803 variables, 4691/4826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13803 variables, 118/4944 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13803 variables, 0/4944 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/13803 variables, 0/4944 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13803/13803 variables, and 4944 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5997 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, State Equation: 4691/4691 constraints, ReadFeed: 118/118 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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2610/2637 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 17:51:03] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2637 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2637 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2054/4691 variables, 89/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4691 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9112/13803 variables, 4691/4827 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13803 variables, 118/4945 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13803 variables, 3/4948 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13803 variables, 0/4948 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/13803 variables, 0/4948 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13803/13803 variables, and 4948 constraints, problems are : Problem set: 0 solved, 3 unsolved in 8508 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, State Equation: 4691/4691 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 14608ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 725 ms.
Support contains 27 out of 4691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4691/4691 places, 9112/9112 transitions.
Applied a total of 0 rules in 53058 ms. Remains 4691 /4691 variables (removed 0) and now considering 9112/9112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53058 ms. Remains : 4691/4691 places, 9112/9112 transitions.
RANDOM walk for 40000 steps (8 resets) in 4936 ms. (8 steps per ms) remains 2/3 properties
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 557 ms. (71 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 529 ms. (75 steps per ms) remains 2/2 properties
[2024-06-07 17:52:07] [INFO ] Invariant cache hit.
[2024-06-07 17:52:07] [INFO ] State equation strengthened by 118 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 595/600 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/600 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4091/4691 variables, 126/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4691 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9112/13803 variables, 4691/4826 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13803 variables, 118/4944 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13803 variables, 0/4944 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/13803 variables, 0/4944 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13803/13803 variables, and 4944 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3755 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, State Equation: 4691/4691 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 595/600 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 17:52:11] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/600 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/600 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4091/4691 variables, 126/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4691 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9112/13803 variables, 4691/4827 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13803 variables, 118/4945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13803 variables, 2/4947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13803 variables, 0/4947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/13803 variables, 0/4947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13803/13803 variables, and 4947 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6158 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, State Equation: 4691/4691 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 9948ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 145 ms.
Support contains 5 out of 4691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4691/4691 places, 9112/9112 transitions.
Applied a total of 0 rules in 54520 ms. Remains 4691 /4691 variables (removed 0) and now considering 9112/9112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54522 ms. Remains : 4691/4691 places, 9112/9112 transitions.
RANDOM walk for 40000 steps (8 resets) in 4282 ms. (9 steps per ms) remains 1/2 properties
FORMULA BlocksWorld-PT-13-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 1/1 properties
[2024-06-07 17:53:13] [INFO ] Invariant cache hit.
[2024-06-07 17:53:13] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 401/404 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 17:53:13] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4287/4691 variables, 129/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4691 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9112/13803 variables, 4691/4827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13803 variables, 118/4945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13803 variables, 0/4945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/13803 variables, 0/4945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13803/13803 variables, and 4945 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3955 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, State Equation: 4691/4691 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 401/404 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4287/4691 variables, 129/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4691 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9112/13803 variables, 4691/4827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13803 variables, 118/4945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13803 variables, 1/4946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13803 variables, 0/4946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/13803 variables, 0/4946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13803/13803 variables, and 4946 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4940 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, State Equation: 4691/4691 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 8929ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 3 out of 4691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4691/4691 places, 9112/9112 transitions.
Applied a total of 0 rules in 53730 ms. Remains 4691 /4691 variables (removed 0) and now considering 9112/9112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53731 ms. Remains : 4691/4691 places, 9112/9112 transitions.
RANDOM walk for 40000 steps (8 resets) in 3768 ms. (10 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 490 ms. (81 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 190383 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 190383 steps, saw 161126 distinct states, run finished after 3005 ms. (steps per millisecond=63 ) properties seen :0
[2024-06-07 17:54:20] [INFO ] Invariant cache hit.
[2024-06-07 17:54:20] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 401/404 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 17:54:20] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4287/4691 variables, 129/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4691 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9112/13803 variables, 4691/4827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13803 variables, 118/4945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13803 variables, 0/4945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/13803 variables, 0/4945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13803/13803 variables, and 4945 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3923 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, State Equation: 4691/4691 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 401/404 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4287/4691 variables, 129/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4691 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9112/13803 variables, 4691/4827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13803 variables, 118/4945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13803 variables, 1/4946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13803 variables, 0/4946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/13803 variables, 0/4946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13803/13803 variables, and 4946 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4980 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, State Equation: 4691/4691 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 8935ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 4691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4691/4691 places, 9112/9112 transitions.
Applied a total of 0 rules in 52060 ms. Remains 4691 /4691 variables (removed 0) and now considering 9112/9112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52061 ms. Remains : 4691/4691 places, 9112/9112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4691/4691 places, 9112/9112 transitions.
Applied a total of 0 rules in 52111 ms. Remains 4691 /4691 variables (removed 0) and now considering 9112/9112 (removed 0) transitions.
[2024-06-07 17:56:13] [INFO ] Invariant cache hit.
[2024-06-07 17:56:18] [INFO ] Implicit Places using invariants in 5058 ms returned []
[2024-06-07 17:56:18] [INFO ] Invariant cache hit.
[2024-06-07 17:56:24] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-06-07 17:56:43] [INFO ] Implicit Places using invariants and state equation in 24477 ms returned []
Implicit Place search using SMT with State Equation took 29568 ms to find 0 implicit places.
[2024-06-07 17:56:44] [INFO ] Redundant transitions in 1208 ms returned []
Running 9104 sub problems to find dead transitions.
[2024-06-07 17:56:44] [INFO ] Invariant cache hit.
[2024-06-07 17:56:44] [INFO ] State equation strengthened by 118 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2854 is UNSAT
Problem TDEAD2922 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD3058 is UNSAT
Problem TDEAD3126 is UNSAT
Problem TDEAD3194 is UNSAT
Problem TDEAD3262 is UNSAT
Problem TDEAD3398 is UNSAT
Problem TDEAD3534 is UNSAT
Problem TDEAD3602 is UNSAT
Problem TDEAD3670 is UNSAT
Problem TDEAD3738 is UNSAT
Problem TDEAD3806 is UNSAT
Problem TDEAD3874 is UNSAT
Problem TDEAD3942 is UNSAT
Problem TDEAD4010 is UNSAT
Problem TDEAD4078 is UNSAT
Problem TDEAD4214 is UNSAT
Problem TDEAD4350 is UNSAT
Problem TDEAD4418 is UNSAT
Problem TDEAD4486 is UNSAT
Problem TDEAD4554 is UNSAT
Problem TDEAD4622 is UNSAT
Problem TDEAD4690 is UNSAT
Problem TDEAD4822 is UNSAT
Problem TDEAD4952 is UNSAT
Problem TDEAD5080 is UNSAT
Problem TDEAD5206 is UNSAT
Problem TDEAD5330 is UNSAT
Problem TDEAD5572 is UNSAT
Problem TDEAD5690 is UNSAT
Problem TDEAD5806 is UNSAT
Problem TDEAD5920 is UNSAT
Problem TDEAD6032 is UNSAT
Problem TDEAD6142 is UNSAT
Problem TDEAD6250 is UNSAT
Problem TDEAD6356 is UNSAT
Problem TDEAD6460 is UNSAT
Problem TDEAD6562 is UNSAT
Problem TDEAD6662 is UNSAT
Problem TDEAD6760 is UNSAT
Problem TDEAD6856 is UNSAT
Problem TDEAD6950 is UNSAT
Problem TDEAD7042 is UNSAT
Problem TDEAD7220 is UNSAT
Problem TDEAD7306 is UNSAT
Problem TDEAD7390 is UNSAT
Problem TDEAD7472 is UNSAT
Problem TDEAD7630 is UNSAT
Problem TDEAD7706 is UNSAT
Problem TDEAD7780 is UNSAT
Problem TDEAD7922 is UNSAT
Problem TDEAD7990 is UNSAT
Problem TDEAD8056 is UNSAT
Problem TDEAD8120 is UNSAT
Problem TDEAD8182 is UNSAT
Problem TDEAD8242 is UNSAT
Problem TDEAD8300 is UNSAT
Problem TDEAD8356 is UNSAT
Problem TDEAD8410 is UNSAT
Problem TDEAD8462 is UNSAT
Problem TDEAD8512 is UNSAT
Problem TDEAD8560 is UNSAT
Problem TDEAD8606 is UNSAT
Problem TDEAD8650 is UNSAT
Problem TDEAD8732 is UNSAT
Problem TDEAD8806 is UNSAT
Problem TDEAD8840 is UNSAT
Problem TDEAD8872 is UNSAT
Problem TDEAD8902 is UNSAT
Problem TDEAD8930 is UNSAT
Problem TDEAD8956 is UNSAT
Problem TDEAD8980 is UNSAT
Problem TDEAD9002 is UNSAT
Problem TDEAD9022 is UNSAT
Problem TDEAD9056 is UNSAT
Problem TDEAD9082 is UNSAT
Problem TDEAD9092 is UNSAT
Problem TDEAD9100 is UNSAT
Problem TDEAD9106 is UNSAT
Problem TDEAD9110 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4683 variables, 119/119 constraints. Problems are: Problem set: 118 solved, 8986 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4683/13803 variables, and 119 constraints, problems are : Problem set: 118 solved, 8986 unsolved in 30152 ms.
Refiners :[Positive P Invariants (semi-flows): 119/135 constraints, State Equation: 0/4691 constraints, ReadFeed: 0/118 constraints, PredecessorRefiner: 9045/4556 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 118 solved, 8986 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4624 variables, 9/9 constraints. Problems are: Problem set: 118 solved, 8986 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4624/13803 variables, and 9 constraints, problems are : Problem set: 118 solved, 8986 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 9/135 constraints, State Equation: 0/4691 constraints, ReadFeed: 0/118 constraints, PredecessorRefiner: 4489/4556 constraints, Known Traps: 0/0 constraints]
After SMT, in 143784ms problems are : Problem set: 118 solved, 8986 unsolved
Search for dead transitions found 118 dead transitions in 143874ms
Found 118 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 118 transitions
Dead transitions reduction (with SMT) removed 118 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 4691/4691 places, 8994/9112 transitions.
Graph (complete) has 22670 edges and 4691 vertex of which 4633 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.6 ms
Discarding 58 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 1 rules in 52146 ms. Remains 4633 /4691 variables (removed 58) and now considering 8994/8994 (removed 0) transitions.
// Phase 1: matrix 8994 rows 4633 cols
[2024-06-07 18:00:00] [INFO ] Computed 136 invariants in 71 ms
[2024-06-07 18:00:05] [INFO ] Implicit Places using invariants in 5048 ms returned []
[2024-06-07 18:00:05] [INFO ] Invariant cache hit.
[2024-06-07 18:00:11] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-07 18:00:21] [INFO ] Implicit Places using invariants and state equation in 16036 ms returned []
Implicit Place search using SMT with State Equation took 21086 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 4633/4691 places, 8994/9112 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 300049 ms. Remains : 4633/4691 places, 8994/9112 transitions.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
[2024-06-07 18:00:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-06-07 18:00:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4632 places, 8994 transitions and 44836 arcs took 42 ms.
[2024-06-07 18:00:22] [INFO ] Flatten gal took : 600 ms
Total runtime 674963 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BlocksWorld-PT-13

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 4632
TRANSITIONS: 8994
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.234s, Sys 0.009s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.034s, 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: 652
MODEL NAME: /home/mcc/execution/411/model
4632 places, 8994 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.

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 ReachabilityCardinality -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="BlocksWorld-PT-13"
export BK_EXAMINATION="ReachabilityCardinality"
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 BlocksWorld-PT-13, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r601-tall-171774424100262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-13.tgz
mv BlocksWorld-PT-13 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;