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-171774424100259.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r601-tall-171774424100259
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-01
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-02
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-03
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-04
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-05
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-06
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-07
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-08
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-09
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-10
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-11
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-12
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-13
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-14
FORMULA_NAME BlocksWorld-PT-13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717781741256

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
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:35:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 17:35:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 17:35:42] [INFO ] Load time of PNML (sax parser for PT used): 419 ms
[2024-06-07 17:35:43] [INFO ] Transformed 4691 places.
[2024-06-07 17:35:43] [INFO ] Transformed 9113 transitions.
[2024-06-07 17:35:43] [INFO ] Found NUPN structural information;
[2024-06-07 17:35:43] [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:35:43] [INFO ] Parsed PT model containing 4691 places and 9113 transitions and 45542 arcs in 654 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BlocksWorld-PT-13-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-13-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-13-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 202 out of 4691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4691/4691 places, 9113/9113 transitions.
Applied a total of 0 rules in 590 ms. Remains 4691 /4691 variables (removed 0) and now considering 9113/9113 (removed 0) transitions.
// Phase 1: matrix 9113 rows 4691 cols
[2024-06-07 17:35:44] [INFO ] Computed 135 invariants in 134 ms
[2024-06-07 17:35:47] [INFO ] Implicit Places using invariants in 3796 ms returned []
[2024-06-07 17:35:47] [INFO ] Invariant cache hit.
[2024-06-07 17:35:53] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-06-07 17:36:12] [INFO ] Implicit Places using invariants and state equation in 24237 ms returned []
Implicit Place search using SMT with State Equation took 28095 ms to find 0 implicit places.
Running 9105 sub problems to find dead transitions.
[2024-06-07 17:36:12] [INFO ] Invariant cache hit.
[2024-06-07 17:36:12] [INFO ] State equation strengthened by 119 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, 8987 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4683/13804 variables, and 119 constraints, problems are : Problem set: 118 solved, 8987 unsolved in 30244 ms.
Refiners :[Positive P Invariants (semi-flows): 119/135 constraints, State Equation: 0/4691 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 9046/4557 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 118 solved, 8987 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4624 variables, 9/9 constraints. Problems are: Problem set: 118 solved, 8987 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4624/13804 variables, and 9 constraints, problems are : Problem set: 118 solved, 8987 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 9/135 constraints, State Equation: 0/4691 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 4489/4557 constraints, Known Traps: 0/0 constraints]
After SMT, in 148236ms problems are : Problem set: 118 solved, 8987 unsolved
Search for dead transitions found 118 dead transitions in 148365ms
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 LTL mode, iteration 1 : 4691/4691 places, 8995/9113 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 4632 transition count 8995
Applied a total of 59 rules in 675 ms. Remains 4632 /4691 variables (removed 59) and now considering 8995/8995 (removed 0) transitions.
// Phase 1: matrix 8995 rows 4632 cols
[2024-06-07 17:38:41] [INFO ] Computed 135 invariants in 54 ms
[2024-06-07 17:38:44] [INFO ] Implicit Places using invariants in 3262 ms returned []
[2024-06-07 17:38:44] [INFO ] Invariant cache hit.
[2024-06-07 17:38:50] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-07 17:39:01] [INFO ] Implicit Places using invariants and state equation in 16924 ms returned []
Implicit Place search using SMT with State Equation took 20191 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4632/4691 places, 8995/9113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 198001 ms. Remains : 4632/4691 places, 8995/9113 transitions.
Support contains 202 out of 4632 places after structural reductions.
[2024-06-07 17:39:02] [INFO ] Flatten gal took : 642 ms
[2024-06-07 17:39:02] [INFO ] Flatten gal took : 409 ms
[2024-06-07 17:39:03] [INFO ] Input system was already deterministic with 8995 transitions.
RANDOM walk for 40000 steps (8 resets) in 9423 ms. (4 steps per ms) remains 11/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 834 ms. (47 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 970 ms. (41 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 808 ms. (49 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 866 ms. (46 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 666 ms. (59 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 831 ms. (48 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 675 ms. (59 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1032 ms. (38 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 974 ms. (41 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 674 ms. (59 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 637 ms. (62 steps per ms) remains 11/11 properties
[2024-06-07 17:39:09] [INFO ] Invariant cache hit.
[2024-06-07 17:39:09] [INFO ] State equation strengthened by 17 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp11 is UNSAT
At refinement iteration 2 (OVERLAPS) 4430/4632 variables, 134/135 constraints. Problems are: Problem set: 6 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/4632 variables, 0/135 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 8994/13626 variables, 4632/4767 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13626 variables, 16/4783 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13626/13627 variables, and 4783 constraints, problems are : Problem set: 6 solved, 5 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, State Equation: 4632/4632 constraints, ReadFeed: 16/17 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 5 unsolved
[2024-06-07 17:39:15] [INFO ] Deduced a trap composed of 134 places in 827 ms of which 14 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 3 (OVERLAPS) 4430/4632 variables, 134/136 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-06-07 17:39:24] [INFO ] Deduced a trap composed of 378 places in 7723 ms of which 48 ms to minimize.
SMT process timed out in 14715ms, After SMT, problems are : Problem set: 7 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 202 out of 4632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4632/4632 places, 8995/8995 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 4632 transition count 8994
Applied a total of 1 rules in 44360 ms. Remains 4632 /4632 variables (removed 0) and now considering 8994/8995 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44363 ms. Remains : 4632/4632 places, 8994/8995 transitions.
RANDOM walk for 40000 steps (8 resets) in 4910 ms. (8 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 982 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 969 ms. (41 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 851 ms. (46 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 868 ms. (46 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 178508 steps, run timeout after 6001 ms. (steps per millisecond=29 ) properties seen :0 out of 4
Probabilistic random walk after 178508 steps, saw 150739 distinct states, run finished after 6014 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 8994 rows 4632 cols
[2024-06-07 17:40:17] [INFO ] Computed 135 invariants in 57 ms
[2024-06-07 17:40:17] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4430/4632 variables, 134/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4632 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8994/13626 variables, 4632/4767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13626 variables, 16/4783 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13626 variables, 0/4783 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13626 variables, 0/4783 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13626/13626 variables, and 4783 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6141 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, State Equation: 4632/4632 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4430/4632 variables, 134/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 17:40:32] [INFO ] Deduced a trap composed of 198 places in 7826 ms of which 32 ms to minimize.
[2024-06-07 17:40:40] [INFO ] Deduced a trap composed of 198 places in 7833 ms of which 31 ms to minimize.
[2024-06-07 17:40:48] [INFO ] Deduced a trap composed of 134 places in 7808 ms of which 29 ms to minimize.
[2024-06-07 17:40:56] [INFO ] Deduced a trap composed of 198 places in 8071 ms of which 33 ms to minimize.
[2024-06-07 17:41:04] [INFO ] Deduced a trap composed of 198 places in 7780 ms of which 33 ms to minimize.
[2024-06-07 17:41:12] [INFO ] Deduced a trap composed of 378 places in 7843 ms of which 30 ms to minimize.
SMT process timed out in 54886ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 202 out of 4632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4632/4632 places, 8994/8994 transitions.
Applied a total of 0 rules in 34185 ms. Remains 4632 /4632 variables (removed 0) and now considering 8994/8994 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34185 ms. Remains : 4632/4632 places, 8994/8994 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4632/4632 places, 8994/8994 transitions.
Applied a total of 0 rules in 34218 ms. Remains 4632 /4632 variables (removed 0) and now considering 8994/8994 (removed 0) transitions.
[2024-06-07 17:42:20] [INFO ] Invariant cache hit.
[2024-06-07 17:42:23] [INFO ] Implicit Places using invariants in 3141 ms returned []
[2024-06-07 17:42:23] [INFO ] Invariant cache hit.
[2024-06-07 17:42:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-07 17:42:36] [INFO ] Implicit Places using invariants and state equation in 13341 ms returned []
Implicit Place search using SMT with State Equation took 16498 ms to find 0 implicit places.
[2024-06-07 17:42:38] [INFO ] Redundant transitions in 1198 ms returned []
Running 8986 sub problems to find dead transitions.
[2024-06-07 17:42:38] [INFO ] Invariant cache hit.
[2024-06-07 17:42:38] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4624 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 8986 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4624/13626 variables, and 119 constraints, problems are : Problem set: 0 solved, 8986 unsolved in 30137 ms.
Refiners :[Positive P Invariants (semi-flows): 119/135 constraints, State Equation: 0/4632 constraints, ReadFeed: 0/16 constraints, PredecessorRefiner: 8986/4497 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8986 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4624 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 8986 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4624/13626 variables, and 119 constraints, problems are : Problem set: 0 solved, 8986 unsolved in 30114 ms.
Refiners :[Positive P Invariants (semi-flows): 119/135 constraints, State Equation: 0/4632 constraints, ReadFeed: 0/16 constraints, PredecessorRefiner: 4489/4497 constraints, Known Traps: 0/0 constraints]
After SMT, in 147431ms problems are : Problem set: 0 solved, 8986 unsolved
Search for dead transitions found 0 dead transitions in 147518ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199464 ms. Remains : 4632/4632 places, 8994/8994 transitions.
FORMULA BlocksWorld-PT-13-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA BlocksWorld-PT-13-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-13-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-13-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-13-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA BlocksWorld-PT-13-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 67 out of 4632 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4632/4632 places, 8995/8995 transitions.
Applied a total of 0 rules in 2342 ms. Remains 4632 /4632 variables (removed 0) and now considering 8995/8995 (removed 0) transitions.
// Phase 1: matrix 8995 rows 4632 cols
[2024-06-07 17:45:08] [INFO ] Computed 135 invariants in 58 ms
[2024-06-07 17:45:13] [INFO ] Implicit Places using invariants in 5016 ms returned []
[2024-06-07 17:45:13] [INFO ] Invariant cache hit.
[2024-06-07 17:45:20] [INFO ] State equation strengthened by 17 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BlocksWorld-PT-13

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 4691
TRANSITIONS: 9113
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 45542
NUPN UNITS: 136
LOADING TIME: 30.921

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.29
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 31.882
OK.
----------------------------------------------------------------------
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: 693
MODEL NAME: /home/mcc/execution/model
4691 places, 9113 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.

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 LTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 16777216 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BlocksWorld-PT-13"
export BK_EXAMINATION="LTLCardinality"
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 LTLCardinality"
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-171774424100259"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;