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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 190K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 859K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 174K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 959K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 18K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 153K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 637K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 502K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.6M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 25K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 62K 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 783K 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-05-ReachabilityFireability-2024-00
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-01
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-02
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-03
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-04
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-05
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-06
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-07
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-08
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-09
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-10
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-11
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-12
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-13
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-14
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717756354989

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 10:32:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 10:32:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 10:32:36] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-06-07 10:32:36] [INFO ] Transformed 869 places.
[2024-06-07 10:32:36] [INFO ] Transformed 1625 transitions.
[2024-06-07 10:32:36] [INFO ] Found NUPN structural information;
[2024-06-07 10:32:36] [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]
[2024-06-07 10:32:36] [INFO ] Parsed PT model containing 869 places and 1625 transitions and 8110 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 175 ms.
Working with output stream class java.io.PrintStream
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 10133 ms. (3 steps per ms) remains 11/15 properties
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 3924 ms. (10 steps per ms) remains 11/11 properties
BEST_FIRST walk for 39181 steps (8 resets) in 20001 ms. (1 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4934 ms. (8 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7053 ms. (5 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4190 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1079 ms. (37 steps per ms) remains 11/11 properties
BEST_FIRST walk for 39962 steps (8 resets) in 19857 ms. (2 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 951 ms. (42 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1004 ms. (39 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 953 ms. (41 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 871 ms. (45 steps per ms) remains 11/11 properties
// Phase 1: matrix 1625 rows 869 cols
[2024-06-07 10:32:56] [INFO ] Computed 57 invariants in 48 ms
[2024-06-07 10:32:56] [INFO ] State equation strengthened by 45 read => feed constraints.
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-07 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-01 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-04 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-05 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-06 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-09 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-12 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-13 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-14 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 57/57 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/2494 variables, 1/971 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2494 variables, 0/971 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2494 variables, 0/971 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2494/2494 variables, and 971 constraints, problems are : Problem set: 9 solved, 2 unsolved in 2549 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 57/57 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-06-07 10:33:23] [INFO ] Deduced a trap composed of 81 places in 592 ms of which 64 ms to minimize.
[2024-06-07 10:33:23] [INFO ] Deduced a trap composed of 81 places in 680 ms of which 32 ms to minimize.
[2024-06-07 10:33:24] [INFO ] Deduced a trap composed of 81 places in 732 ms of which 7 ms to minimize.
[2024-06-07 10:33:25] [INFO ] Deduced a trap composed of 81 places in 601 ms of which 6 ms to minimize.
[2024-06-07 10:33:25] [INFO ] Deduced a trap composed of 81 places in 531 ms of which 5 ms to minimize.
[2024-06-07 10:33:26] [INFO ] Deduced a trap composed of 56 places in 498 ms of which 6 ms to minimize.
[2024-06-07 10:33:27] [INFO ] Deduced a trap composed of 81 places in 483 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/2494 variables, and 64 constraints, problems are : Problem set: 9 solved, 2 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 30943ms problems are : Problem set: 9 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 869 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1625/1625 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 869 transition count 1624
Applied a total of 1 rules in 205 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1625 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 869/869 places, 1624/1625 transitions.
RANDOM walk for 40000 steps (8 resets) in 5090 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 39877 steps (8 resets) in 19878 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 3544 ms. (11 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 293757 steps, run timeout after 21001 ms. (steps per millisecond=13 ) properties seen :0 out of 2
Probabilistic random walk after 293757 steps, saw 250980 distinct states, run finished after 21007 ms. (steps per millisecond=13 ) properties seen :0
// Phase 1: matrix 1624 rows 869 cols
[2024-06-07 10:33:55] [INFO ] Computed 57 invariants in 9 ms
[2024-06-07 10:33:55] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2493/2493 variables, and 970 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1639 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:34:06] [INFO ] Deduced a trap composed of 81 places in 534 ms of which 6 ms to minimize.
[2024-06-07 10:34:07] [INFO ] Deduced a trap composed of 81 places in 513 ms of which 6 ms to minimize.
[2024-06-07 10:34:07] [INFO ] Deduced a trap composed of 81 places in 512 ms of which 6 ms to minimize.
[2024-06-07 10:34:08] [INFO ] Deduced a trap composed of 81 places in 495 ms of which 6 ms to minimize.
[2024-06-07 10:34:08] [INFO ] Deduced a trap composed of 81 places in 472 ms of which 6 ms to minimize.
[2024-06-07 10:34:09] [INFO ] Deduced a trap composed of 56 places in 480 ms of which 5 ms to minimize.
[2024-06-07 10:34:10] [INFO ] Deduced a trap composed of 81 places in 526 ms of which 5 ms to minimize.
[2024-06-07 10:34:10] [INFO ] Deduced a trap composed of 216 places in 482 ms of which 5 ms to minimize.
[2024-06-07 10:34:11] [INFO ] Deduced a trap composed of 81 places in 485 ms of which 5 ms to minimize.
[2024-06-07 10:34:11] [INFO ] Deduced a trap composed of 81 places in 490 ms of which 6 ms to minimize.
[2024-06-07 10:34:12] [INFO ] Deduced a trap composed of 56 places in 636 ms of which 6 ms to minimize.
[2024-06-07 10:34:12] [INFO ] Deduced a trap composed of 225 places in 497 ms of which 6 ms to minimize.
[2024-06-07 10:34:13] [INFO ] Deduced a trap composed of 144 places in 524 ms of which 6 ms to minimize.
[2024-06-07 10:34:14] [INFO ] Deduced a trap composed of 81 places in 503 ms of which 5 ms to minimize.
[2024-06-07 10:34:14] [INFO ] Deduced a trap composed of 81 places in 519 ms of which 5 ms to minimize.
[2024-06-07 10:34:15] [INFO ] Deduced a trap composed of 200 places in 528 ms of which 6 ms to minimize.
[2024-06-07 10:34:15] [INFO ] Deduced a trap composed of 29 places in 510 ms of which 5 ms to minimize.
[2024-06-07 10:34:16] [INFO ] Deduced a trap composed of 200 places in 517 ms of which 6 ms to minimize.
[2024-06-07 10:34:17] [INFO ] Deduced a trap composed of 81 places in 500 ms of which 6 ms to minimize.
[2024-06-07 10:34:17] [INFO ] Deduced a trap composed of 125 places in 523 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/869 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:34:18] [INFO ] Deduced a trap composed of 56 places in 512 ms of which 5 ms to minimize.
[2024-06-07 10:34:19] [INFO ] Deduced a trap composed of 189 places in 497 ms of which 5 ms to minimize.
[2024-06-07 10:34:19] [INFO ] Deduced a trap composed of 104 places in 489 ms of which 6 ms to minimize.
[2024-06-07 10:34:20] [INFO ] Deduced a trap composed of 81 places in 496 ms of which 5 ms to minimize.
[2024-06-07 10:34:20] [INFO ] Deduced a trap composed of 81 places in 496 ms of which 6 ms to minimize.
[2024-06-07 10:34:21] [INFO ] Deduced a trap composed of 81 places in 506 ms of which 5 ms to minimize.
[2024-06-07 10:34:21] [INFO ] Deduced a trap composed of 81 places in 513 ms of which 6 ms to minimize.
[2024-06-07 10:34:22] [INFO ] Deduced a trap composed of 125 places in 478 ms of which 8 ms to minimize.
[2024-06-07 10:34:23] [INFO ] Deduced a trap composed of 161 places in 539 ms of which 6 ms to minimize.
[2024-06-07 10:34:23] [INFO ] Deduced a trap composed of 161 places in 472 ms of which 6 ms to minimize.
[2024-06-07 10:34:24] [INFO ] Deduced a trap composed of 81 places in 485 ms of which 6 ms to minimize.
[2024-06-07 10:34:24] [INFO ] Deduced a trap composed of 81 places in 487 ms of which 5 ms to minimize.
[2024-06-07 10:34:25] [INFO ] Deduced a trap composed of 29 places in 479 ms of which 8 ms to minimize.
[2024-06-07 10:34:25] [INFO ] Deduced a trap composed of 29 places in 562 ms of which 9 ms to minimize.
[2024-06-07 10:34:26] [INFO ] Deduced a trap composed of 81 places in 493 ms of which 6 ms to minimize.
[2024-06-07 10:34:27] [INFO ] Deduced a trap composed of 81 places in 479 ms of which 6 ms to minimize.
[2024-06-07 10:34:27] [INFO ] Deduced a trap composed of 176 places in 477 ms of which 6 ms to minimize.
[2024-06-07 10:34:28] [INFO ] Deduced a trap composed of 104 places in 515 ms of which 6 ms to minimize.
[2024-06-07 10:34:28] [INFO ] Deduced a trap composed of 81 places in 554 ms of which 5 ms to minimize.
[2024-06-07 10:34:29] [INFO ] Deduced a trap composed of 200 places in 488 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/869 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:34:30] [INFO ] Deduced a trap composed of 29 places in 516 ms of which 6 ms to minimize.
[2024-06-07 10:34:30] [INFO ] Deduced a trap composed of 176 places in 512 ms of which 6 ms to minimize.
[2024-06-07 10:34:31] [INFO ] Deduced a trap composed of 125 places in 521 ms of which 6 ms to minimize.
[2024-06-07 10:34:32] [INFO ] Deduced a trap composed of 161 places in 486 ms of which 6 ms to minimize.
[2024-06-07 10:34:32] [INFO ] Deduced a trap composed of 81 places in 478 ms of which 6 ms to minimize.
[2024-06-07 10:34:33] [INFO ] Deduced a trap composed of 81 places in 498 ms of which 8 ms to minimize.
[2024-06-07 10:34:33] [INFO ] Deduced a trap composed of 81 places in 507 ms of which 6 ms to minimize.
[2024-06-07 10:34:34] [INFO ] Deduced a trap composed of 56 places in 524 ms of which 6 ms to minimize.
[2024-06-07 10:34:34] [INFO ] Deduced a trap composed of 81 places in 514 ms of which 6 ms to minimize.
[2024-06-07 10:34:35] [INFO ] Deduced a trap composed of 81 places in 540 ms of which 6 ms to minimize.
[2024-06-07 10:34:36] [INFO ] Deduced a trap composed of 56 places in 537 ms of which 6 ms to minimize.
[2024-06-07 10:34:36] [INFO ] Deduced a trap composed of 161 places in 531 ms of which 6 ms to minimize.
[2024-06-07 10:34:37] [INFO ] Deduced a trap composed of 221 places in 501 ms of which 5 ms to minimize.
[2024-06-07 10:34:38] [INFO ] Deduced a trap composed of 29 places in 523 ms of which 6 ms to minimize.
[2024-06-07 10:34:38] [INFO ] Deduced a trap composed of 81 places in 524 ms of which 6 ms to minimize.
[2024-06-07 10:34:39] [INFO ] Deduced a trap composed of 29 places in 521 ms of which 6 ms to minimize.
[2024-06-07 10:34:39] [INFO ] Deduced a trap composed of 81 places in 507 ms of which 7 ms to minimize.
[2024-06-07 10:34:40] [INFO ] Deduced a trap composed of 81 places in 530 ms of which 6 ms to minimize.
[2024-06-07 10:34:41] [INFO ] Deduced a trap composed of 29 places in 520 ms of which 6 ms to minimize.
[2024-06-07 10:34:41] [INFO ] Deduced a trap composed of 29 places in 506 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/869 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:34:42] [INFO ] Deduced a trap composed of 104 places in 520 ms of which 5 ms to minimize.
[2024-06-07 10:34:42] [INFO ] Deduced a trap composed of 81 places in 503 ms of which 5 ms to minimize.
[2024-06-07 10:34:43] [INFO ] Deduced a trap composed of 209 places in 482 ms of which 5 ms to minimize.
[2024-06-07 10:34:44] [INFO ] Deduced a trap composed of 81 places in 535 ms of which 5 ms to minimize.
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-02 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-07 10:34:44] [INFO ] Deduced a trap composed of 209 places in 377 ms of which 5 ms to minimize.
[2024-06-07 10:34:45] [INFO ] Deduced a trap composed of 216 places in 389 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 6/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/869 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1624/2493 variables, 869/992 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2493 variables, 44/1036 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2493 variables, 0/1036 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2493 variables, 0/1036 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2493/2493 variables, and 1036 constraints, problems are : Problem set: 1 solved, 1 unsolved in 40476 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 66/66 constraints]
After SMT, in 50539ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 108 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1624/1624 transitions.
Applied a total of 0 rules in 1331 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1331 ms. Remains : 869/869 places, 1624/1624 transitions.
RANDOM walk for 40000 steps (8 resets) in 1096 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3175 ms. (12 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 512085 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 512085 steps, saw 435844 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-06-07 10:34:51] [INFO ] Invariant cache hit.
[2024-06-07 10:34:51] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 761/869 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2493/2493 variables, and 970 constraints, problems are : Problem set: 0 solved, 1 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 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/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 761/869 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 10:34:54] [INFO ] Deduced a trap composed of 56 places in 522 ms of which 5 ms to minimize.
[2024-06-07 10:34:54] [INFO ] Deduced a trap composed of 161 places in 520 ms of which 6 ms to minimize.
[2024-06-07 10:34:55] [INFO ] Deduced a trap composed of 56 places in 513 ms of which 6 ms to minimize.
[2024-06-07 10:34:55] [INFO ] Deduced a trap composed of 225 places in 558 ms of which 4 ms to minimize.
[2024-06-07 10:34:56] [INFO ] Deduced a trap composed of 189 places in 417 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/869 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1624/2493 variables, 869/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2493 variables, 44/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2493 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2493 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2493/2493 variables, and 975 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3582 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints]
After SMT, in 5419ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 108 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1624/1624 transitions.
Applied a total of 0 rules in 1418 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1420 ms. Remains : 869/869 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1624/1624 transitions.
Applied a total of 0 rules in 1216 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-06-07 10:34:59] [INFO ] Invariant cache hit.
[2024-06-07 10:35:00] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-07 10:35:00] [INFO ] Invariant cache hit.
[2024-06-07 10:35:00] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-07 10:35:01] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1797 ms to find 0 implicit places.
[2024-06-07 10:35:01] [INFO ] Redundant transitions in 131 ms returned []
Running 1618 sub problems to find dead transitions.
[2024-06-07 10:35:01] [INFO ] Invariant cache hit.
[2024-06-07 10:35:01] [INFO ] State equation strengthened by 44 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1622 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/863 variables, 46/46 constraints. Problems are: Problem set: 46 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/2493 variables, and 46 constraints, problems are : Problem set: 46 solved, 1572 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/44 constraints, PredecessorRefiner: 1595/812 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 6/6 constraints. Problems are: Problem set: 46 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 0/6 constraints. Problems are: Problem set: 46 solved, 1572 unsolved
Problem TDEAD172 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1604 is UNSAT
At refinement iteration 2 (OVERLAPS) 29/869 variables, 51/57 constraints. Problems are: Problem set: 56 solved, 1562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/2493 variables, and 57 constraints, problems are : Problem set: 56 solved, 1562 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/44 constraints, PredecessorRefiner: 783/812 constraints, Known Traps: 0/0 constraints]
After SMT, in 73413ms problems are : Problem set: 56 solved, 1562 unsolved
Search for dead transitions found 56 dead transitions in 73432ms
Found 56 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 56 transitions
Dead transitions reduction (with SMT) removed 56 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 869/869 places, 1568/1624 transitions.
Graph (complete) has 4004 edges and 869 vertex of which 841 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Discarding 28 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1119 ms. Remains 841 /869 variables (removed 28) and now considering 1568/1568 (removed 0) transitions.
// Phase 1: matrix 1568 rows 841 cols
[2024-06-07 10:36:16] [INFO ] Computed 57 invariants in 13 ms
[2024-06-07 10:36:16] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-06-07 10:36:16] [INFO ] Invariant cache hit.
[2024-06-07 10:36:17] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 841/869 places, 1568/1624 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 79092 ms. Remains : 841/869 places, 1568/1624 transitions.
RANDOM walk for 40000 steps (8 resets) in 911 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3449 ms. (11 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 514504 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 1
Probabilistic random walk after 514504 steps, saw 440481 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
[2024-06-07 10:36:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 733/841 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2409/2409 variables, and 898 constraints, problems are : Problem set: 0 solved, 1 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 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/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 733/841 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 10:36:24] [INFO ] Deduced a trap composed of 56 places in 475 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/841 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 10:36:24] [INFO ] Deduced a trap composed of 224 places in 314 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/841 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1568/2409 variables, 841/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2409 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2409 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2409/2409 variables, and 900 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1615 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints]
After SMT, in 3339ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 108 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1332 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1332 ms. Remains : 841/841 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1117 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-07 10:36:27] [INFO ] Invariant cache hit.
[2024-06-07 10:36:28] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-06-07 10:36:28] [INFO ] Invariant cache hit.
[2024-06-07 10:36:29] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2024-06-07 10:36:29] [INFO ] Redundant transitions in 84 ms returned []
Running 1562 sub problems to find dead transitions.
[2024-06-07 10:36:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2409 variables, and 46 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 1562/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 2 (OVERLAPS) 6/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 1)
(s47 1)
(s48 0)
(s49 1)
(s50 1)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 1)
(s68 1)
(s69 0)
(s70 1)
(s71 1)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 1)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 841/2409 variables, and 57 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 778/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 71785ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 71799ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74393 ms. Remains : 841/841 places, 1568/1568 transitions.
[2024-06-07 10:37:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 12 ms.
[2024-06-07 10:37:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 841 places, 1568 transitions and 7784 arcs took 14 ms.
[2024-06-07 10:37:41] [INFO ] Flatten gal took : 188 ms
Total runtime 305398 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BlocksWorld-PT-05

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 857
MODEL NAME: /home/mcc/execution/406/model
841 places, 1568 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 ReachabilityFireability -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-05"
export BK_EXAMINATION="ReachabilityFireability"
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-05, examination is ReachabilityFireability"
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-171774423900199"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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