fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r605-tall-171774426700177
Last Updated
July 7, 2024

About the Execution of LTSMin+red for BlocksWorld-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2081.348 72036.00 106590.00 265.90 TTT?TFF???????TT 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-171774426700177.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-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426700177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 83K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 410K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 176K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 991K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 186K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 89K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 444K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 91K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 510K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 16K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 39K 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 330K 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-03-CTLCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-03-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717745608165

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-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:33:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 07:33:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:33:29] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-06-07 07:33:29] [INFO ] Transformed 379 places.
[2024-06-07 07:33:29] [INFO ] Transformed 685 transitions.
[2024-06-07 07:33:29] [INFO ] Found NUPN structural information;
[2024-06-07 07:33:29] [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]
[2024-06-07 07:33:29] [INFO ] Parsed PT model containing 379 places and 685 transitions and 3412 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
Support contains 379 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 685/685 transitions.
Applied a total of 0 rules in 13 ms. Remains 379 /379 variables (removed 0) and now considering 685/685 (removed 0) transitions.
// Phase 1: matrix 685 rows 379 cols
[2024-06-07 07:33:29] [INFO ] Computed 37 invariants in 36 ms
[2024-06-07 07:33:29] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-06-07 07:33:29] [INFO ] Invariant cache hit.
[2024-06-07 07:33:30] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-07 07:33:30] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 680 sub problems to find dead transitions.
[2024-06-07 07:33:30] [INFO ] Invariant cache hit.
[2024-06-07 07:33:30] [INFO ] State equation strengthened by 27 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD682 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 27/27 constraints. Problems are: Problem set: 26 solved, 654 unsolved
[2024-06-07 07:33:38] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 16 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 1/28 constraints. Problems are: Problem set: 26 solved, 654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/28 constraints. Problems are: Problem set: 26 solved, 654 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD678 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/379 variables, 10/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/417 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/443 constraints. Problems are: Problem set: 36 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1063/1064 variables, and 443 constraints, problems are : Problem set: 36 solved, 644 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/27 constraints, PredecessorRefiner: 680/680 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 36 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 1/1 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 1/2 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/2 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 3 (OVERLAPS) 23/379 variables, 36/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/417 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/443 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 644/1087 constraints. Problems are: Problem set: 36 solved, 644 unsolved
[2024-06-07 07:34:29] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:34:29] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 1 ms to minimize.
[2024-06-07 07:34:29] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:34:29] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:34:30] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:34:30] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:34:30] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-06-07 07:34:30] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:34:31] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:34:31] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:34:31] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
[2024-06-07 07:34:32] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 2 ms to minimize.
[2024-06-07 07:34:32] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:34:33] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:34:34] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:34:34] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1063/1064 variables, and 1103 constraints, problems are : Problem set: 36 solved, 644 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/27 constraints, PredecessorRefiner: 644/680 constraints, Known Traps: 17/17 constraints]
After SMT, in 64313ms problems are : Problem set: 36 solved, 644 unsolved
Search for dead transitions found 36 dead transitions in 64338ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 379/379 places, 649/685 transitions.
Deduced a syphon composed of 18 places in 2 ms
Applied a total of 0 rules in 4 ms. Remains 379 /379 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64950 ms. Remains : 379/379 places, 649/685 transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Support contains 361 out of 361 places after structural reductions.
[2024-06-07 07:34:34] [INFO ] Flatten gal took : 84 ms
[2024-06-07 07:34:34] [INFO ] Flatten gal took : 50 ms
[2024-06-07 07:34:35] [INFO ] Input system was already deterministic with 649 transitions.
RANDOM walk for 40000 steps (8 resets) in 4276 ms. (9 steps per ms) remains 46/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 41/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 113 ms. (35 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
// Phase 1: matrix 649 rows 361 cols
[2024-06-07 07:34:37] [INFO ] Computed 37 invariants in 3 ms
[2024-06-07 07:34:37] [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 AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 37/37 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 0/399 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/1010 variables, 0/399 constraints. Problems are: Problem set: 40 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 40 solved, 1 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 324/343 variables, 19/19 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/19 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/361 variables, 18/37 constraints. Problems are: Problem set: 40 solved, 1 unsolved
[2024-06-07 07:34:38] [INFO ] Deduced a trap composed of 96 places in 151 ms of which 3 ms to minimize.
[2024-06-07 07:34:38] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 3 ms to minimize.
[2024-06-07 07:34:38] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Int declared 361/1010 variables, and 40 constraints, problems are : Problem set: 41 solved, 0 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/41 constraints, Known Traps: 3/3 constraints]
After SMT, in 1602ms problems are : Problem set: 41 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 41 atomic propositions for a total of 16 simplifications.
FORMULA BlocksWorld-PT-03-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:34:38] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-07 07:34:38] [INFO ] Flatten gal took : 40 ms
[2024-06-07 07:34:38] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-07 07:34:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BlocksWorld-PT-03-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:34:38] [INFO ] Flatten gal took : 36 ms
FORMULA BlocksWorld-PT-03-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:34:38] [INFO ] Input system was already deterministic with 649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 4 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 361/361 places, 649/649 transitions.
[2024-06-07 07:34:38] [INFO ] Flatten gal took : 30 ms
[2024-06-07 07:34:38] [INFO ] Flatten gal took : 29 ms
[2024-06-07 07:34:38] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 30 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 361/361 places, 649/649 transitions.
[2024-06-07 07:34:38] [INFO ] Flatten gal took : 24 ms
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 25 ms
[2024-06-07 07:34:39] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 12 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 361/361 places, 649/649 transitions.
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 32 ms
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 23 ms
[2024-06-07 07:34:39] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 56 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 361/361 places, 649/649 transitions.
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 21 ms
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 23 ms
[2024-06-07 07:34:39] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 9 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 361/361 places, 649/649 transitions.
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 21 ms
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 22 ms
[2024-06-07 07:34:39] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 9 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 361/361 places, 649/649 transitions.
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 23 ms
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 24 ms
[2024-06-07 07:34:39] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 9 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 361/361 places, 649/649 transitions.
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 20 ms
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 22 ms
[2024-06-07 07:34:39] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 32 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 361/361 places, 649/649 transitions.
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 19 ms
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 21 ms
[2024-06-07 07:34:39] [INFO ] Input system was already deterministic with 649 transitions.
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 22 ms
[2024-06-07 07:34:39] [INFO ] Flatten gal took : 21 ms
[2024-06-07 07:34:39] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-07 07:34:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 361 places, 649 transitions and 3232 arcs took 7 ms.
Total runtime 70594 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BlocksWorld-PT-03-CTLCardinality-2024-03
Could not compute solution for formula : BlocksWorld-PT-03-CTLCardinality-2024-07
Could not compute solution for formula : BlocksWorld-PT-03-CTLCardinality-2024-08
Could not compute solution for formula : BlocksWorld-PT-03-CTLCardinality-2024-09
Could not compute solution for formula : BlocksWorld-PT-03-CTLCardinality-2024-10
Could not compute solution for formula : BlocksWorld-PT-03-CTLCardinality-2024-11
Could not compute solution for formula : BlocksWorld-PT-03-CTLCardinality-2024-12
Could not compute solution for formula : BlocksWorld-PT-03-CTLCardinality-2024-13

BK_STOP 1717745680201

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//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//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BlocksWorld-PT-03-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/588/ctl_0_
ctl formula name BlocksWorld-PT-03-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/588/ctl_1_
ctl formula name BlocksWorld-PT-03-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/588/ctl_2_
ctl formula name BlocksWorld-PT-03-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/588/ctl_3_
ctl formula name BlocksWorld-PT-03-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/588/ctl_4_
ctl formula name BlocksWorld-PT-03-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/588/ctl_5_
ctl formula name BlocksWorld-PT-03-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/588/ctl_6_
ctl formula name BlocksWorld-PT-03-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/588/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-03"
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-03, 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-171774426700177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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