MCC'2024- Execution of r602-tall-171774424800257

About the Execution of ITS-Tools for BlocksWorld-PT-13

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	757222.00	0.00	0.00	???????F????????	normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r602-tall-171774424800257.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 itstools
Input is BlocksWorld-PT-13, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r602-tall-171774424800257
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1717766736298

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-07 13:25:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 13:25:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 13:25:38] [INFO ] Load time of PNML (sax parser for PT used): 561 ms
[2024-06-07 13:25:38] [INFO ] Transformed 4691 places.
[2024-06-07 13:25:38] [INFO ] Transformed 9113 transitions.
[2024-06-07 13:25:38] [INFO ] Found NUPN structural information;
[2024-06-07 13:25:38] [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 13:25:38] [INFO ] Parsed PT model containing 4691 places and 9113 transitions and 45542 arcs in 760 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 155 ms.
Support contains 4691 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 56 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 13:25:38] [INFO ] Computed 135 invariants in 159 ms
[2024-06-07 13:25:39] [INFO ] Implicit Places using invariants in 1149 ms returned []
[2024-06-07 13:25:39] [INFO ] Invariant cache hit.
[2024-06-07 13:25:45] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-06-07 13:25:46] [INFO ] Implicit Places using invariants and state equation in 6255 ms returned []
Implicit Place search using SMT with State Equation took 7439 ms to find 0 implicit places.
Running 9105 sub problems to find dead transitions.
[2024-06-07 13:25:46] [INFO ] Invariant cache hit.
[2024-06-07 13:25:46] [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 30370 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 30110 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 144249ms problems are : Problem set: 118 solved, 8987 unsolved
Search for dead transitions found 118 dead transitions in 144395ms
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.
Deduced a syphon composed of 59 places in 5 ms
Applied a total of 0 rules in 62 ms. Remains 4691 /4691 variables (removed 0) and now considering 8995/8995 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152025 ms. Remains : 4691/4691 places, 8995/9113 transitions.
Deduced a syphon composed of 59 places in 15 ms
Reduce places removed 59 places and 0 transitions.
Support contains 4632 out of 4632 places after structural reductions.
[2024-06-07 13:28:11] [INFO ] Flatten gal took : 565 ms
[2024-06-07 13:28:12] [INFO ] Flatten gal took : 395 ms
[2024-06-07 13:28:13] [INFO ] Input system was already deterministic with 8995 transitions.
RANDOM walk for 40000 steps (8 resets) in 38162 ms. (1 steps per ms) remains 37/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 738 ms. (5 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 350 ms. (11 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 529 ms. (7 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 394 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 432 ms. (9 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 279 ms. (14 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 272 ms. (14 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 272 ms. (14 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1316 ms. (3 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 291 ms. (13 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 392 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 393 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1149 ms. (3 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 303 ms. (13 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 281 ms. (14 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 678 ms. (5 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 652 ms. (6 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 436 ms. (9 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 436 ms. (9 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1004 ms. (3 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 271 ms. (14 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 628 ms. (6 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 377 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 423 ms. (9 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 425 ms. (9 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 637 ms. (6 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 388 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 377 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 386 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 383 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 381 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 384 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 379 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 378 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 390 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 380 ms. (10 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 376 ms. (10 steps per ms) remains 36/36 properties
// Phase 1: matrix 8995 rows 4632 cols
[2024-06-07 13:28:28] [INFO ] Computed 135 invariants in 61 ms
[2024-06-07 13:28:28] [INFO ] State equation strengthened by 17 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4632 variables, 135/135 constraints. Problems are: Problem set: 21 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4632/13627 variables, and 135 constraints, problems are : Problem set: 21 solved, 15 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, State Equation: 0/4632 constraints, ReadFeed: 0/17 constraints, PredecessorRefiner: 21/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4632 variables, 135/135 constraints. Problems are: Problem set: 21 solved, 15 unsolved
[2024-06-07 13:28:49] [INFO ] Deduced a trap composed of 260 places in 7769 ms of which 222 ms to minimize.
SMT process timed out in 20580ms, After SMT, problems are : Problem set: 21 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4632 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 1712 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 1715 ms. Remains : 4632/4632 places, 8994/8995 transitions.
RANDOM walk for 40000 steps (8 resets) in 12920 ms. (3 steps per ms) remains 11/15 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2168 ms. (18 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 756 ms. (52 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10000 ms. (4 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2345 ms. (17 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 2552 ms. (15 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2701 ms. (14 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1538 ms. (25 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1660 ms. (24 steps per ms) remains 8/8 properties
// Phase 1: matrix 8994 rows 4632 cols
[2024-06-07 13:29:00] [INFO ] Computed 135 invariants in 55 ms
[2024-06-07 13:29:00] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4565 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 67/4632 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-07 13:29:08] [INFO ] Deduced a trap composed of 1118 places in 3032 ms of which 19 ms to minimize.
[2024-06-07 13:29:13] [INFO ] Deduced a trap composed of 1148 places in 5184 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/4632 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-07 13:29:16] [INFO ] Deduced a trap composed of 134 places in 267 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/4632 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-07 13:29:20] [INFO ] Deduced a trap composed of 434 places in 1887 ms of which 13 ms to minimize.
[2024-06-07 13:29:21] [INFO ] Deduced a trap composed of 590 places in 1152 ms of which 9 ms to minimize.
[2024-06-07 13:29:22] [INFO ] Deduced a trap composed of 134 places in 260 ms of which 2 ms to minimize.
[2024-06-07 13:29:25] [INFO ] Deduced a trap composed of 1100 places in 3055 ms of which 19 ms to minimize.
[2024-06-07 13:29:28] [INFO ] Deduced a trap composed of 1118 places in 3157 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/4632 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-07 13:29:33] [INFO ] Deduced a trap composed of 434 places in 3071 ms of which 19 ms to minimize.
[2024-06-07 13:29:35] [INFO ] Deduced a trap composed of 950 places in 2004 ms of which 14 ms to minimize.
[2024-06-07 13:29:40] [INFO ] Deduced a trap composed of 1188 places in 4568 ms of which 26 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/4632 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-07 13:29:47] [INFO ] Deduced a trap composed of 590 places in 5159 ms of which 26 ms to minimize.
SMT process timed out in 46397ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4565 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 1549 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 1551 ms. Remains : 4632/4632 places, 8994/8994 transitions.
RANDOM walk for 40000 steps (8 resets) in 12475 ms. (3 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2019 ms. (19 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 525 ms. (76 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10020 ms. (3 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1894 ms. (21 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2121 ms. (18 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2044 ms. (19 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1395 ms. (28 steps per ms) remains 7/7 properties
[2024-06-07 13:29:57] [INFO ] Invariant cache hit.
[2024-06-07 13:29:57] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4565 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 67/4632 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-07 13:30:07] [INFO ] Deduced a trap composed of 590 places in 5927 ms of which 25 ms to minimize.
[2024-06-07 13:30:13] [INFO ] Deduced a trap composed of 1118 places in 5932 ms of which 26 ms to minimize.
[2024-06-07 13:30:16] [INFO ] Deduced a trap composed of 1034 places in 2512 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/4632 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-07 13:30:25] [INFO ] Deduced a trap composed of 638 places in 7315 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/4632 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-07 13:30:30] [INFO ] Deduced a trap composed of 198 places in 2836 ms of which 18 ms to minimize.
[2024-06-07 13:30:32] [INFO ] Deduced a trap composed of 1008 places in 2242 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/4632 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-07 13:30:36] [INFO ] Deduced a trap composed of 378 places in 1810 ms of which 12 ms to minimize.
[2024-06-07 13:30:37] [INFO ] Deduced a trap composed of 638 places in 1043 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/4632 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-07 13:30:41] [INFO ] Deduced a trap composed of 884 places in 1756 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/4632 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-07 13:30:45] [INFO ] Deduced a trap composed of 260 places in 1202 ms of which 10 ms to minimize.
[2024-06-07 13:30:45] [INFO ] Deduced a trap composed of 540 places in 812 ms of which 7 ms to minimize.
[2024-06-07 13:30:47] [INFO ] Deduced a trap composed of 810 places in 1461 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/4632 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4632 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 8994/13626 variables, 4632/4779 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/13626 variables, 16/4795 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/13626 variables, 0/4795 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/13626 variables, 0/4795 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13626/13626 variables, and 4795 constraints, problems are : Problem set: 0 solved, 7 unsolved in 75051 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, State Equation: 4632/4632 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 7/2 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4565 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 67/4632 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4632 variables, 12/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-07 13:31:23] [INFO ] Deduced a trap composed of 770 places in 7501 ms of which 33 ms to minimize.
[2024-06-07 13:31:30] [INFO ] Deduced a trap composed of 134 places in 7088 ms of which 30 ms to minimize.
Problem AtomicPropp4 is UNSAT
[2024-06-07 13:31:36] [INFO ] Deduced a trap composed of 134 places in 5672 ms of which 27 ms to minimize.
[2024-06-07 13:31:42] [INFO ] Deduced a trap composed of 378 places in 5678 ms of which 27 ms to minimize.
[2024-06-07 13:31:47] [INFO ] Deduced a trap composed of 1100 places in 5568 ms of which 26 ms to minimize.
Problem AtomicPropp25 is UNSAT
[2024-06-07 13:31:49] [INFO ] Deduced a trap composed of 684 places in 1187 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/4632 variables, 6/153 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-07 13:31:51] [INFO ] Deduced a trap composed of 134 places in 143 ms of which 2 ms to minimize.
[2024-06-07 13:31:52] [INFO ] Deduced a trap composed of 134 places in 442 ms of which 4 ms to minimize.
[2024-06-07 13:31:52] [INFO ] Deduced a trap composed of 68 places in 320 ms of which 6 ms to minimize.
[2024-06-07 13:31:52] [INFO ] Deduced a trap composed of 134 places in 254 ms of which 2 ms to minimize.
[2024-06-07 13:31:58] [INFO ] Deduced a trap composed of 134 places in 5424 ms of which 28 ms to minimize.
[2024-06-07 13:32:03] [INFO ] Deduced a trap composed of 320 places in 5040 ms of which 26 ms to minimize.
[2024-06-07 13:32:09] [INFO ] Deduced a trap composed of 1160 places in 5170 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/4632 variables, 7/160 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-07 13:32:12] [INFO ] Deduced a trap composed of 260 places in 2239 ms of which 15 ms to minimize.
[2024-06-07 13:32:14] [INFO ] Deduced a trap composed of 848 places in 1723 ms of which 13 ms to minimize.
[2024-06-07 13:32:20] [INFO ] Deduced a trap composed of 198 places in 5438 ms of which 26 ms to minimize.
[2024-06-07 13:32:26] [INFO ] Deduced a trap composed of 1148 places in 5425 ms of which 28 ms to minimize.
[2024-06-07 13:32:28] [INFO ] Deduced a trap composed of 728 places in 2585 ms of which 15 ms to minimize.
SMT process timed out in 151685ms, After SMT, problems are : Problem set: 2 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4565 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 1452 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 1454 ms. Remains : 4632/4632 places, 8994/8994 transitions.
Successfully simplified 23 atomic propositions for a total of 16 simplifications.
FORMULA BlocksWorld-PT-13-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 13:32:30] [INFO ] Flatten gal took : 295 ms
[2024-06-07 13:32:31] [INFO ] Flatten gal took : 302 ms
[2024-06-07 13:32:31] [INFO ] Input system was already deterministic with 8995 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 4632/4632 places, 8995/8995 transitions.
Applied a total of 0 rules in 798 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 13:32:32] [INFO ] Computed 135 invariants in 54 ms
[2024-06-07 13:32:37] [INFO ] Implicit Places using invariants in 5034 ms returned []
[2024-06-07 13:32:37] [INFO ] Invariant cache hit.
[2024-06-07 13:32:43] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-07 13:32:56] [INFO ] Implicit Places using invariants and state equation in 18642 ms returned []
Implicit Place search using SMT with State Equation took 23680 ms to find 0 implicit places.
Running 8987 sub problems to find dead transitions.
[2024-06-07 13:32:56] [INFO ] Invariant cache hit.
[2024-06-07 13:32:56] [INFO ] State equation strengthened by 17 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/4624 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 8987 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4624/13627 variables, and 119 constraints, problems are : Problem set: 0 solved, 8987 unsolved in 30257 ms.
Refiners :[Positive P Invariants (semi-flows): 119/135 constraints, State Equation: 0/4632 constraints, ReadFeed: 0/17 constraints, PredecessorRefiner: 8987/4498 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8987 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4624 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 8987 unsolved
[2024-06-07 13:35:09] [INFO ] Deduced a trap composed of 320 places in 300 ms of which 4 ms to minimize.
[2024-06-07 13:35:11] [INFO ] Deduced a trap composed of 198 places in 191 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4624/13627 variables, and 121 constraints, problems are : Problem set: 0 solved, 8987 unsolved in 30134 ms.
Refiners :[Positive P Invariants (semi-flows): 119/135 constraints, State Equation: 0/4632 constraints, ReadFeed: 0/17 constraints, PredecessorRefiner: 4489/4498 constraints, Known Traps: 2/2 constraints]
After SMT, in 150940ms problems are : Problem set: 0 solved, 8987 unsolved
Search for dead transitions found 0 dead transitions in 151038ms
Finished structural reductions in LTL mode , in 1 iterations and 175558 ms. Remains : 4632/4632 places, 8995/8995 transitions.
[2024-06-07 13:35:27] [INFO ] Flatten gal took : 256 ms
[2024-06-07 13:35:27] [INFO ] Flatten gal took : 278 ms
[2024-06-07 13:35:28] [INFO ] Input system was already deterministic with 8995 transitions.
[2024-06-07 13:35:28] [INFO ] Flatten gal took : 266 ms
[2024-06-07 13:35:29] [INFO ] Flatten gal took : 272 ms
[2024-06-07 13:35:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality9926652022798635891.gal : 101 ms
[2024-06-07 13:35:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality13818711219589179170.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9926652022798635891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13818711219589179170.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-07 13:35:59] [INFO ] Flatten gal took : 268 ms
[2024-06-07 13:35:59] [INFO ] Applying decomposition
[2024-06-07 13:35:59] [INFO ] Flatten gal took : 273 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1380036929982574058.txt' '-o' '/tmp/graph1380036929982574058.bin' '-w' '/tmp/graph1380036929982574058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1380036929982574058.bin' '-l' '-1' '-v' '-w' '/tmp/graph1380036929982574058.weights' '-q' '0' '-e' '0.001'
[2024-06-07 13:36:00] [INFO ] Decomposing Gal with order
[2024-06-07 13:36:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 13:36:02] [INFO ] Removed a total of 17300 redundant transitions.
[2024-06-07 13:36:02] [INFO ] Flatten gal took : 1473 ms
[2024-06-07 13:36:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 422 labels/synchronizations in 302 ms.
[2024-06-07 13:36:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality9158232837396535238.gal : 118 ms
[2024-06-07 13:36:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality6898267394343788515.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9158232837396535238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6898267394343788515.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 4632/4632 places, 8995/8995 transitions.
Applied a total of 0 rules in 379 ms. Remains 4632 /4632 variables (removed 0) and now considering 8995/8995 (removed 0) transitions.
[2024-06-07 13:36:33] [INFO ] Invariant cache hit.
[2024-06-07 13:36:39] [INFO ] Implicit Places using invariants in 5120 ms returned []
[2024-06-07 13:36:39] [INFO ] Invariant cache hit.
[2024-06-07 13:36:45] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-07 13:36:57] [INFO ] Implicit Places using invariants and state equation in 18746 ms returned []
Implicit Place search using SMT with State Equation took 23876 ms to find 0 implicit places.
Running 8987 sub problems to find dead transitions.
[2024-06-07 13:36:57] [INFO ] Invariant cache hit.
[2024-06-07 13:36:57] [INFO ] State equation strengthened by 17 read => feed constraints.

BK_STOP 1717767493520

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BlocksWorld-PT-13, 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 r602-tall-171774424800257"
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 [ "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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;