About the Execution of GreatSPN+red for BlocksWorld-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11954.632 | 3600000.00 | 13457378.00 | 762.50 | ????F????F?????? | normal |
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-171774423900202.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r601-tall-171774423900202
=====================================================================
--------------------
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-CTLFireability-2024-00
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-01
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-02
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-03
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-04
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-05
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-06
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-07
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-08
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-09
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-10
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-11
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-12
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-13
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-14
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717756843026
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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 10:40:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 10:40:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 10:40:44] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2024-06-07 10:40:44] [INFO ] Transformed 1189 places.
[2024-06-07 10:40:44] [INFO ] Transformed 2245 transitions.
[2024-06-07 10:40:44] [INFO ] Found NUPN structural information;
[2024-06-07 10:40:44] [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:40:44] [INFO ] Parsed PT model containing 1189 places and 2245 transitions and 11210 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 162 ms.
Support contains 1189 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 2245/2245 transitions.
Applied a total of 0 rules in 48 ms. Remains 1189 /1189 variables (removed 0) and now considering 2245/2245 (removed 0) transitions.
// Phase 1: matrix 2245 rows 1189 cols
[2024-06-07 10:40:45] [INFO ] Computed 67 invariants in 52 ms
[2024-06-07 10:40:45] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-06-07 10:40:45] [INFO ] Invariant cache hit.
[2024-06-07 10:40:46] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-07 10:40:47] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
Running 2241 sub problems to find dead transitions.
[2024-06-07 10:40:47] [INFO ] Invariant cache hit.
[2024-06-07 10:40:47] [INFO ] State equation strengthened by 59 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
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1185 variables, 60/60 constraints. Problems are: Problem set: 60 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1185/3434 variables, and 60 constraints, problems are : Problem set: 60 solved, 2181 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1189 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 2211/1123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 60 solved, 2181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 4/4 constraints. Problems are: Problem set: 60 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/3434 variables, and 4 constraints, problems are : Problem set: 60 solved, 2181 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/67 constraints, State Equation: 0/1189 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 1088/1123 constraints, Known Traps: 0/0 constraints]
After SMT, in 76189ms problems are : Problem set: 60 solved, 2181 unsolved
Search for dead transitions found 60 dead transitions in 76250ms
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 LTL mode, iteration 1 : 1189/1189 places, 2185/2245 transitions.
Deduced a syphon composed of 30 places in 2 ms
Applied a total of 0 rules in 13 ms. Remains 1189 /1189 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78053 ms. Remains : 1189/1189 places, 2185/2245 transitions.
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Support contains 1159 out of 1159 places after structural reductions.
[2024-06-07 10:42:04] [INFO ] Flatten gal took : 401 ms
[2024-06-07 10:42:06] [INFO ] Flatten gal took : 374 ms
[2024-06-07 10:42:09] [INFO ] Input system was already deterministic with 2185 transitions.
Reduction of identical properties reduced properties to check from 68 to 64
RANDOM walk for 40000 steps (8 resets) in 12520 ms. (3 steps per ms) remains 8/64 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2092 ms. (19 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 9833 ms. (4 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8582 ms. (4 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4928 ms. (8 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 952 ms. (41 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 963 ms. (41 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1107 ms. (36 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 811 ms. (49 steps per ms) remains 8/8 properties
// Phase 1: matrix 2185 rows 1159 cols
[2024-06-07 10:42:20] [INFO ] Computed 67 invariants in 24 ms
[2024-06-07 10:42:20] [INFO ] State equation strengthened by 7 read => feed constraints.
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp48 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1126 variables, 34/34 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1126 variables, 0/34 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 33/1159 variables, 33/67 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1159 variables, 0/67 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2184/3343 variables, 1159/1226 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3343 variables, 6/1232 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/3344 variables, 1/1233 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3344 variables, 0/1233 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3344 variables, 0/1233 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3344/3344 variables, and 1233 constraints, problems are : Problem set: 5 solved, 3 unsolved in 2432 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1159/1159 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1126 variables, 34/34 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-06-07 10:42:33] [INFO ] Deduced a trap composed of 150 places in 473 ms of which 50 ms to minimize.
[2024-06-07 10:42:34] [INFO ] Deduced a trap composed of 96 places in 423 ms of which 6 ms to minimize.
[2024-06-07 10:42:35] [INFO ] Deduced a trap composed of 196 places in 675 ms of which 8 ms to minimize.
[2024-06-07 10:42:35] [INFO ] Deduced a trap composed of 216 places in 668 ms of which 7 ms to minimize.
[2024-06-07 10:42:36] [INFO ] Deduced a trap composed of 174 places in 540 ms of which 6 ms to minimize.
[2024-06-07 10:42:37] [INFO ] Deduced a trap composed of 66 places in 555 ms of which 6 ms to minimize.
[2024-06-07 10:42:37] [INFO ] Deduced a trap composed of 196 places in 679 ms of which 7 ms to minimize.
[2024-06-07 10:42:38] [INFO ] Deduced a trap composed of 150 places in 583 ms of which 7 ms to minimize.
SMT process timed out in 17940ms, After SMT, problems are : Problem set: 5 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1126 out of 1159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1159/1159 places, 2185/2185 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 1159 transition count 2184
Applied a total of 1 rules in 358 ms. Remains 1159 /1159 variables (removed 0) and now considering 2184/2185 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 358 ms. Remains : 1159/1159 places, 2184/2185 transitions.
RANDOM walk for 40000 steps (8 resets) in 3876 ms. (10 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 815 ms. (49 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7424 ms. (5 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 451 ms. (88 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 142553 steps, run timeout after 9001 ms. (steps per millisecond=15 ) properties seen :1 out of 3
Probabilistic random walk after 142553 steps, saw 122549 distinct states, run finished after 9004 ms. (steps per millisecond=15 ) properties seen :1
// Phase 1: matrix 2184 rows 1159 cols
[2024-06-07 10:42:51] [INFO ] Computed 67 invariants in 11 ms
[2024-06-07 10:42:51] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1126 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1126 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 33/1159 variables, 33/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1159 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2184/3343 variables, 1159/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3343 variables, 6/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3343/3343 variables, and 1232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1159/1159 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1126 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:42:56] [INFO ] Deduced a trap composed of 66 places in 334 ms of which 5 ms to minimize.
[2024-06-07 10:42:57] [INFO ] Deduced a trap composed of 150 places in 542 ms of which 6 ms to minimize.
[2024-06-07 10:42:57] [INFO ] Deduced a trap composed of 66 places in 513 ms of which 6 ms to minimize.
[2024-06-07 10:42:58] [INFO ] Deduced a trap composed of 216 places in 471 ms of which 5 ms to minimize.
[2024-06-07 10:42:58] [INFO ] Deduced a trap composed of 66 places in 450 ms of which 6 ms to minimize.
[2024-06-07 10:42:59] [INFO ] Deduced a trap composed of 96 places in 596 ms of which 7 ms to minimize.
[2024-06-07 10:43:00] [INFO ] Deduced a trap composed of 234 places in 589 ms of which 11 ms to minimize.
[2024-06-07 10:43:00] [INFO ] Deduced a trap composed of 196 places in 583 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1126 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:43:01] [INFO ] Deduced a trap composed of 294 places in 848 ms of which 8 ms to minimize.
[2024-06-07 10:43:02] [INFO ] Deduced a trap composed of 250 places in 709 ms of which 6 ms to minimize.
[2024-06-07 10:43:03] [INFO ] Deduced a trap composed of 294 places in 685 ms of which 7 ms to minimize.
[2024-06-07 10:43:04] [INFO ] Deduced a trap composed of 304 places in 738 ms of which 7 ms to minimize.
[2024-06-07 10:43:05] [INFO ] Deduced a trap composed of 174 places in 778 ms of which 7 ms to minimize.
[2024-06-07 10:43:06] [INFO ] Deduced a trap composed of 264 places in 846 ms of which 9 ms to minimize.
[2024-06-07 10:43:06] [INFO ] Deduced a trap composed of 304 places in 743 ms of which 7 ms to minimize.
[2024-06-07 10:43:07] [INFO ] Deduced a trap composed of 174 places in 700 ms of which 6 ms to minimize.
[2024-06-07 10:43:08] [INFO ] Deduced a trap composed of 96 places in 748 ms of which 7 ms to minimize.
[2024-06-07 10:43:09] [INFO ] Deduced a trap composed of 286 places in 770 ms of which 7 ms to minimize.
[2024-06-07 10:43:09] [INFO ] Deduced a trap composed of 124 places in 671 ms of which 7 ms to minimize.
[2024-06-07 10:43:10] [INFO ] Deduced a trap composed of 294 places in 823 ms of which 7 ms to minimize.
[2024-06-07 10:43:11] [INFO ] Deduced a trap composed of 276 places in 782 ms of which 7 ms to minimize.
[2024-06-07 10:43:12] [INFO ] Deduced a trap composed of 66 places in 743 ms of which 7 ms to minimize.
[2024-06-07 10:43:13] [INFO ] Deduced a trap composed of 300 places in 772 ms of which 7 ms to minimize.
[2024-06-07 10:43:14] [INFO ] Deduced a trap composed of 150 places in 781 ms of which 7 ms to minimize.
[2024-06-07 10:43:15] [INFO ] Deduced a trap composed of 234 places in 790 ms of which 8 ms to minimize.
[2024-06-07 10:43:15] [INFO ] Deduced a trap composed of 150 places in 819 ms of which 8 ms to minimize.
[2024-06-07 10:43:16] [INFO ] Deduced a trap composed of 174 places in 829 ms of which 12 ms to minimize.
[2024-06-07 10:43:17] [INFO ] Deduced a trap composed of 196 places in 739 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1126 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:43:18] [INFO ] Deduced a trap composed of 264 places in 854 ms of which 7 ms to minimize.
[2024-06-07 10:43:19] [INFO ] Deduced a trap composed of 124 places in 749 ms of which 8 ms to minimize.
[2024-06-07 10:43:20] [INFO ] Deduced a trap composed of 150 places in 799 ms of which 7 ms to minimize.
[2024-06-07 10:43:21] [INFO ] Deduced a trap composed of 304 places in 807 ms of which 9 ms to minimize.
[2024-06-07 10:43:21] [INFO ] Deduced a trap composed of 234 places in 837 ms of which 8 ms to minimize.
[2024-06-07 10:43:22] [INFO ] Deduced a trap composed of 66 places in 770 ms of which 8 ms to minimize.
[2024-06-07 10:43:23] [INFO ] Deduced a trap composed of 96 places in 851 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1126 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:43:24] [INFO ] Deduced a trap composed of 196 places in 809 ms of which 8 ms to minimize.
[2024-06-07 10:43:25] [INFO ] Deduced a trap composed of 216 places in 757 ms of which 8 ms to minimize.
[2024-06-07 10:43:26] [INFO ] Deduced a trap composed of 174 places in 759 ms of which 7 ms to minimize.
[2024-06-07 10:43:27] [INFO ] Deduced a trap composed of 174 places in 790 ms of which 7 ms to minimize.
[2024-06-07 10:43:28] [INFO ] Deduced a trap composed of 150 places in 793 ms of which 7 ms to minimize.
[2024-06-07 10:43:29] [INFO ] Deduced a trap composed of 306 places in 812 ms of which 7 ms to minimize.
[2024-06-07 10:43:30] [INFO ] Deduced a trap composed of 250 places in 843 ms of which 12 ms to minimize.
[2024-06-07 10:43:30] [INFO ] Deduced a trap composed of 286 places in 808 ms of which 7 ms to minimize.
[2024-06-07 10:43:31] [INFO ] Deduced a trap composed of 294 places in 792 ms of which 8 ms to minimize.
[2024-06-07 10:43:32] [INFO ] Deduced a trap composed of 276 places in 775 ms of which 7 ms to minimize.
[2024-06-07 10:43:33] [INFO ] Deduced a trap composed of 196 places in 749 ms of which 7 ms to minimize.
[2024-06-07 10:43:34] [INFO ] Deduced a trap composed of 286 places in 766 ms of which 7 ms to minimize.
[2024-06-07 10:43:35] [INFO ] Deduced a trap composed of 306 places in 799 ms of which 22 ms to minimize.
[2024-06-07 10:43:35] [INFO ] Deduced a trap composed of 294 places in 772 ms of which 7 ms to minimize.
[2024-06-07 10:43:36] [INFO ] Deduced a trap composed of 300 places in 828 ms of which 7 ms to minimize.
[2024-06-07 10:43:37] [INFO ] Deduced a trap composed of 304 places in 825 ms of which 7 ms to minimize.
[2024-06-07 10:43:38] [INFO ] Deduced a trap composed of 300 places in 822 ms of which 7 ms to minimize.
[2024-06-07 10:43:39] [INFO ] Deduced a trap composed of 216 places in 777 ms of which 8 ms to minimize.
[2024-06-07 10:43:40] [INFO ] Deduced a trap composed of 276 places in 791 ms of which 7 ms to minimize.
[2024-06-07 10:43:41] [INFO ] Deduced a trap composed of 294 places in 783 ms of which 7 ms to minimize.
SMT process timed out in 50072ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1126 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 158 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 158 ms. Remains : 1159/1159 places, 2184/2184 transitions.
RANDOM walk for 40000 steps (8 resets) in 3523 ms. (11 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 541 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 8622 ms. (4 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 138922 steps, run timeout after 9001 ms. (steps per millisecond=15 ) properties seen :0 out of 2
Probabilistic random walk after 138922 steps, saw 119341 distinct states, run finished after 9001 ms. (steps per millisecond=15 ) properties seen :0
[2024-06-07 10:43:53] [INFO ] Invariant cache hit.
[2024-06-07 10:43:53] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1126 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1126 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 33/1159 variables, 33/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1159 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2184/3343 variables, 1159/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3343 variables, 6/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3343/3343 variables, and 1232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1850 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1159/1159 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1126 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:43:59] [INFO ] Deduced a trap composed of 174 places in 760 ms of which 8 ms to minimize.
[2024-06-07 10:44:00] [INFO ] Deduced a trap composed of 250 places in 777 ms of which 7 ms to minimize.
[2024-06-07 10:44:01] [INFO ] Deduced a trap composed of 66 places in 351 ms of which 4 ms to minimize.
[2024-06-07 10:44:01] [INFO ] Deduced a trap composed of 196 places in 350 ms of which 4 ms to minimize.
[2024-06-07 10:44:02] [INFO ] Deduced a trap composed of 66 places in 557 ms of which 6 ms to minimize.
[2024-06-07 10:44:02] [INFO ] Deduced a trap composed of 96 places in 552 ms of which 7 ms to minimize.
[2024-06-07 10:44:03] [INFO ] Deduced a trap composed of 196 places in 528 ms of which 6 ms to minimize.
[2024-06-07 10:44:04] [INFO ] Deduced a trap composed of 124 places in 677 ms of which 6 ms to minimize.
[2024-06-07 10:44:04] [INFO ] Deduced a trap composed of 250 places in 679 ms of which 7 ms to minimize.
[2024-06-07 10:44:05] [INFO ] Deduced a trap composed of 264 places in 659 ms of which 7 ms to minimize.
[2024-06-07 10:44:06] [INFO ] Deduced a trap composed of 276 places in 735 ms of which 7 ms to minimize.
[2024-06-07 10:44:07] [INFO ] Deduced a trap composed of 264 places in 793 ms of which 7 ms to minimize.
[2024-06-07 10:44:08] [INFO ] Deduced a trap composed of 306 places in 802 ms of which 7 ms to minimize.
[2024-06-07 10:44:08] [INFO ] Deduced a trap composed of 96 places in 721 ms of which 7 ms to minimize.
[2024-06-07 10:44:09] [INFO ] Deduced a trap composed of 234 places in 777 ms of which 8 ms to minimize.
[2024-06-07 10:44:10] [INFO ] Deduced a trap composed of 300 places in 813 ms of which 7 ms to minimize.
[2024-06-07 10:44:11] [INFO ] Deduced a trap composed of 306 places in 795 ms of which 9 ms to minimize.
[2024-06-07 10:44:12] [INFO ] Deduced a trap composed of 294 places in 763 ms of which 7 ms to minimize.
[2024-06-07 10:44:13] [INFO ] Deduced a trap composed of 124 places in 775 ms of which 7 ms to minimize.
[2024-06-07 10:44:13] [INFO ] Deduced a trap composed of 276 places in 783 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1126 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:44:14] [INFO ] Deduced a trap composed of 294 places in 779 ms of which 8 ms to minimize.
[2024-06-07 10:44:15] [INFO ] Deduced a trap composed of 216 places in 881 ms of which 7 ms to minimize.
[2024-06-07 10:44:16] [INFO ] Deduced a trap composed of 196 places in 788 ms of which 7 ms to minimize.
[2024-06-07 10:44:17] [INFO ] Deduced a trap composed of 124 places in 793 ms of which 7 ms to minimize.
[2024-06-07 10:44:18] [INFO ] Deduced a trap composed of 66 places in 777 ms of which 7 ms to minimize.
[2024-06-07 10:44:18] [INFO ] Deduced a trap composed of 250 places in 439 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1126 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1126 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 33/1159 variables, 33/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:44:19] [INFO ] Deduced a trap composed of 306 places in 486 ms of which 5 ms to minimize.
[2024-06-07 10:44:20] [INFO ] Deduced a trap composed of 96 places in 783 ms of which 7 ms to minimize.
[2024-06-07 10:44:21] [INFO ] Deduced a trap composed of 34 places in 818 ms of which 7 ms to minimize.
[2024-06-07 10:44:22] [INFO ] Deduced a trap composed of 124 places in 795 ms of which 7 ms to minimize.
[2024-06-07 10:44:23] [INFO ] Deduced a trap composed of 66 places in 813 ms of which 8 ms to minimize.
[2024-06-07 10:44:24] [INFO ] Deduced a trap composed of 66 places in 801 ms of which 7 ms to minimize.
[2024-06-07 10:44:25] [INFO ] Deduced a trap composed of 96 places in 778 ms of which 7 ms to minimize.
[2024-06-07 10:44:26] [INFO ] Deduced a trap composed of 96 places in 788 ms of which 6 ms to minimize.
[2024-06-07 10:44:26] [INFO ] Deduced a trap composed of 124 places in 821 ms of which 7 ms to minimize.
[2024-06-07 10:44:27] [INFO ] Deduced a trap composed of 250 places in 823 ms of which 8 ms to minimize.
[2024-06-07 10:44:28] [INFO ] Deduced a trap composed of 96 places in 796 ms of which 7 ms to minimize.
[2024-06-07 10:44:29] [INFO ] Deduced a trap composed of 196 places in 873 ms of which 9 ms to minimize.
[2024-06-07 10:44:30] [INFO ] Deduced a trap composed of 96 places in 822 ms of which 7 ms to minimize.
[2024-06-07 10:44:31] [INFO ] Deduced a trap composed of 66 places in 774 ms of which 7 ms to minimize.
[2024-06-07 10:44:32] [INFO ] Deduced a trap composed of 124 places in 736 ms of which 9 ms to minimize.
[2024-06-07 10:44:33] [INFO ] Deduced a trap composed of 216 places in 758 ms of which 7 ms to minimize.
[2024-06-07 10:44:33] [INFO ] Deduced a trap composed of 96 places in 758 ms of which 8 ms to minimize.
[2024-06-07 10:44:34] [INFO ] Deduced a trap composed of 96 places in 787 ms of which 8 ms to minimize.
[2024-06-07 10:44:35] [INFO ] Deduced a trap composed of 174 places in 730 ms of which 6 ms to minimize.
[2024-06-07 10:44:36] [INFO ] Deduced a trap composed of 124 places in 705 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1159 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:44:37] [INFO ] Deduced a trap composed of 66 places in 503 ms of which 5 ms to minimize.
[2024-06-07 10:44:37] [INFO ] Deduced a trap composed of 306 places in 497 ms of which 5 ms to minimize.
[2024-06-07 10:44:38] [INFO ] Deduced a trap composed of 96 places in 739 ms of which 7 ms to minimize.
[2024-06-07 10:44:39] [INFO ] Deduced a trap composed of 124 places in 814 ms of which 8 ms to minimize.
[2024-06-07 10:44:40] [INFO ] Deduced a trap composed of 34 places in 744 ms of which 8 ms to minimize.
[2024-06-07 10:44:41] [INFO ] Deduced a trap composed of 264 places in 789 ms of which 8 ms to minimize.
[2024-06-07 10:44:41] [INFO ] Deduced a trap composed of 174 places in 757 ms of which 7 ms to minimize.
[2024-06-07 10:44:42] [INFO ] Deduced a trap composed of 150 places in 766 ms of which 7 ms to minimize.
[2024-06-07 10:44:43] [INFO ] Deduced a trap composed of 96 places in 777 ms of which 7 ms to minimize.
[2024-06-07 10:44:44] [INFO ] Deduced a trap composed of 124 places in 845 ms of which 7 ms to minimize.
[2024-06-07 10:44:45] [INFO ] Deduced a trap composed of 124 places in 793 ms of which 7 ms to minimize.
[2024-06-07 10:44:46] [INFO ] Deduced a trap composed of 96 places in 760 ms of which 9 ms to minimize.
[2024-06-07 10:44:47] [INFO ] Deduced a trap composed of 96 places in 823 ms of which 7 ms to minimize.
[2024-06-07 10:44:48] [INFO ] Deduced a trap composed of 286 places in 839 ms of which 8 ms to minimize.
[2024-06-07 10:44:49] [INFO ] Deduced a trap composed of 96 places in 853 ms of which 8 ms to minimize.
[2024-06-07 10:44:50] [INFO ] Deduced a trap composed of 304 places in 858 ms of which 8 ms to minimize.
[2024-06-07 10:44:51] [INFO ] Deduced a trap composed of 96 places in 847 ms of which 7 ms to minimize.
[2024-06-07 10:44:51] [INFO ] Deduced a trap composed of 96 places in 801 ms of which 7 ms to minimize.
[2024-06-07 10:44:52] [INFO ] Deduced a trap composed of 66 places in 788 ms of which 7 ms to minimize.
[2024-06-07 10:44:53] [INFO ] Deduced a trap composed of 96 places in 794 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1159 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:44:54] [INFO ] Deduced a trap composed of 124 places in 129 ms of which 2 ms to minimize.
[2024-06-07 10:44:55] [INFO ] Deduced a trap composed of 96 places in 847 ms of which 7 ms to minimize.
[2024-06-07 10:44:55] [INFO ] Deduced a trap composed of 66 places in 801 ms of which 7 ms to minimize.
[2024-06-07 10:44:56] [INFO ] Deduced a trap composed of 96 places in 802 ms of which 8 ms to minimize.
[2024-06-07 10:44:57] [INFO ] Deduced a trap composed of 124 places in 762 ms of which 7 ms to minimize.
[2024-06-07 10:44:58] [INFO ] Deduced a trap composed of 96 places in 826 ms of which 7 ms to minimize.
[2024-06-07 10:44:59] [INFO ] Deduced a trap composed of 124 places in 786 ms of which 7 ms to minimize.
[2024-06-07 10:45:00] [INFO ] Deduced a trap composed of 174 places in 806 ms of which 7 ms to minimize.
[2024-06-07 10:45:01] [INFO ] Deduced a trap composed of 96 places in 806 ms of which 7 ms to minimize.
[2024-06-07 10:45:02] [INFO ] Deduced a trap composed of 96 places in 798 ms of which 7 ms to minimize.
[2024-06-07 10:45:03] [INFO ] Deduced a trap composed of 174 places in 773 ms of which 7 ms to minimize.
[2024-06-07 10:45:04] [INFO ] Deduced a trap composed of 96 places in 777 ms of which 7 ms to minimize.
[2024-06-07 10:45:04] [INFO ] Deduced a trap composed of 150 places in 826 ms of which 8 ms to minimize.
[2024-06-07 10:45:05] [INFO ] Deduced a trap composed of 66 places in 857 ms of which 9 ms to minimize.
[2024-06-07 10:45:06] [INFO ] Deduced a trap composed of 250 places in 872 ms of which 8 ms to minimize.
[2024-06-07 10:45:07] [INFO ] Deduced a trap composed of 96 places in 866 ms of which 8 ms to minimize.
[2024-06-07 10:45:08] [INFO ] Deduced a trap composed of 294 places in 849 ms of which 8 ms to minimize.
[2024-06-07 10:45:09] [INFO ] Deduced a trap composed of 124 places in 847 ms of which 8 ms to minimize.
[2024-06-07 10:45:10] [INFO ] Deduced a trap composed of 66 places in 854 ms of which 8 ms to minimize.
[2024-06-07 10:45:11] [INFO ] Deduced a trap composed of 286 places in 865 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1159 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:45:13] [INFO ] Deduced a trap composed of 96 places in 860 ms of which 8 ms to minimize.
[2024-06-07 10:45:13] [INFO ] Deduced a trap composed of 66 places in 852 ms of which 8 ms to minimize.
SMT process timed out in 80300ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1126 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 162 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 162 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 166 ms. Remains 1159 /1159 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-06-07 10:45:14] [INFO ] Invariant cache hit.
[2024-06-07 10:45:14] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-07 10:45:14] [INFO ] Invariant cache hit.
[2024-06-07 10:45:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-07 10:45:15] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
[2024-06-07 10:45:15] [INFO ] Redundant transitions in 133 ms returned []
Running 2180 sub problems to find dead transitions.
[2024-06-07 10:45:15] [INFO ] Invariant cache hit.
[2024-06-07 10:45:15] [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)
(s30timeout
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 30037 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 30048 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 76300ms problems are : Problem set: 0 solved, 2180 unsolved
Search for dead transitions found 0 dead transitions in 76322ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77845 ms. Remains : 1159/1159 places, 2184/2184 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BlocksWorld-PT-06-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 10:46:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-07 10:46:32] [INFO ] Flatten gal took : 209 ms
FORMULA BlocksWorld-PT-06-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 10:46:34] [INFO ] Flatten gal took : 287 ms
[2024-06-07 10:46:36] [INFO ] Input system was already deterministic with 2185 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 339 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 343 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:36] [INFO ] Flatten gal took : 93 ms
[2024-06-07 10:46:36] [INFO ] Flatten gal took : 84 ms
[2024-06-07 10:46:37] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 7 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:37] [INFO ] Flatten gal took : 80 ms
[2024-06-07 10:46:37] [INFO ] Flatten gal took : 104 ms
[2024-06-07 10:46:37] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 5 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:37] [INFO ] Flatten gal took : 114 ms
[2024-06-07 10:46:38] [INFO ] Flatten gal took : 156 ms
[2024-06-07 10:46:38] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 151 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 152 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:38] [INFO ] Flatten gal took : 64 ms
[2024-06-07 10:46:38] [INFO ] Flatten gal took : 69 ms
[2024-06-07 10:46:38] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 108 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 111 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:39] [INFO ] Flatten gal took : 107 ms
[2024-06-07 10:46:39] [INFO ] Flatten gal took : 155 ms
[2024-06-07 10:46:39] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 25 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:39] [INFO ] Flatten gal took : 62 ms
[2024-06-07 10:46:39] [INFO ] Flatten gal took : 68 ms
[2024-06-07 10:46:39] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 165 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 165 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:40] [INFO ] Flatten gal took : 67 ms
[2024-06-07 10:46:40] [INFO ] Flatten gal took : 77 ms
[2024-06-07 10:46:40] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 33 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:40] [INFO ] Flatten gal took : 68 ms
[2024-06-07 10:46:40] [INFO ] Flatten gal took : 74 ms
[2024-06-07 10:46:40] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 144 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 144 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:41] [INFO ] Flatten gal took : 68 ms
[2024-06-07 10:46:41] [INFO ] Flatten gal took : 77 ms
[2024-06-07 10:46:41] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 24 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:41] [INFO ] Flatten gal took : 64 ms
[2024-06-07 10:46:41] [INFO ] Flatten gal took : 71 ms
[2024-06-07 10:46:41] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 23 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:41] [INFO ] Flatten gal took : 60 ms
[2024-06-07 10:46:41] [INFO ] Flatten gal took : 66 ms
[2024-06-07 10:46:41] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 129 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 129 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:42] [INFO ] Flatten gal took : 61 ms
[2024-06-07 10:46:42] [INFO ] Flatten gal took : 66 ms
[2024-06-07 10:46:42] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 24 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:42] [INFO ] Flatten gal took : 60 ms
[2024-06-07 10:46:42] [INFO ] Flatten gal took : 67 ms
[2024-06-07 10:46:42] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 40 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 10:46:42] [INFO ] Flatten gal took : 60 ms
[2024-06-07 10:46:42] [INFO ] Flatten gal took : 67 ms
[2024-06-07 10:46:42] [INFO ] Input system was already deterministic with 2185 transitions.
[2024-06-07 10:46:43] [INFO ] Flatten gal took : 278 ms
[2024-06-07 10:46:45] [INFO ] Flatten gal took : 282 ms
[2024-06-07 10:46:46] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 74 ms.
[2024-06-07 10:46:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1159 places, 2185 transitions and 10910 arcs took 15 ms.
Total runtime 362706 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/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1159
TRANSITIONS: 2185
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.062s, Sys 0.000s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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: 1066
MODEL NAME: /home/mcc/execution/411/model
1159 places, 2185 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 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-06"
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-06, 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-171774423900202"
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 [ "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 '
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 ;