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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 253K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 378K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 23K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 149K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 627K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 689K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.2M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 817K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.5M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 35K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 86K 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 1.1M 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-06-ReachabilityFireability-2024-00
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-01
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-02
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-03
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-04
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-05
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-06
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-07
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-08
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-09
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-10
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-11
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-12
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-13
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-14
FORMULA_NAME BlocksWorld-PT-06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717757645179

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 10:54:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 10:54:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 10:54:06] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-06-07 10:54:06] [INFO ] Transformed 1189 places.
[2024-06-07 10:54:06] [INFO ] Transformed 2245 transitions.
[2024-06-07 10:54:06] [INFO ] Found NUPN structural information;
[2024-06-07 10:54:06] [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]
[2024-06-07 10:54:06] [INFO ] Parsed PT model containing 1189 places and 2245 transitions and 11210 arcs in 318 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 141 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 9384 ms. (4 steps per ms) remains 9/16 properties
FORMULA BlocksWorld-PT-06-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1454 ms. (27 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5780 ms. (6 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1848 ms. (21 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1326 ms. (30 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 11509 ms. (3 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1312 ms. (30 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8099 ms. (4 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8527 ms. (4 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1191 ms. (33 steps per ms) remains 9/9 properties
// Phase 1: matrix 2245 rows 1189 cols
[2024-06-07 10:54:20] [INFO ] Computed 67 invariants in 40 ms
[2024-06-07 10:54:20] [INFO ] State equation strengthened by 59 read => feed constraints.
Problem BlocksWorld-PT-06-ReachabilityFireability-2024-04 is UNSAT
FORMULA BlocksWorld-PT-06-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-06-ReachabilityFireability-2024-02 is UNSAT
FORMULA BlocksWorld-PT-06-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-06-ReachabilityFireability-2024-05 is UNSAT
FORMULA BlocksWorld-PT-06-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-06-ReachabilityFireability-2024-06 is UNSAT
FORMULA BlocksWorld-PT-06-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-06-ReachabilityFireability-2024-07 is UNSAT
FORMULA BlocksWorld-PT-06-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-06-ReachabilityFireability-2024-14 is UNSAT
FORMULA BlocksWorld-PT-06-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/1189 variables, 67/67 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1189 variables, 0/67 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2244/3433 variables, 1189/1256 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3433 variables, 58/1314 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3433 variables, 0/1314 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/3434 variables, 1/1315 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 0/1315 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3434 variables, 0/1315 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1315 constraints, problems are : Problem set: 6 solved, 3 unsolved in 3619 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1189/1189 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1189 variables, 67/67 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-06-07 10:54:40] [INFO ] Deduced a trap composed of 66 places in 1000 ms of which 77 ms to minimize.
[2024-06-07 10:54:41] [INFO ] Deduced a trap composed of 174 places in 582 ms of which 7 ms to minimize.
[2024-06-07 10:54:41] [INFO ] Deduced a trap composed of 304 places in 540 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1189 variables, 3/70 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1189 variables, 0/70 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2244/3433 variables, 1189/1259 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3433 variables, 58/1317 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3433 variables, 2/1319 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3433 variables, 0/1319 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/3434 variables, 1/1320 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3434 variables, 0/1320 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3434 variables, 0/1320 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1320 constraints, problems are : Problem set: 6 solved, 3 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1189/1189 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 23936ms problems are : Problem set: 6 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1189 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 2245/2245 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 1189 transition count 2244
Applied a total of 1 rules in 225 ms. Remains 1189 /1189 variables (removed 0) and now considering 2244/2245 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 1189/1189 places, 2244/2245 transitions.
RANDOM walk for 40000 steps (8 resets) in 3173 ms. (12 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 480 ms. (83 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4296 ms. (9 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 417 ms. (95 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 161887 steps, run timeout after 6001 ms. (steps per millisecond=26 ) properties seen :0 out of 3
Probabilistic random walk after 161887 steps, saw 139356 distinct states, run finished after 6006 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 2244 rows 1189 cols
[2024-06-07 10:54:52] [INFO ] Computed 67 invariants in 13 ms
[2024-06-07 10:54:52] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1189 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1189 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2244/3433 variables, 1189/1256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3433 variables, 58/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3433 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/3433 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3433/3433 variables, and 1314 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1914 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1189/1189 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1189 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 10:54:57] [INFO ] Deduced a trap composed of 66 places in 860 ms of which 9 ms to minimize.
[2024-06-07 10:54:58] [INFO ] Deduced a trap composed of 174 places in 583 ms of which 6 ms to minimize.
[2024-06-07 10:54:58] [INFO ] Deduced a trap composed of 304 places in 561 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1189 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1189 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2244/3433 variables, 1189/1259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3433 variables, 58/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3433 variables, 2/1319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3433 variables, 0/1319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3433 variables, 0/1319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3433/3433 variables, and 1319 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4628 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1189/1189 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 8030ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 384 ms.
Support contains 1189 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 2244/2244 transitions.
Applied a total of 0 rules in 130 ms. Remains 1189 /1189 variables (removed 0) and now considering 2244/2244 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 1189/1189 places, 2244/2244 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 2244/2244 transitions.
Applied a total of 0 rules in 166 ms. Remains 1189 /1189 variables (removed 0) and now considering 2244/2244 (removed 0) transitions.
[2024-06-07 10:55:01] [INFO ] Invariant cache hit.
[2024-06-07 10:55:01] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-07 10:55:01] [INFO ] Invariant cache hit.
[2024-06-07 10:55:02] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-07 10:55:02] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2024-06-07 10:55:02] [INFO ] Redundant transitions in 140 ms returned []
Running 2240 sub problems to find dead transitions.
[2024-06-07 10:55:02] [INFO ] Invariant cache hit.
[2024-06-07 10:55:02] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2238 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/1185 variables, 60/60 constraints. Problems are: Problem set: 60 solved, 2180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1185/3433 variables, and 60 constraints, problems are : Problem set: 60 solved, 2180 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1189 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 2210/1122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 60 solved, 2180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 4/4 constraints. Problems are: Problem set: 60 solved, 2180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/3433 variables, and 4 constraints, problems are : Problem set: 60 solved, 2180 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/67 constraints, State Equation: 0/1189 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1088/1122 constraints, Known Traps: 0/0 constraints]
After SMT, in 76918ms problems are : Problem set: 60 solved, 2180 unsolved
Search for dead transitions found 60 dead transitions in 76950ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 1189/1189 places, 2184/2244 transitions.
Deduced a syphon composed of 30 places in 4 ms
Applied a total of 0 rules in 131 ms. Remains 1189 /1189 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-06-07 10:56:20] [INFO ] Redundant transitions in 118 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78627 ms. Remains : 1189/1189 places, 2184/2244 transitions.
Deduced a syphon composed of 30 places in 8 ms
Reduce places removed 30 places and 0 transitions.
RANDOM walk for 40000 steps (8 resets) in 3658 ms. (10 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 479 ms. (83 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6755 ms. (5 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 400 ms. (99 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 234118 steps, run timeout after 9002 ms. (steps per millisecond=26 ) properties seen :0 out of 3
Probabilistic random walk after 234118 steps, saw 200485 distinct states, run finished after 9002 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 2184 rows 1159 cols
[2024-06-07 10:56:32] [INFO ] Computed 67 invariants in 22 ms
[2024-06-07 10:56:32] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1159 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1159 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2184/3343 variables, 1159/1226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3343 variables, 6/1232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3343/3343 variables, and 1232 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1657 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1159/1159 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1159 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1159 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2184/3343 variables, 1159/1226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3343 variables, 6/1232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3343 variables, 2/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3343 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 10:56:37] [INFO ] Deduced a trap composed of 174 places in 172 ms of which 2 ms to minimize.
[2024-06-07 10:56:37] [INFO ] Deduced a trap composed of 124 places in 129 ms of which 2 ms to minimize.
[2024-06-07 10:56:37] [INFO ] Deduced a trap composed of 216 places in 221 ms of which 3 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/3343 variables, 3/1237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3343 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/3343 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3343/3343 variables, and 1237 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3205 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1159/1159 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 6445ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 379 ms.
Support contains 1159 out of 1159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1159/1159 places, 2184/2184 transitions.
Applied a total of 0 rules in 124 ms. Remains 1159 /1159 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 1159/1159 places, 2184/2184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1159/1159 places, 2184/2184 transitions.
Applied a total of 0 rules in 123 ms. Remains 1159 /1159 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-06-07 10:56:39] [INFO ] Invariant cache hit.
[2024-06-07 10:56:39] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-07 10:56:39] [INFO ] Invariant cache hit.
[2024-06-07 10:56:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-07 10:56:40] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
[2024-06-07 10:56:40] [INFO ] Redundant transitions in 63 ms returned []
Running 2180 sub problems to find dead transitions.
[2024-06-07 10:56:40] [INFO ] Invariant cache hit.
[2024-06-07 10:56:40] [INFO ] State equation strengthened by 6 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1155/3343 variables, and 60 constraints, problems are : Problem set: 0 solved, 2180 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 2180/1092 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/3343 variables, and 60 constraints, problems are : Problem set: 0 solved, 2180 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1088/1092 constraints, Known Traps: 0/0 constraints]
After SMT, in 75863ms problems are : Problem set: 0 solved, 2180 unsolved
Search for dead transitions found 0 dead transitions in 75883ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77128 ms. Remains : 1159/1159 places, 2184/2184 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 120 ms. Remains 1159 /1159 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-06-07 10:57:58] [INFO ] Invariant cache hit.
[2024-06-07 10:57:58] [INFO ] [Real]Absence check using 67 positive place invariants in 28 ms returned sat
[2024-06-07 10:57:59] [INFO ] After 715ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
TRAPS : Iteration 0
[2024-06-07 10:57:59] [INFO ] After 853ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
[2024-06-07 10:57:59] [INFO ] After 1332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2024-06-07 10:57:59] [INFO ] [Nat]Absence check using 67 positive place invariants in 32 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-07 10:58:00] [INFO ] After 855ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :3
[2024-06-07 10:58:00] [INFO ] After 1241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 4232 ms.
[2024-06-07 10:58:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 17 ms.
[2024-06-07 10:58:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1159 places, 2184 transitions and 10854 arcs took 16 ms.
[2024-06-07 10:58:01] [INFO ] Flatten gal took : 369 ms
Total runtime 235135 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BlocksWorld-PT-06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1159
TRANSITIONS: 2184
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.042s, Sys 0.018s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.008s, 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: 691
MODEL NAME: /home/mcc/execution/412/model
1159 places, 2184 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//
++ 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 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-06"
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-06, 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-171774424000207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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