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-171774423900161.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-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r601-tall-171774423900161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 42K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 240K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 93K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 500K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 32K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 192K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K 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 87K 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-01-CTLCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717745433228

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-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 07:30:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 07:30:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:30:34] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-07 07:30:34] [INFO ] Transformed 109 places.
[2024-06-07 07:30:34] [INFO ] Transformed 181 transitions.
[2024-06-07 07:30:34] [INFO ] Found NUPN structural information;
[2024-06-07 07:30:34] [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]
[2024-06-07 07:30:34] [INFO ] Parsed PT model containing 109 places and 181 transitions and 896 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Support contains 109 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 181/181 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 181/181 (removed 0) transitions.
// Phase 1: matrix 181 rows 109 cols
[2024-06-07 07:30:34] [INFO ] Computed 19 invariants in 19 ms
[2024-06-07 07:30:34] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-07 07:30:34] [INFO ] Invariant cache hit.
[2024-06-07 07:30:35] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-07 07:30:35] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-06-07 07:30:35] [INFO ] Invariant cache hit.
[2024-06-07 07:30:35] [INFO ] State equation strengthened by 15 read => feed constraints.
Problem TDEAD28 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 14 solved, 165 unsolved
[2024-06-07 07:30:36] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 11 ms to minimize.
[2024-06-07 07:30:36] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 2/17 constraints. Problems are: Problem set: 14 solved, 165 unsolved
[2024-06-07 07:30:37] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/18 constraints. Problems are: Problem set: 14 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 14 solved, 165 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/109 variables, 4/22 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:38] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:30:38] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:30:38] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 3/25 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:39] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 1/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 180/289 variables, 109/135 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 14/149 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/149 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 1/290 variables, 1/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 0/290 variables, 0/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 150 constraints, problems are : Problem set: 18 solved, 161 unsolved in 7343 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 18 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/7 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 11/109 variables, 18/25 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:44] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/27 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/27 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 180/289 variables, 109/136 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 14/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 161/311 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:46] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:30:46] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:30:46] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:30:46] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:30:46] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
[2024-06-07 07:30:46] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:30:46] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-07 07:30:46] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:30:46] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:30:46] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:30:46] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:30:47] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:30:47] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 5 ms to minimize.
[2024-06-07 07:30:47] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:30:47] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:30:47] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:30:47] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:30:47] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:30:47] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:30:47] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 20/331 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:48] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:30:48] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:30:48] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:30:49] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:30:49] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:30:49] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:30:49] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 2 ms to minimize.
[2024-06-07 07:30:50] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 8/339 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:51] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:30:52] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:30:52] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:30:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 4/343 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:54] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:30:55] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:30:55] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 3/346 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:57] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:30:59] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 2/348 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:00] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:31:01] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 2/350 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:04] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/289 variables, 1/351 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:07] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:31:07] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/289 variables, 2/353 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:10] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/289 variables, 1/354 constraints. Problems are: Problem set: 18 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/290 variables, and 354 constraints, problems are : Problem set: 18 solved, 161 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 14/15 constraints, PredecessorRefiner: 161/179 constraints, Known Traps: 51/51 constraints]
After SMT, in 37979ms problems are : Problem set: 18 solved, 161 unsolved
Search for dead transitions found 18 dead transitions in 37996ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/109 places, 163/181 transitions.
Deduced a syphon composed of 9 places in 1 ms
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38561 ms. Remains : 109/109 places, 163/181 transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Support contains 100 out of 100 places after structural reductions.
[2024-06-07 07:31:13] [INFO ] Flatten gal took : 41 ms
[2024-06-07 07:31:13] [INFO ] Flatten gal took : 18 ms
[2024-06-07 07:31:13] [INFO ] Input system was already deterministic with 163 transitions.
RANDOM walk for 40000 steps (8 resets) in 5217 ms. (7 steps per ms) remains 31/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
// Phase 1: matrix 163 rows 100 cols
[2024-06-07 07:31:15] [INFO ] Computed 19 invariants in 2 ms
[2024-06-07 07:31:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp63 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 19/19 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 29 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 29 solved, 2 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 29 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/100 variables, 19/19 constraints. Problems are: Problem set: 29 solved, 2 unsolved
[2024-06-07 07:31:16] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Int declared 100/263 variables, and 20 constraints, problems are : Problem set: 31 solved, 0 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 0/100 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/31 constraints, Known Traps: 1/1 constraints]
After SMT, in 531ms problems are : Problem set: 31 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 31 atomic propositions for a total of 16 simplifications.
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:31:16] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 15 ms
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:31:16] [INFO ] Input system was already deterministic with 163 transitions.
Support contains 39 out of 100 places (down from 47) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 15 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:31:16] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 26 ms
[2024-06-07 07:31:16] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 18 ms
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 25 ms
[2024-06-07 07:31:16] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 13 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 22 ms
[2024-06-07 07:31:16] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 16 ms
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:31:16] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 8 ms
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:31:16] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 11 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 8 ms
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:31:16] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 8 ms
[2024-06-07 07:31:16] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 8 ms
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 8 ms
[2024-06-07 07:31:16] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 7 ms
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 7 ms
[2024-06-07 07:31:16] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 7 ms
[2024-06-07 07:31:16] [INFO ] Flatten gal took : 8 ms
[2024-06-07 07:31:16] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-07 07:31:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 163 transitions and 806 arcs took 3 ms.
Total runtime 42409 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BlocksWorld-PT-01

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 100
TRANSITIONS: 163
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


SAVING FILE /home/mcc/execution/417/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: 714
MODEL NAME: /home/mcc/execution/417/model
100 places, 163 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.
Building monolithic NSF...
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717745770987

--------------------
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

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-01"
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-01, 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-171774423900161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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