Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r601-tall-171774423900169.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BlocksWorld-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r601-tall-171774423900169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 73K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 367K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 224K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 81K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 407K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 631K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K 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 175K 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-02-CTLCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717745455203

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 07:30:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 07:30:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:30:56] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-07 07:30:56] [INFO ] Transformed 209 places.
[2024-06-07 07:30:56] [INFO ] Transformed 365 transitions.
[2024-06-07 07:30:56] [INFO ] Found NUPN structural information;
[2024-06-07 07:30:56] [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]
[2024-06-07 07:30:56] [INFO ] Parsed PT model containing 209 places and 365 transitions and 1810 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Support contains 209 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Applied a total of 0 rules in 10 ms. Remains 209 /209 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 209 cols
[2024-06-07 07:30:56] [INFO ] Computed 27 invariants in 21 ms
[2024-06-07 07:30:56] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-07 07:30:56] [INFO ] Invariant cache hit.
[2024-06-07 07:30:56] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-07 07:30:57] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-07 07:30:57] [INFO ] Invariant cache hit.
[2024-06-07 07:30:57] [INFO ] State equation strengthened by 19 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 20/20 constraints. Problems are: Problem set: 20 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 20 solved, 341 unsolved
Problem TDEAD40 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/209 variables, 7/27 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:31:01] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 9 ms to minimize.
[2024-06-07 07:31:01] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 364/573 variables, 209/238 constraints. Problems are: Problem set: 26 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 18/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 257 constraints, problems are : Problem set: 26 solved, 335 unsolved in 17342 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 209/209 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 26 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 1/1 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/1 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 17/209 variables, 26/27 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 364/573 variables, 209/238 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 18/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 335/591 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:31:23] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-06-07 07:31:23] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 6 ms to minimize.
[2024-06-07 07:31:23] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:31:23] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:31:23] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:31:23] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:31:23] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:31:23] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:31:23] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:31:23] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:31:24] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 3 ms to minimize.
[2024-06-07 07:31:24] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:31:24] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:31:24] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:31:24] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:31:24] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:31:24] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:31:24] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:31:24] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:31:25] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 20/611 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 20/631 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:31:39] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:31:39] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:31:40] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:31:40] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:31:40] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:31:40] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:40] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:31:40] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 2 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:31:43] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:31:43] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:31:43] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 6 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
SMT process timed out in 48670ms, After SMT, problems are : Problem set: 26 solved, 335 unsolved
Search for dead transitions found 26 dead transitions in 48687ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 209/209 places, 339/365 transitions.
Deduced a syphon composed of 13 places in 1 ms
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49104 ms. Remains : 209/209 places, 339/365 transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Support contains 196 out of 196 places after structural reductions.
[2024-06-07 07:31:46] [INFO ] Flatten gal took : 58 ms
[2024-06-07 07:31:46] [INFO ] Flatten gal took : 28 ms
[2024-06-07 07:31:46] [INFO ] Input system was already deterministic with 339 transitions.
RANDOM walk for 40000 steps (8 resets) in 3232 ms. (12 steps per ms) remains 33/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 114 ms. (34 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 32/32 properties
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:31:47] [INFO ] Computed 27 invariants in 4 ms
[2024-06-07 07:31:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp0 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 AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp62 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 27/27 constraints. Problems are: Problem set: 30 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 30 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 30 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 30 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 30 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 30 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 30 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 30 solved, 2 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 30 solved, 2 unsolved
[2024-06-07 07:31:48] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/2 constraints. Problems are: Problem set: 30 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 30 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 3 (OVERLAPS) 156/196 variables, 26/28 constraints. Problems are: Problem set: 31 solved, 1 unsolved
[2024-06-07 07:31:48] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:31:48] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:31:48] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-06-07 07:31:48] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:31:48] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-06-07 07:31:48] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:31:50] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:31:50] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:31:50] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 20/48 constraints. Problems are: Problem set: 31 solved, 1 unsolved
[2024-06-07 07:31:50] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:31:50] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:31:50] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:31:50] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:31:50] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-06-07 07:31:50] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:31:50] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Int declared 196/535 variables, and 55 constraints, problems are : Problem set: 32 solved, 0 unsolved in 2593 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/32 constraints, Known Traps: 28/28 constraints]
After SMT, in 3098ms problems are : Problem set: 32 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 32 atomic propositions for a total of 16 simplifications.
FORMULA BlocksWorld-PT-02-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-02-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:31:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-07 07:31:50] [INFO ] Flatten gal took : 23 ms
[2024-06-07 07:31:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BlocksWorld-PT-02-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-02-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-02-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:31:50] [INFO ] Flatten gal took : 23 ms
[2024-06-07 07:31:50] [INFO ] Input system was already deterministic with 339 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 13 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 19 ms
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 19 ms
[2024-06-07 07:31:51] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 11 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 16 ms
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 18 ms
[2024-06-07 07:31:51] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 16 ms
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 15 ms
[2024-06-07 07:31:51] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 5 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:31:51] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 1 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:31:51] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 31 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:31:51] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:31:51] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:31:51] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 14 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:31:51] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:31:51] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 12 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:31:51] [INFO ] Input system was already deterministic with 339 transitions.
RANDOM walk for 20969 steps (4 resets) in 315 ms. (66 steps per ms) remains 0/1 properties
FORMULA BlocksWorld-PT-02-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:31:51] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:31:51] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-07 07:31:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 196 places, 339 transitions and 1680 arcs took 6 ms.
Total runtime 55630 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BlocksWorld-PT-02

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 819
MODEL NAME: /home/mcc/execution/414/model
196 places, 339 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BlocksWorld-PT-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BlocksWorld-PT-02, 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 r601-tall-171774423900169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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