About the Execution of LTSMin+red for BlocksWorld-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1135.684 | 93226.00 | 138013.00 | 268.70 | ?FFTT??F?F???FT? | normal |
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.r605-tall-171774426700185.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 ltsminxred
Input is BlocksWorld-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426700185
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.1M
-rw-r--r-- 1 mcc users 120K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 557K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 164K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 943K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 20K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 99K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 405K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 258K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 750K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K 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 532K 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-04-CTLCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-04-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717745947225
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:39:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 07:39:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:39:08] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-06-07 07:39:08] [INFO ] Transformed 599 places.
[2024-06-07 07:39:08] [INFO ] Transformed 1105 transitions.
[2024-06-07 07:39:08] [INFO ] Found NUPN structural information;
[2024-06-07 07:39:08] [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]
[2024-06-07 07:39:08] [INFO ] Parsed PT model containing 599 places and 1105 transitions and 5512 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
Support contains 599 out of 599 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 599/599 places, 1105/1105 transitions.
Applied a total of 0 rules in 29 ms. Remains 599 /599 variables (removed 0) and now considering 1105/1105 (removed 0) transitions.
// Phase 1: matrix 1105 rows 599 cols
[2024-06-07 07:39:08] [INFO ] Computed 47 invariants in 29 ms
[2024-06-07 07:39:09] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-07 07:39:09] [INFO ] Invariant cache hit.
[2024-06-07 07:39:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-07 07:39:09] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Running 1102 sub problems to find dead transitions.
[2024-06-07 07:39:09] [INFO ] Invariant cache hit.
[2024-06-07 07:39:09] [INFO ] State equation strengthened by 41 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1102 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 41/41 constraints. Problems are: Problem set: 40 solved, 1062 unsolved
[2024-06-07 07:39:26] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 14 ms to minimize.
[2024-06-07 07:39:27] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/596 variables, 2/43 constraints. Problems are: Problem set: 40 solved, 1062 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/1704 variables, and 43 constraints, problems are : Problem set: 40 solved, 1062 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 41/47 constraints, State Equation: 0/599 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 1082/553 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 40 solved, 1062 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 4/4 constraints. Problems are: Problem set: 40 solved, 1062 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 2/6 constraints. Problems are: Problem set: 40 solved, 1062 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 0/6 constraints. Problems are: Problem set: 40 solved, 1062 unsolved
Problem TDEAD286 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1092 is UNSAT
At refinement iteration 3 (OVERLAPS) 23/599 variables, 43/49 constraints. Problems are: Problem set: 46 solved, 1056 unsolved
[2024-06-07 07:39:57] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:39:57] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 2/51 constraints. Problems are: Problem set: 46 solved, 1056 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/1704 variables, and 51 constraints, problems are : Problem set: 46 solved, 1056 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 0/599 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 529/553 constraints, Known Traps: 4/4 constraints]
After SMT, in 67436ms problems are : Problem set: 46 solved, 1056 unsolved
Search for dead transitions found 46 dead transitions in 67465ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 599/599 places, 1059/1105 transitions.
Deduced a syphon composed of 23 places in 1 ms
Applied a total of 0 rules in 6 ms. Remains 599 /599 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68288 ms. Remains : 599/599 places, 1059/1105 transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Support contains 576 out of 576 places after structural reductions.
FORMULA BlocksWorld-PT-04-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:40:17] [INFO ] Flatten gal took : 115 ms
[2024-06-07 07:40:17] [INFO ] Flatten gal took : 77 ms
[2024-06-07 07:40:17] [INFO ] Input system was already deterministic with 1059 transitions.
RANDOM walk for 40000 steps (8 resets) in 4288 ms. (9 steps per ms) remains 31/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 122 ms. (32 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 30/30 properties
// Phase 1: matrix 1059 rows 576 cols
[2024-06-07 07:40:19] [INFO ] Computed 47 invariants in 8 ms
[2024-06-07 07:40:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 47/47 constraints. Problems are: Problem set: 25 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 25 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1058/1634 variables, 576/623 constraints. Problems are: Problem set: 25 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1634 variables, 0/623 constraints. Problems are: Problem set: 25 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/1635 variables, 1/624 constraints. Problems are: Problem set: 25 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1635 variables, 0/624 constraints. Problems are: Problem set: 25 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/1635 variables, 0/624 constraints. Problems are: Problem set: 25 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1635/1635 variables, and 624 constraints, problems are : Problem set: 25 solved, 5 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 576/576 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 25 solved, 5 unsolved
Problem AtomicPropp30 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 47/47 constraints. Problems are: Problem set: 26 solved, 4 unsolved
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 4 ms to minimize.
Problem AtomicPropp7 is UNSAT
[2024-06-07 07:40:22] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 3 ms to minimize.
[2024-06-07 07:40:22] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 4 ms to minimize.
[2024-06-07 07:40:22] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 4 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 3 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 156 places in 253 ms of which 4 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 4 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 144 places in 251 ms of which 4 ms to minimize.
[2024-06-07 07:40:24] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 3 ms to minimize.
[2024-06-07 07:40:24] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 3 ms to minimize.
[2024-06-07 07:40:24] [INFO ] Deduced a trap composed of 144 places in 253 ms of which 4 ms to minimize.
[2024-06-07 07:40:24] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 4 ms to minimize.
[2024-06-07 07:40:25] [INFO ] Deduced a trap composed of 154 places in 259 ms of which 4 ms to minimize.
[2024-06-07 07:40:25] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 3 ms to minimize.
[2024-06-07 07:40:25] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 4 ms to minimize.
[2024-06-07 07:40:26] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 4 ms to minimize.
[2024-06-07 07:40:26] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 4 ms to minimize.
[2024-06-07 07:40:26] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 4 ms to minimize.
SMT process timed out in 7121ms, After SMT, problems are : Problem set: 26 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 575 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 1059/1059 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 576 transition count 1058
Applied a total of 1 rules in 80 ms. Remains 576 /576 variables (removed 0) and now considering 1058/1059 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 576/576 places, 1058/1059 transitions.
RANDOM walk for 40000 steps (8 resets) in 1005 ms. (39 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 449 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
// Phase 1: matrix 1058 rows 576 cols
[2024-06-07 07:40:27] [INFO ] Computed 47 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/575 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/575 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/576 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1058/1634 variables, 576/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1634 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1634 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1634/1634 variables, and 623 constraints, problems are : Problem set: 0 solved, 2 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 576/576 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/575 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:40:28] [INFO ] Deduced a trap composed of 136 places in 256 ms of which 3 ms to minimize.
[2024-06-07 07:40:28] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 3 ms to minimize.
[2024-06-07 07:40:28] [INFO ] Deduced a trap composed of 84 places in 243 ms of which 3 ms to minimize.
[2024-06-07 07:40:28] [INFO ] Deduced a trap composed of 144 places in 207 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/575 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/575 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/576 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:40:29] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 3 ms to minimize.
[2024-06-07 07:40:29] [INFO ] Deduced a trap composed of 154 places in 246 ms of which 3 ms to minimize.
[2024-06-07 07:40:29] [INFO ] Deduced a trap composed of 136 places in 243 ms of which 4 ms to minimize.
[2024-06-07 07:40:29] [INFO ] Deduced a trap composed of 156 places in 253 ms of which 3 ms to minimize.
[2024-06-07 07:40:30] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 4 ms to minimize.
[2024-06-07 07:40:30] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 4 ms to minimize.
[2024-06-07 07:40:30] [INFO ] Deduced a trap composed of 100 places in 249 ms of which 4 ms to minimize.
[2024-06-07 07:40:31] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 3 ms to minimize.
[2024-06-07 07:40:31] [INFO ] Deduced a trap composed of 136 places in 250 ms of which 4 ms to minimize.
[2024-06-07 07:40:31] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 3 ms to minimize.
[2024-06-07 07:40:31] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 4 ms to minimize.
[2024-06-07 07:40:32] [INFO ] Deduced a trap composed of 136 places in 244 ms of which 3 ms to minimize.
[2024-06-07 07:40:32] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 3 ms to minimize.
[2024-06-07 07:40:32] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 4 ms to minimize.
[2024-06-07 07:40:32] [INFO ] Deduced a trap composed of 100 places in 248 ms of which 4 ms to minimize.
[2024-06-07 07:40:33] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 3 ms to minimize.
[2024-06-07 07:40:33] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 4 ms to minimize.
[2024-06-07 07:40:33] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 4 ms to minimize.
[2024-06-07 07:40:33] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 3 ms to minimize.
[2024-06-07 07:40:34] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:40:34] [INFO ] Deduced a trap composed of 84 places in 247 ms of which 3 ms to minimize.
[2024-06-07 07:40:34] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
[2024-06-07 07:40:34] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
[2024-06-07 07:40:35] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 4 ms to minimize.
[2024-06-07 07:40:35] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 4 ms to minimize.
[2024-06-07 07:40:35] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 3 ms to minimize.
[2024-06-07 07:40:36] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 4 ms to minimize.
[2024-06-07 07:40:36] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 3 ms to minimize.
[2024-06-07 07:40:36] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 4 ms to minimize.
[2024-06-07 07:40:36] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 4 ms to minimize.
[2024-06-07 07:40:37] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 7 ms to minimize.
[2024-06-07 07:40:37] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 3 ms to minimize.
[2024-06-07 07:40:37] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Int declared 576/1634 variables, and 84 constraints, problems are : Problem set: 2 solved, 0 unsolved in 10331 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 0/576 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 37/37 constraints]
After SMT, in 10881ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 29 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA BlocksWorld-PT-04-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-04-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-04-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-04-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-04-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:40:38] [INFO ] Flatten gal took : 49 ms
[2024-06-07 07:40:38] [INFO ] Flatten gal took : 46 ms
[2024-06-07 07:40:38] [INFO ] Input system was already deterministic with 1059 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 201 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 202 ms. Remains : 576/576 places, 1059/1059 transitions.
[2024-06-07 07:40:38] [INFO ] Flatten gal took : 37 ms
[2024-06-07 07:40:38] [INFO ] Flatten gal took : 39 ms
[2024-06-07 07:40:38] [INFO ] Input system was already deterministic with 1059 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 64 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 576/576 places, 1059/1059 transitions.
[2024-06-07 07:40:38] [INFO ] Flatten gal took : 37 ms
[2024-06-07 07:40:38] [INFO ] Flatten gal took : 36 ms
[2024-06-07 07:40:38] [INFO ] Input system was already deterministic with 1059 transitions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 22 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 576/576 places, 1059/1059 transitions.
[2024-06-07 07:40:38] [INFO ] Flatten gal took : 34 ms
[2024-06-07 07:40:39] [INFO ] Flatten gal took : 35 ms
[2024-06-07 07:40:39] [INFO ] Input system was already deterministic with 1059 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 59 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 576/576 places, 1059/1059 transitions.
[2024-06-07 07:40:39] [INFO ] Flatten gal took : 33 ms
[2024-06-07 07:40:39] [INFO ] Flatten gal took : 35 ms
[2024-06-07 07:40:39] [INFO ] Input system was already deterministic with 1059 transitions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 22 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 576/576 places, 1059/1059 transitions.
[2024-06-07 07:40:39] [INFO ] Flatten gal took : 32 ms
[2024-06-07 07:40:39] [INFO ] Flatten gal took : 34 ms
[2024-06-07 07:40:39] [INFO ] Input system was already deterministic with 1059 transitions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 25 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 576/576 places, 1059/1059 transitions.
[2024-06-07 07:40:39] [INFO ] Flatten gal took : 33 ms
[2024-06-07 07:40:39] [INFO ] Flatten gal took : 34 ms
[2024-06-07 07:40:39] [INFO ] Input system was already deterministic with 1059 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 55 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 576/576 places, 1059/1059 transitions.
[2024-06-07 07:40:39] [INFO ] Flatten gal took : 31 ms
[2024-06-07 07:40:39] [INFO ] Flatten gal took : 33 ms
[2024-06-07 07:40:39] [INFO ] Input system was already deterministic with 1059 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 58 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 576/576 places, 1059/1059 transitions.
[2024-06-07 07:40:39] [INFO ] Flatten gal took : 30 ms
[2024-06-07 07:40:39] [INFO ] Flatten gal took : 32 ms
[2024-06-07 07:40:40] [INFO ] Input system was already deterministic with 1059 transitions.
[2024-06-07 07:40:40] [INFO ] Flatten gal took : 32 ms
[2024-06-07 07:40:40] [INFO ] Flatten gal took : 32 ms
[2024-06-07 07:40:40] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-07 07:40:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 576 places, 1059 transitions and 5282 arcs took 12 ms.
Total runtime 91851 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : BlocksWorld-PT-04-CTLCardinality-2024-00
Could not compute solution for formula : BlocksWorld-PT-04-CTLCardinality-2024-05
Could not compute solution for formula : BlocksWorld-PT-04-CTLCardinality-2024-06
Could not compute solution for formula : BlocksWorld-PT-04-CTLCardinality-2024-08
Could not compute solution for formula : BlocksWorld-PT-04-CTLCardinality-2024-10
Could not compute solution for formula : BlocksWorld-PT-04-CTLCardinality-2024-11
Could not compute solution for formula : BlocksWorld-PT-04-CTLCardinality-2024-12
Could not compute solution for formula : BlocksWorld-PT-04-CTLCardinality-2024-15
BK_STOP 1717746040451
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BlocksWorld-PT-04-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/714/ctl_0_
ctl formula name BlocksWorld-PT-04-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/714/ctl_1_
ctl formula name BlocksWorld-PT-04-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/714/ctl_2_
ctl formula name BlocksWorld-PT-04-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/714/ctl_3_
ctl formula name BlocksWorld-PT-04-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/714/ctl_4_
ctl formula name BlocksWorld-PT-04-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/714/ctl_5_
ctl formula name BlocksWorld-PT-04-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/714/ctl_6_
ctl formula name BlocksWorld-PT-04-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/714/ctl_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-04"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BlocksWorld-PT-04, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r605-tall-171774426700185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-04.tgz
mv BlocksWorld-PT-04 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;