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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 885K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.2M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 37K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 989K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.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.1M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.3M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 119K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 286K 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 3.8M 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-12-ReachabilityCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717778728309

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-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 16:45:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 16:45:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 16:45:29] [INFO ] Load time of PNML (sax parser for PT used): 359 ms
[2024-06-07 16:45:30] [INFO ] Transformed 4031 places.
[2024-06-07 16:45:30] [INFO ] Transformed 7813 transitions.
[2024-06-07 16:45:30] [INFO ] Found NUPN structural information;
[2024-06-07 16:45:30] [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]
[2024-06-07 16:45:30] [INFO ] Parsed PT model containing 4031 places and 7813 transitions and 39042 arcs in 525 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 136 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 16019 ms. (2 steps per ms) remains 12/16 properties
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 1750 ms. (22 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3907 ms. (10 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16982 ms. (2 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2479 ms. (16 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10649 ms. (3 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1540 ms. (25 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18183 ms. (2 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4140 ms. (9 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1619 ms. (24 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1487 ms. (26 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1586 ms. (25 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1538 ms. (25 steps per ms) remains 12/12 properties
// Phase 1: matrix 7813 rows 4031 cols
[2024-06-07 16:45:51] [INFO ] Computed 125 invariants in 119 ms
[2024-06-07 16:45:51] [INFO ] State equation strengthened by 113 read => feed constraints.
Problem BlocksWorld-PT-12-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-12-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-12-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-12-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-12-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-12-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/4031 variables, 125/125 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4031 variables, 0/125 constraints. Problems are: Problem set: 6 solved, 6 unsolved
SMT process timed out in 12885ms, After SMT, problems are : Problem set: 6 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3971 out of 4031 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4031/4031 places, 7813/7813 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 4031 transition count 7812
Applied a total of 1 rules in 1552 ms. Remains 4031 /4031 variables (removed 0) and now considering 7812/7813 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1564 ms. Remains : 4031/4031 places, 7812/7813 transitions.
RANDOM walk for 40000 steps (8 resets) in 7188 ms. (5 steps per ms) remains 5/6 properties
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 3765 ms. (10 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1209 ms. (33 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 895 ms. (44 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 832 ms. (48 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 834 ms. (47 steps per ms) remains 5/5 properties
// Phase 1: matrix 7812 rows 4031 cols
[2024-06-07 16:46:10] [INFO ] Computed 125 invariants in 50 ms
[2024-06-07 16:46:10] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3971 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3971 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 60/4031 variables, 121/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4031 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 7812/11843 variables, 4031/4156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11843 variables, 112/4268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11843 variables, 0/4268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/11843 variables, 0/4268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11843/11843 variables, and 4268 constraints, problems are : Problem set: 0 solved, 5 unsolved in 26636 ms.
Refiners :[Positive P Invariants (semi-flows): 125/125 constraints, State Equation: 4031/4031 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3971 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3971 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 60/4031 variables, 121/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-07 16:46:43] [INFO ] Deduced a trap composed of 63 places in 3696 ms of which 155 ms to minimize.
[2024-06-07 16:46:46] [INFO ] Deduced a trap composed of 63 places in 3437 ms of which 22 ms to minimize.
[2024-06-07 16:46:50] [INFO ] Deduced a trap composed of 124 places in 3515 ms of which 21 ms to minimize.
[2024-06-07 16:46:53] [INFO ] Deduced a trap composed of 399 places in 2442 ms of which 17 ms to minimize.
[2024-06-07 16:46:57] [INFO ] Deduced a trap composed of 124 places in 4592 ms of which 24 ms to minimize.
[2024-06-07 16:47:02] [INFO ] Deduced a trap composed of 975 places in 4415 ms of which 24 ms to minimize.
[2024-06-07 16:47:06] [INFO ] Deduced a trap composed of 960 places in 4541 ms of which 25 ms to minimize.
[2024-06-07 16:47:11] [INFO ] Deduced a trap composed of 975 places in 4398 ms of which 26 ms to minimize.
[2024-06-07 16:47:12] [INFO ] Deduced a trap composed of 63 places in 405 ms of which 4 ms to minimize.
[2024-06-07 16:47:15] [INFO ] Deduced a trap composed of 240 places in 3750 ms of which 21 ms to minimize.
[2024-06-07 16:47:19] [INFO ] Deduced a trap composed of 1020 places in 3724 ms of which 22 ms to minimize.
[2024-06-07 16:47:23] [INFO ] Deduced a trap composed of 1023 places in 3633 ms of which 22 ms to minimize.
SMT process timed out in 73477ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3971 out of 4031 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4031/4031 places, 7812/7812 transitions.
Applied a total of 0 rules in 1410 ms. Remains 4031 /4031 variables (removed 0) and now considering 7812/7812 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1410 ms. Remains : 4031/4031 places, 7812/7812 transitions.
RANDOM walk for 40000 steps (8 resets) in 9166 ms. (4 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4709 ms. (8 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1709 ms. (23 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1278 ms. (31 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1193 ms. (33 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1182 ms. (33 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 165110 steps, run timeout after 15003 ms. (steps per millisecond=11 ) properties seen :0 out of 5
Probabilistic random walk after 165110 steps, saw 138343 distinct states, run finished after 15008 ms. (steps per millisecond=11 ) properties seen :0
[2024-06-07 16:47:45] [INFO ] Invariant cache hit.
[2024-06-07 16:47:45] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3971 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3971 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 60/4031 variables, 121/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4031 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 7812/11843 variables, 4031/4156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11843 variables, 112/4268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11843 variables, 0/4268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/11843 variables, 0/4268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11843/11843 variables, and 4268 constraints, problems are : Problem set: 0 solved, 5 unsolved in 23652 ms.
Refiners :[Positive P Invariants (semi-flows): 125/125 constraints, State Equation: 4031/4031 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3971 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3971 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 60/4031 variables, 121/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-07 16:48:14] [INFO ] Deduced a trap composed of 124 places in 2591 ms of which 17 ms to minimize.
[2024-06-07 16:48:17] [INFO ] Deduced a trap composed of 63 places in 2507 ms of which 16 ms to minimize.
[2024-06-07 16:48:21] [INFO ] Deduced a trap composed of 124 places in 3682 ms of which 21 ms to minimize.
[2024-06-07 16:48:24] [INFO ] Deduced a trap composed of 943 places in 3583 ms of which 21 ms to minimize.
[2024-06-07 16:48:25] [INFO ] Deduced a trap composed of 540 places in 831 ms of which 7 ms to minimize.
[2024-06-07 16:48:27] [INFO ] Deduced a trap composed of 63 places in 1677 ms of which 13 ms to minimize.
[2024-06-07 16:48:33] [INFO ] Deduced a trap composed of 124 places in 5586 ms of which 30 ms to minimize.
[2024-06-07 16:48:34] [INFO ] Deduced a trap composed of 399 places in 1242 ms of which 10 ms to minimize.
[2024-06-07 16:48:37] [INFO ] Deduced a trap composed of 63 places in 2563 ms of which 18 ms to minimize.
[2024-06-07 16:48:41] [INFO ] Deduced a trap composed of 240 places in 3474 ms of which 20 ms to minimize.
[2024-06-07 16:48:41] [INFO ] Deduced a trap composed of 124 places in 394 ms of which 3 ms to minimize.
[2024-06-07 16:48:42] [INFO ] Deduced a trap composed of 124 places in 1041 ms of which 9 ms to minimize.
[2024-06-07 16:48:44] [INFO ] Deduced a trap composed of 63 places in 1461 ms of which 11 ms to minimize.
[2024-06-07 16:48:47] [INFO ] Deduced a trap composed of 124 places in 3258 ms of which 21 ms to minimize.
[2024-06-07 16:48:51] [INFO ] Deduced a trap composed of 988 places in 3069 ms of which 20 ms to minimize.
[2024-06-07 16:48:54] [INFO ] Deduced a trap composed of 124 places in 2940 ms of which 19 ms to minimize.
[2024-06-07 16:48:57] [INFO ] Deduced a trap composed of 495 places in 3092 ms of which 20 ms to minimize.
[2024-06-07 16:48:58] [INFO ] Deduced a trap composed of 828 places in 1609 ms of which 13 ms to minimize.
[2024-06-07 16:49:00] [INFO ] Deduced a trap composed of 855 places in 1877 ms of which 14 ms to minimize.
[2024-06-07 16:49:01] [INFO ] Deduced a trap composed of 63 places in 164 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/4031 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-07 16:49:05] [INFO ] Deduced a trap composed of 63 places in 3186 ms of which 20 ms to minimize.
[2024-06-07 16:49:09] [INFO ] Deduced a trap composed of 348 places in 3281 ms of which 21 ms to minimize.
[2024-06-07 16:49:10] [INFO ] Deduced a trap composed of 240 places in 808 ms of which 11 ms to minimize.
[2024-06-07 16:49:11] [INFO ] Deduced a trap composed of 63 places in 828 ms of which 10 ms to minimize.
[2024-06-07 16:49:15] [INFO ] Deduced a trap composed of 295 places in 4417 ms of which 24 ms to minimize.
[2024-06-07 16:49:19] [INFO ] Deduced a trap composed of 1015 places in 3753 ms of which 23 ms to minimize.
[2024-06-07 16:49:20] [INFO ] Deduced a trap composed of 399 places in 983 ms of which 8 ms to minimize.
[2024-06-07 16:49:26] [INFO ] Deduced a trap composed of 183 places in 5457 ms of which 26 ms to minimize.
SMT process timed out in 100502ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3971 out of 4031 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4031/4031 places, 7812/7812 transitions.
Applied a total of 0 rules in 1350 ms. Remains 4031 /4031 variables (removed 0) and now considering 7812/7812 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1350 ms. Remains : 4031/4031 places, 7812/7812 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4031/4031 places, 7812/7812 transitions.
Applied a total of 0 rules in 1412 ms. Remains 4031 /4031 variables (removed 0) and now considering 7812/7812 (removed 0) transitions.
[2024-06-07 16:49:28] [INFO ] Invariant cache hit.
[2024-06-07 16:49:29] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-06-07 16:49:29] [INFO ] Invariant cache hit.
[2024-06-07 16:49:34] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-07 16:49:34] [INFO ] Implicit Places using invariants and state equation in 5400 ms returned []
Implicit Place search using SMT with State Equation took 5975 ms to find 0 implicit places.
[2024-06-07 16:49:35] [INFO ] Redundant transitions in 957 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-07 16:49:36] [INFO ] Invariant cache hit.
[2024-06-07 16:49:36] [INFO ] State equation strengthened by 112 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2266 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2707 is UNSAT
Problem TDEAD2770 is UNSAT
Problem TDEAD2833 is UNSAT
Problem TDEAD2896 is UNSAT
Problem TDEAD2959 is UNSAT
Problem TDEAD3022 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3148 is UNSAT
Problem TDEAD3211 is UNSAT
Problem TDEAD3274 is UNSAT
Problem TDEAD3463 is UNSAT
Problem TDEAD3526 is UNSAT
Problem TDEAD3589 is UNSAT
Problem TDEAD3652 is UNSAT
Problem TDEAD3715 is UNSAT
Problem TDEAD3841 is UNSAT
Problem TDEAD3904 is UNSAT
Problem TDEAD3967 is UNSAT
Problem TDEAD4030 is UNSAT
Problem TDEAD4152 is UNSAT
Problem TDEAD4272 is UNSAT
Problem TDEAD4390 is UNSAT
Problem TDEAD4506 is UNSAT
Problem TDEAD4620 is UNSAT
Problem TDEAD4732 is UNSAT
Problem TDEAD4842 is UNSAT
Problem TDEAD4950 is UNSAT
Problem TDEAD5056 is UNSAT
Problem TDEAD5160 is UNSAT
Problem TDEAD5262 is UNSAT
Problem TDEAD5362 is UNSAT
Problem TDEAD5460 is UNSAT
Problem TDEAD5556 is UNSAT
Problem TDEAD5742 is UNSAT
Problem TDEAD5832 is UNSAT
Problem TDEAD5920 is UNSAT
Problem TDEAD6006 is UNSAT
Problem TDEAD6090 is UNSAT
Problem TDEAD6172 is UNSAT
Problem TDEAD6252 is UNSAT
Problem TDEAD6330 is UNSAT
Problem TDEAD6406 is UNSAT
Problem TDEAD6480 is UNSAT
Problem TDEAD6552 is UNSAT
Problem TDEAD6622 is UNSAT
Problem TDEAD6756 is UNSAT
Problem TDEAD6820 is UNSAT
Problem TDEAD6882 is UNSAT
Problem TDEAD6942 is UNSAT
Problem TDEAD7000 is UNSAT
Problem TDEAD7056 is UNSAT
Problem TDEAD7110 is UNSAT
Problem TDEAD7162 is UNSAT
Problem TDEAD7212 is UNSAT
Problem TDEAD7306 is UNSAT
Problem TDEAD7350 is UNSAT
Problem TDEAD7392 is UNSAT
Problem TDEAD7432 is UNSAT
Problem TDEAD7470 is UNSAT
Problem TDEAD7506 is UNSAT
Problem TDEAD7540 is UNSAT
Problem TDEAD7572 is UNSAT
Problem TDEAD7602 is UNSAT
Problem TDEAD7630 is UNSAT
Problem TDEAD7656 is UNSAT
Problem TDEAD7722 is UNSAT
Problem TDEAD7740 is UNSAT
Problem TDEAD7756 is UNSAT
Problem TDEAD7770 is UNSAT
Problem TDEAD7782 is UNSAT
Problem TDEAD7800 is UNSAT
Problem TDEAD7806 is UNSAT
Problem TDEAD7810 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4025 variables, 113/113 constraints. Problems are: Problem set: 112 solved, 7694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4025/11843 variables, and 113 constraints, problems are : Problem set: 112 solved, 7694 unsolved in 30167 ms.
Refiners :[Positive P Invariants (semi-flows): 113/125 constraints, State Equation: 0/4031 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 7750/3906 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 112 solved, 7694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3969 variables, 7/7 constraints. Problems are: Problem set: 112 solved, 7694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3969/11843 variables, and 7 constraints, problems are : Problem set: 112 solved, 7694 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 7/125 constraints, State Equation: 0/4031 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 3844/3906 constraints, Known Traps: 0/0 constraints]
After SMT, in 137623ms problems are : Problem set: 112 solved, 7694 unsolved
Search for dead transitions found 112 dead transitions in 137697ms
Found 112 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 112 transitions
Dead transitions reduction (with SMT) removed 112 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 4031/4031 places, 7700/7812 transitions.
Deduced a syphon composed of 56 places in 4 ms
Applied a total of 0 rules in 1142 ms. Remains 4031 /4031 variables (removed 0) and now considering 7700/7700 (removed 0) transitions.
[2024-06-07 16:51:55] [INFO ] Redundant transitions in 836 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 148088 ms. Remains : 4031/4031 places, 7700/7812 transitions.
Deduced a syphon composed of 56 places in 6 ms
Reduce places removed 56 places and 0 transitions.
[2024-06-07 16:51:55] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-06-07 16:51:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3975 places, 7700 transitions and 38376 arcs took 42 ms.
[2024-06-07 16:51:56] [INFO ] Flatten gal took : 548 ms
Total runtime 387037 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BlocksWorld-PT-12

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 3975
TRANSITIONS: 7700
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.215s, Sys 0.002s]


SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.030s, 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: 713
MODEL NAME: /home/mcc/execution/408/model
3975 places, 7700 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-12"
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-12, 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-171774424100254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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