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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 26M
-rw-r--r-- 1 mcc users 534K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 500K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 28K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 258K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 1.3M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.8M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.4M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 41K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 97K 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 2.3M 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-09-CTLFireability-2024-00
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-01
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-02
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-03
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-04
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-05
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-06
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-07
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-08
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-09
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-10
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-11
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-12
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-13
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-14
FORMULA_NAME BlocksWorld-PT-09-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717767268124

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 13:34:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 13:34:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 13:34:29] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2024-06-07 13:34:29] [INFO ] Transformed 2449 places.
[2024-06-07 13:34:29] [INFO ] Transformed 4705 transitions.
[2024-06-07 13:34:29] [INFO ] Found NUPN structural information;
[2024-06-07 13:34: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, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47]
[2024-06-07 13:34:29] [INFO ] Parsed PT model containing 2449 places and 4705 transitions and 23506 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 120 ms.
Support contains 2449 out of 2449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2449/2449 places, 4705/4705 transitions.
Applied a total of 0 rules in 35 ms. Remains 2449 /2449 variables (removed 0) and now considering 4705/4705 (removed 0) transitions.
// Phase 1: matrix 4705 rows 2449 cols
[2024-06-07 13:34:30] [INFO ] Computed 97 invariants in 92 ms
[2024-06-07 13:34:31] [INFO ] Implicit Places using invariants in 697 ms returned []
[2024-06-07 13:34:31] [INFO ] Invariant cache hit.
[2024-06-07 13:34:33] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-07 13:34:33] [INFO ] Implicit Places using invariants and state equation in 2680 ms returned []
Implicit Place search using SMT with State Equation took 3408 ms to find 0 implicit places.
Running 4702 sub problems to find dead transitions.
[2024-06-07 13:34:33] [INFO ] Invariant cache hit.
[2024-06-07 13:34:33] [INFO ] State equation strengthened by 91 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2252 is UNSAT
Problem TDEAD2301 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2724 is UNSAT
Problem TDEAD2812 is UNSAT
Problem TDEAD2898 is UNSAT
Problem TDEAD2982 is UNSAT
Problem TDEAD3064 is UNSAT
Problem TDEAD3144 is UNSAT
Problem TDEAD3222 is UNSAT
Problem TDEAD3298 is UNSAT
Problem TDEAD3372 is UNSAT
Problem TDEAD3444 is UNSAT
Problem TDEAD3514 is UNSAT
Problem TDEAD3582 is UNSAT
Problem TDEAD3648 is UNSAT
Problem TDEAD3712 is UNSAT
Problem TDEAD3774 is UNSAT
Problem TDEAD3892 is UNSAT
Problem TDEAD3948 is UNSAT
Problem TDEAD4002 is UNSAT
Problem TDEAD4054 is UNSAT
Problem TDEAD4104 is UNSAT
Problem TDEAD4198 is UNSAT
Problem TDEAD4242 is UNSAT
Problem TDEAD4284 is UNSAT
Problem TDEAD4324 is UNSAT
Problem TDEAD4362 is UNSAT
Problem TDEAD4398 is UNSAT
Problem TDEAD4432 is UNSAT
Problem TDEAD4464 is UNSAT
Problem TDEAD4494 is UNSAT
Problem TDEAD4522 is UNSAT
Problem TDEAD4548 is UNSAT
Problem TDEAD4572 is UNSAT
Problem TDEAD4594 is UNSAT
Problem TDEAD4614 is UNSAT
Problem TDEAD4632 is UNSAT
Problem TDEAD4648 is UNSAT
Problem TDEAD4662 is UNSAT
Problem TDEAD4674 is UNSAT
Problem TDEAD4684 is UNSAT
Problem TDEAD4692 is UNSAT
Problem TDEAD4702 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2446 variables, 91/91 constraints. Problems are: Problem set: 90 solved, 4612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2446/7154 variables, and 91 constraints, problems are : Problem set: 90 solved, 4612 unsolved in 30157 ms.
Refiners :[Positive P Invariants (semi-flows): 91/97 constraints, State Equation: 0/2449 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 4657/2353 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 90 solved, 4612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2401 variables, 4/4 constraints. Problems are: Problem set: 90 solved, 4612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2401/7154 variables, and 4 constraints, problems are : Problem set: 90 solved, 4612 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 4/97 constraints, State Equation: 0/2449 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 2304/2353 constraints, Known Traps: 0/0 constraints]
After SMT, in 100076ms problems are : Problem set: 90 solved, 4612 unsolved
Search for dead transitions found 90 dead transitions in 100160ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in LTL mode, iteration 1 : 2449/2449 places, 4615/4705 transitions.
Deduced a syphon composed of 45 places in 4 ms
Applied a total of 0 rules in 22 ms. Remains 2449 /2449 variables (removed 0) and now considering 4615/4615 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103670 ms. Remains : 2449/2449 places, 4615/4705 transitions.
Deduced a syphon composed of 45 places in 7 ms
Reduce places removed 45 places and 0 transitions.
Support contains 2404 out of 2404 places after structural reductions.
[2024-06-07 13:36:15] [INFO ] Flatten gal took : 600 ms
[2024-06-07 13:36:18] [INFO ] Flatten gal took : 538 ms
[2024-06-07 13:36:22] [INFO ] Input system was already deterministic with 4615 transitions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (8 resets) in 13633 ms. (2 steps per ms) remains 10/30 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2353 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 13278 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2048 ms. (19 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2116 ms. (18 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 12787 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 17557 ms. (2 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1629 ms. (24 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1425 ms. (28 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1430 ms. (27 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1790 ms. (22 steps per ms) remains 10/10 properties
// Phase 1: matrix 4615 rows 2404 cols
[2024-06-07 13:36:41] [INFO ] Computed 97 invariants in 49 ms
[2024-06-07 13:36:41] [INFO ] State equation strengthened by 7 read => feed constraints.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2404 variables, 97/97 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2404 variables, 0/97 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 4614/7018 variables, 2404/2501 constraints. Problems are: Problem set: 5 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/7018 variables, 6/2507 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7018 variables, 0/2507 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/7019 variables, 1/2508 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7019/7019 variables, and 2508 constraints, problems are : Problem set: 5 solved, 5 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 2404/2404 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2404 variables, 97/97 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-07 13:37:00] [INFO ] Deduced a trap composed of 141 places in 2166 ms of which 115 ms to minimize.
[2024-06-07 13:37:02] [INFO ] Deduced a trap composed of 504 places in 2008 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2404/7019 variables, and 99 constraints, problems are : Problem set: 5 solved, 5 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 0/2404 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 20912ms problems are : Problem set: 5 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2404 out of 2404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 4615/4615 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2404 transition count 4614
Applied a total of 1 rules in 643 ms. Remains 2404 /2404 variables (removed 0) and now considering 4614/4615 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 644 ms. Remains : 2404/2404 places, 4614/4615 transitions.
RANDOM walk for 40000 steps (8 resets) in 7873 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1264 ms. (31 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1372 ms. (29 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 8294 ms. (4 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9857 ms. (4 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 722 ms. (55 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 273114 steps, run timeout after 24007 ms. (steps per millisecond=11 ) properties seen :0 out of 5
Probabilistic random walk after 273114 steps, saw 225967 distinct states, run finished after 24017 ms. (steps per millisecond=11 ) properties seen :0
// Phase 1: matrix 4614 rows 2404 cols
[2024-06-07 13:37:35] [INFO ] Computed 97 invariants in 23 ms
[2024-06-07 13:37:35] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2404 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2404 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 4614/7018 variables, 2404/2501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/7018 variables, 6/2507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7018 variables, 0/2507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/7018 variables, 0/2507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7018/7018 variables, and 2507 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6361 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 2404/2404 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2404 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-07 13:37:52] [INFO ] Deduced a trap composed of 141 places in 2140 ms of which 17 ms to minimize.
[2024-06-07 13:37:54] [INFO ] Deduced a trap composed of 504 places in 2040 ms of which 15 ms to minimize.
[2024-06-07 13:37:57] [INFO ] Deduced a trap composed of 544 places in 2104 ms of which 13 ms to minimize.
[2024-06-07 13:37:59] [INFO ] Deduced a trap composed of 525 places in 1949 ms of which 13 ms to minimize.
[2024-06-07 13:38:02] [INFO ] Deduced a trap composed of 49 places in 2523 ms of which 16 ms to minimize.
[2024-06-07 13:38:04] [INFO ] Deduced a trap composed of 96 places in 2263 ms of which 14 ms to minimize.
[2024-06-07 13:38:07] [INFO ] Deduced a trap composed of 96 places in 2491 ms of which 17 ms to minimize.
[2024-06-07 13:38:09] [INFO ] Deduced a trap composed of 141 places in 2489 ms of which 15 ms to minimize.
[2024-06-07 13:38:12] [INFO ] Deduced a trap composed of 141 places in 2494 ms of which 16 ms to minimize.
[2024-06-07 13:38:14] [INFO ] Deduced a trap composed of 141 places in 2421 ms of which 16 ms to minimize.
[2024-06-07 13:38:17] [INFO ] Deduced a trap composed of 225 places in 2435 ms of which 15 ms to minimize.
[2024-06-07 13:38:19] [INFO ] Deduced a trap composed of 141 places in 2394 ms of which 16 ms to minimize.
[2024-06-07 13:38:22] [INFO ] Deduced a trap composed of 141 places in 2426 ms of which 16 ms to minimize.
[2024-06-07 13:38:24] [INFO ] Deduced a trap composed of 561 places in 2385 ms of which 16 ms to minimize.
[2024-06-07 13:38:27] [INFO ] Deduced a trap composed of 589 places in 2415 ms of which 15 ms to minimize.
[2024-06-07 13:38:29] [INFO ] Deduced a trap composed of 141 places in 2345 ms of which 21 ms to minimize.
[2024-06-07 13:38:32] [INFO ] Deduced a trap composed of 141 places in 2441 ms of which 16 ms to minimize.
[2024-06-07 13:38:34] [INFO ] Deduced a trap composed of 141 places in 2445 ms of which 16 ms to minimize.
[2024-06-07 13:38:37] [INFO ] Deduced a trap composed of 621 places in 2345 ms of which 15 ms to minimize.
SMT process timed out in 61401ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2404 out of 2404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 4614/4614 transitions.
Applied a total of 0 rules in 390 ms. Remains 2404 /2404 variables (removed 0) and now considering 4614/4614 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 2404/2404 places, 4614/4614 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 4614/4614 transitions.
Applied a total of 0 rules in 589 ms. Remains 2404 /2404 variables (removed 0) and now considering 4614/4614 (removed 0) transitions.
[2024-06-07 13:38:38] [INFO ] Invariant cache hit.
[2024-06-07 13:38:38] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-06-07 13:38:38] [INFO ] Invariant cache hit.
[2024-06-07 13:38:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-07 13:38:40] [INFO ] Implicit Places using invariants and state equation in 2231 ms returned []
Implicit Place search using SMT with State Equation took 2520 ms to find 0 implicit places.
[2024-06-07 13:38:40] [INFO ] Redundant transitions in 321 ms returned []
Running 4611 sub problems to find dead transitions.
[2024-06-07 13:38:41] [INFO ] Invariant cache hit.
[2024-06-07 13:38:41] [INFO ] State equation strengthened by 6 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2401 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 4611 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2401/7018 variables, and 91 constraints, problems are : Problem set: 0 solved, 4611 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 91/97 constraints, State Equation: 0/2404 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 4611/2307 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4611 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2401 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 4611 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2401/7018 variables, and 91 constraints, problems are : Problem set: 0 solved, 4611 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 91/97 constraints, State Equation: 0/2404 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 2304/2307 constraints, Known Traps: 0/0 constraints]
After SMT, in 98614ms problems are : Problem set: 0 solved, 4611 unsolved
Search for dead transitions found 0 dead transitions in 98657ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102106 ms. Remains : 2404/2404 places, 4614/4614 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA BlocksWorld-PT-09-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 13:40:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-07 13:40:20] [INFO ] Flatten gal took : 320 ms
FORMULA BlocksWorld-PT-09-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 13:40:23] [INFO ] Flatten gal took : 446 ms
[2024-06-07 13:40:26] [INFO ] Input system was already deterministic with 4615 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 2404/2404 places, 4615/4615 transitions.
Applied a total of 0 rules in 1173 ms. Remains 2404 /2404 variables (removed 0) and now considering 4615/4615 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1174 ms. Remains : 2404/2404 places, 4615/4615 transitions.
[2024-06-07 13:40:27] [INFO ] Flatten gal took : 146 ms
[2024-06-07 13:40:27] [INFO ] Flatten gal took : 170 ms
[2024-06-07 13:40:28] [INFO ] Input system was already deterministic with 4615 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2404/2404 places, 4615/4615 transitions.
Applied a total of 0 rules in 10 ms. Remains 2404 /2404 variables (removed 0) and now considering 4615/4615 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 2404/2404 places, 4615/4615 transitions.
[2024-06-07 13:40:28] [INFO ] Flatten gal took : 202 ms
[2024-06-07 13:40:28] [INFO ] Flatten gal took : 285 ms
[2024-06-07 13:40:29] [INFO ] Input system was already deterministic with 4615 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2404/2404 places, 4615/4615 transitions.
Applied a total of 0 rules in 126 ms. Remains 2404 /2404 variables (removed 0) and now considering 4615/4615 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 2404/2404 places, 4615/4615 transitions.
[2024-06-07 13:40:29] [INFO ] Flatten gal took : 152 ms
[2024-06-07 13:40:29] [INFO ] Flatten gal took : 179 ms
[2024-06-07 13:40:30] [INFO ] Input system was already deterministic with 4615 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2404/2404 places, 4615/4615 transitions.
Applied a total of 0 rules in 630 ms. Remains 2404 /2404 variables (removed 0) and now considering 4615/4615 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 630 ms. Remains : 2404/2404 places, 4615/4615 transitions.
[2024-06-07 13:40:31] [INFO ] Flatten gal took : 133 ms
[2024-06-07 13:40:31] [INFO ] Flatten gal took : 150 ms
[2024-06-07 13:40:31] [INFO ] Input system was already deterministic with 4615 transitions.
RANDOM walk for 40000 steps (8 resets) in 2307 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 601 ms. (66 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 384822 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 384822 steps, saw 328935 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
// Phase 1: matrix 4615 rows 2404 cols
[2024-06-07 13:40:35] [INFO ] Computed 97 invariants in 34 ms
[2024-06-07 13:40:35] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2266/2404 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2404 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4614/7018 variables, 2404/2501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7018 variables, 6/2507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7018 variables, 0/2507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/7019 variables, 1/2508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7019 variables, 0/2508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/7019 variables, 0/2508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7019/7019 variables, and 2508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1891 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 2404/2404 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2266/2404 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 13:40:40] [INFO ] Deduced a trap composed of 141 places in 2458 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2404 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 13:40:41] [INFO ] Deduced a trap composed of 616 places in 1244 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2404 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2404 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7018/7019 variables, and 2503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 2404/2404 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints]
After SMT, in 7020ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 138 out of 2404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 4615/4615 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2404 transition count 4614
Applied a total of 1 rules in 12304 ms. Remains 2404 /2404 variables (removed 0) and now considering 4614/4615 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12304 ms. Remains : 2404/2404 places, 4614/4615 transitions.
RANDOM walk for 1981555 steps (4 resets) in 120004 ms. (16 steps per ms) remains 1/1 properties
BEST_FIRST walk for 1297523 steps (1 resets) in 20006 ms. (64 steps per ms) remains 1/1 properties
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BlocksWorld-PT-09

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 2449
TRANSITIONS: 4705
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 23506
NUPN UNITS: 98
LOADING TIME: 5.443

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.192
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 6.293
OK.
----------------------------------------------------------------------
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: 712
MODEL NAME: /home/mcc/execution/model
2449 places, 4705 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -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-09"
export BK_EXAMINATION="CTLFireability"
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-09, examination is CTLFireability"
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-171774424000226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-09.tgz
mv BlocksWorld-PT-09 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;