About the Execution of ITS-Tools for BlocksWorld-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15356.004 | 1341216.00 | 1588469.00 | 3591.00 | FFFFTTFFTTFFTFFT | 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.r602-tall-171774424700235.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 itstools
Input is BlocksWorld-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r602-tall-171774424700235
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 38M
-rw-r--r-- 1 mcc users 634K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.8M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.8M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 36K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 569K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 2.0M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 9.2M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.9M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 47K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 112K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 2.8M 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-10-LTLCardinality-00
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-01
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-02
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-03
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-04
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-05
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-06
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-07
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-08
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-09
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-10
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-11
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-12
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-13
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-14
FORMULA_NAME BlocksWorld-PT-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717763738342
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-07 12:35:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 12:35:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 12:35:39] [INFO ] Load time of PNML (sax parser for PT used): 307 ms
[2024-06-07 12:35:39] [INFO ] Transformed 2969 places.
[2024-06-07 12:35:39] [INFO ] Transformed 5725 transitions.
[2024-06-07 12:35:39] [INFO ] Found NUPN structural information;
[2024-06-07 12:35:39] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52]
[2024-06-07 12:35:40] [INFO ] Parsed PT model containing 2969 places and 5725 transitions and 28602 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA BlocksWorld-PT-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 160 out of 2969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 5725/5725 transitions.
Applied a total of 0 rules in 299 ms. Remains 2969 /2969 variables (removed 0) and now considering 5725/5725 (removed 0) transitions.
// Phase 1: matrix 5725 rows 2969 cols
[2024-06-07 12:35:40] [INFO ] Computed 107 invariants in 92 ms
[2024-06-07 12:35:42] [INFO ] Implicit Places using invariants in 2189 ms returned []
[2024-06-07 12:35:42] [INFO ] Invariant cache hit.
[2024-06-07 12:35:45] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-06-07 12:35:52] [INFO ] Implicit Places using invariants and state equation in 9544 ms returned []
Implicit Place search using SMT with State Equation took 11762 ms to find 0 implicit places.
Running 5719 sub problems to find dead transitions.
[2024-06-07 12:35:52] [INFO ] Invariant cache hit.
[2024-06-07 12:35:52] [INFO ] State equation strengthened by 95 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2266 is UNSAT
Problem TDEAD2320 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2806 is UNSAT
Problem TDEAD2860 is UNSAT
Problem TDEAD2914 is UNSAT
Problem TDEAD2968 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3174 is UNSAT
Problem TDEAD3274 is UNSAT
Problem TDEAD3372 is UNSAT
Problem TDEAD3468 is UNSAT
Problem TDEAD3562 is UNSAT
Problem TDEAD3654 is UNSAT
Problem TDEAD3744 is UNSAT
Problem TDEAD3832 is UNSAT
Problem TDEAD3918 is UNSAT
Problem TDEAD4002 is UNSAT
Problem TDEAD4164 is UNSAT
Problem TDEAD4392 is UNSAT
Problem TDEAD4534 is UNSAT
Problem TDEAD4602 is UNSAT
Problem TDEAD4668 is UNSAT
Problem TDEAD4732 is UNSAT
Problem TDEAD4794 is UNSAT
Problem TDEAD4854 is UNSAT
Problem TDEAD4912 is UNSAT
Problem TDEAD4968 is UNSAT
Problem TDEAD5022 is UNSAT
Problem TDEAD5074 is UNSAT
Problem TDEAD5124 is UNSAT
Problem TDEAD5172 is UNSAT
Problem TDEAD5218 is UNSAT
Problem TDEAD5262 is UNSAT
Problem TDEAD5304 is UNSAT
Problem TDEAD5344 is UNSAT
Problem TDEAD5382 is UNSAT
Problem TDEAD5418 is UNSAT
Problem TDEAD5452 is UNSAT
Problem TDEAD5484 is UNSAT
Problem TDEAD5514 is UNSAT
Problem TDEAD5542 is UNSAT
Problem TDEAD5568 is UNSAT
Problem TDEAD5592 is UNSAT
Problem TDEAD5614 is UNSAT
Problem TDEAD5634 is UNSAT
Problem TDEAD5652 is UNSAT
Problem TDEAD5668 is UNSAT
Problem TDEAD5682 is UNSAT
Problem TDEAD5694 is UNSAT
Problem TDEAD5704 is UNSAT
Problem TDEAD5712 is UNSAT
Problem TDEAD5718 is UNSAT
Problem TDEAD5722 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2963 variables, 97/97 constraints. Problems are: Problem set: 98 solved, 5621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2963/8694 variables, and 97 constraints, problems are : Problem set: 98 solved, 5621 unsolved in 30212 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2969 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 5670/2863 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 98 solved, 5621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 5/5 constraints. Problems are: Problem set: 98 solved, 5621 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/8694 variables, and 5 constraints, problems are : Problem set: 98 solved, 5621 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 5/107 constraints, State Equation: 0/2969 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 2807/2863 constraints, Known Traps: 0/0 constraints]
After SMT, in 109396ms problems are : Problem set: 98 solved, 5621 unsolved
Search for dead transitions found 98 dead transitions in 109556ms
Found 98 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 98 transitions
Dead transitions reduction (with SMT) removed 98 transitions
Starting structural reductions in LTL mode, iteration 1 : 2969/2969 places, 5627/5725 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 2920 transition count 5627
Applied a total of 49 rules in 177 ms. Remains 2920 /2969 variables (removed 49) and now considering 5627/5627 (removed 0) transitions.
// Phase 1: matrix 5627 rows 2920 cols
[2024-06-07 12:37:42] [INFO ] Computed 107 invariants in 54 ms
[2024-06-07 12:37:43] [INFO ] Implicit Places using invariants in 1638 ms returned []
[2024-06-07 12:37:43] [INFO ] Invariant cache hit.
[2024-06-07 12:37:46] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-07 12:37:49] [INFO ] Implicit Places using invariants and state equation in 6166 ms returned []
Implicit Place search using SMT with State Equation took 7807 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2920/2969 places, 5627/5725 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129668 ms. Remains : 2920/2969 places, 5627/5725 transitions.
Support contains 160 out of 2920 places after structural reductions.
[2024-06-07 12:37:50] [INFO ] Flatten gal took : 400 ms
[2024-06-07 12:37:50] [INFO ] Flatten gal took : 250 ms
[2024-06-07 12:37:51] [INFO ] Input system was already deterministic with 5627 transitions.
RANDOM walk for 40000 steps (8 resets) in 4160 ms. (9 steps per ms) remains 13/23 properties
BEST_FIRST walk for 40003 steps (8 resets) in 568 ms. (70 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 750 ms. (53 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 746 ms. (53 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 519 ms. (76 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 555 ms. (71 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 626 ms. (63 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 496 ms. (80 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 533 ms. (74 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 334 ms. (119 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 419 ms. (95 steps per ms) remains 12/12 properties
[2024-06-07 12:37:54] [INFO ] Invariant cache hit.
[2024-06-07 12:37:54] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 2811/2920 variables, 107/107 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2920 variables, 0/107 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5626/8546 variables, 2920/3027 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8546 variables, 8/3035 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8546 variables, 0/3035 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/8547 variables, 1/3036 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8547 variables, 0/3036 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/8547 variables, 0/3036 constraints. Problems are: Problem set: 7 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8547/8547 variables, and 3036 constraints, problems are : Problem set: 7 solved, 5 unsolved in 3594 ms.
Refiners :[Positive P Invariants (semi-flows): 107/107 constraints, State Equation: 2920/2920 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 12/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 2812/2920 variables, 107/107 constraints. Problems are: Problem set: 8 solved, 4 unsolved
[2024-06-07 12:38:02] [INFO ] Deduced a trap composed of 156 places in 3317 ms of which 143 ms to minimize.
[2024-06-07 12:38:02] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 3 ms to minimize.
[2024-06-07 12:38:05] [INFO ] Deduced a trap composed of 156 places in 3312 ms of which 32 ms to minimize.
SMT process timed out in 11449ms, After SMT, problems are : Problem set: 8 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 107 out of 2920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2920/2920 places, 5627/5627 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 2920 transition count 5626
Applied a total of 1 rules in 17912 ms. Remains 2920 /2920 variables (removed 0) and now considering 5626/5627 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17913 ms. Remains : 2920/2920 places, 5626/5627 transitions.
RANDOM walk for 40000 steps (8 resets) in 2481 ms. (16 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 585 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 517 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 481 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 473 ms. (84 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 120201 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 120201 steps, saw 102002 distinct states, run finished after 3014 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 5626 rows 2920 cols
[2024-06-07 12:38:28] [INFO ] Computed 107 invariants in 32 ms
[2024-06-07 12:38:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2813/2920 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2920 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 5626/8546 variables, 2920/3027 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8546 variables, 8/3035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8546 variables, 0/3035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/8546 variables, 0/3035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8546/8546 variables, and 3035 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3304 ms.
Refiners :[Positive P Invariants (semi-flows): 107/107 constraints, State Equation: 2920/2920 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2813/2920 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 12:38:35] [INFO ] Deduced a trap composed of 294 places in 3163 ms of which 19 ms to minimize.
[2024-06-07 12:38:38] [INFO ] Deduced a trap composed of 156 places in 3252 ms of which 24 ms to minimize.
[2024-06-07 12:38:39] [INFO ] Deduced a trap composed of 336 places in 369 ms of which 4 ms to minimize.
[2024-06-07 12:38:42] [INFO ] Deduced a trap composed of 736 places in 3241 ms of which 20 ms to minimize.
[2024-06-07 12:38:45] [INFO ] Deduced a trap composed of 156 places in 3360 ms of which 21 ms to minimize.
[2024-06-07 12:38:49] [INFO ] Deduced a trap composed of 156 places in 3163 ms of which 19 ms to minimize.
[2024-06-07 12:38:52] [INFO ] Deduced a trap composed of 156 places in 3263 ms of which 20 ms to minimize.
[2024-06-07 12:38:55] [INFO ] Deduced a trap composed of 106 places in 3229 ms of which 20 ms to minimize.
[2024-06-07 12:38:58] [INFO ] Deduced a trap composed of 450 places in 3250 ms of which 19 ms to minimize.
[2024-06-07 12:39:02] [INFO ] Deduced a trap composed of 156 places in 3305 ms of which 20 ms to minimize.
[2024-06-07 12:39:05] [INFO ] Deduced a trap composed of 624 places in 3329 ms of which 19 ms to minimize.
[2024-06-07 12:39:09] [INFO ] Deduced a trap composed of 156 places in 3354 ms of which 21 ms to minimize.
[2024-06-07 12:39:12] [INFO ] Deduced a trap composed of 414 places in 3358 ms of which 19 ms to minimize.
[2024-06-07 12:39:15] [INFO ] Deduced a trap composed of 156 places in 3216 ms of which 17 ms to minimize.
[2024-06-07 12:39:18] [INFO ] Deduced a trap composed of 450 places in 3223 ms of which 18 ms to minimize.
SMT process timed out in 50782ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 107 out of 2920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2920/2920 places, 5626/5626 transitions.
Applied a total of 0 rules in 13719 ms. Remains 2920 /2920 variables (removed 0) and now considering 5626/5626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13719 ms. Remains : 2920/2920 places, 5626/5626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2920/2920 places, 5626/5626 transitions.
Applied a total of 0 rules in 13317 ms. Remains 2920 /2920 variables (removed 0) and now considering 5626/5626 (removed 0) transitions.
[2024-06-07 12:39:46] [INFO ] Invariant cache hit.
[2024-06-07 12:39:47] [INFO ] Implicit Places using invariants in 1449 ms returned []
[2024-06-07 12:39:47] [INFO ] Invariant cache hit.
[2024-06-07 12:39:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-07 12:39:53] [INFO ] Implicit Places using invariants and state equation in 5525 ms returned []
Implicit Place search using SMT with State Equation took 6976 ms to find 0 implicit places.
[2024-06-07 12:39:53] [INFO ] Redundant transitions in 458 ms returned []
Running 5620 sub problems to find dead transitions.
[2024-06-07 12:39:53] [INFO ] Invariant cache hit.
[2024-06-07 12:39:53] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2914/8546 variables, and 97 constraints, problems are : Problem set: 0 solved, 5620 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 5620/2813 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/8546 variables, and 97 constraints, problems are : Problem set: 0 solved, 5620 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 2807/2813 constraints, Known Traps: 0/0 constraints]
After SMT, in 109660ms problems are : Problem set: 0 solved, 5620 unsolved
Search for dead transitions found 0 dead transitions in 109711ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130482 ms. Remains : 2920/2920 places, 5626/5626 transitions.
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BlocksWorld-PT-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA BlocksWorld-PT-10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 106 out of 2920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2920/2920 places, 5627/5627 transitions.
Applied a total of 0 rules in 132 ms. Remains 2920 /2920 variables (removed 0) and now considering 5627/5627 (removed 0) transitions.
// Phase 1: matrix 5627 rows 2920 cols
[2024-06-07 12:41:43] [INFO ] Computed 107 invariants in 25 ms
[2024-06-07 12:41:45] [INFO ] Implicit Places using invariants in 2255 ms returned []
[2024-06-07 12:41:45] [INFO ] Invariant cache hit.
[2024-06-07 12:41:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-07 12:41:52] [INFO ] Implicit Places using invariants and state equation in 6910 ms returned []
Implicit Place search using SMT with State Equation took 9169 ms to find 0 implicit places.
Running 5621 sub problems to find dead transitions.
[2024-06-07 12:41:52] [INFO ] Invariant cache hit.
[2024-06-07 12:41:52] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2914/8547 variables, and 97 constraints, problems are : Problem set: 0 solved, 5621 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 5621/2814 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5621 unsolved
[2024-06-07 12:43:18] [INFO ] Deduced a trap composed of 156 places in 248 ms of which 4 ms to minimize.
[2024-06-07 12:43:18] [INFO ] Deduced a trap composed of 106 places in 210 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/8547 variables, and 99 constraints, problems are : Problem set: 0 solved, 5621 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 2807/2814 constraints, Known Traps: 2/2 constraints]
After SMT, in 109532ms problems are : Problem set: 0 solved, 5621 unsolved
Search for dead transitions found 0 dead transitions in 109585ms
Finished structural reductions in LTL mode , in 1 iterations and 118908 ms. Remains : 2920/2920 places, 5627/5627 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BlocksWorld-PT-10-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA BlocksWorld-PT-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-10-LTLCardinality-01 finished in 119231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(G(p1)))))'
Support contains 54 out of 2920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2920/2920 places, 5627/5627 transitions.
Applied a total of 0 rules in 1113 ms. Remains 2920 /2920 variables (removed 0) and now considering 5627/5627 (removed 0) transitions.
[2024-06-07 12:43:43] [INFO ] Invariant cache hit.
[2024-06-07 12:43:45] [INFO ] Implicit Places using invariants in 1693 ms returned []
[2024-06-07 12:43:45] [INFO ] Invariant cache hit.
[2024-06-07 12:43:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-07 12:43:51] [INFO ] Implicit Places using invariants and state equation in 6211 ms returned []
Implicit Place search using SMT with State Equation took 7909 ms to find 0 implicit places.
[2024-06-07 12:43:52] [INFO ] Redundant transitions in 392 ms returned []
Running 5621 sub problems to find dead transitions.
[2024-06-07 12:43:52] [INFO ] Invariant cache hit.
[2024-06-07 12:43:52] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2914/8547 variables, and 97 constraints, problems are : Problem set: 0 solved, 5621 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 5621/2814 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5621 unsolved
[2024-06-07 12:45:16] [INFO ] Deduced a trap composed of 156 places in 253 ms of which 4 ms to minimize.
[2024-06-07 12:45:16] [INFO ] Deduced a trap composed of 106 places in 205 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/8547 variables, and 99 constraints, problems are : Problem set: 0 solved, 5621 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 2807/2814 constraints, Known Traps: 2/2 constraints]
After SMT, in 108277ms problems are : Problem set: 0 solved, 5621 unsolved
Search for dead transitions found 0 dead transitions in 108325ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 117771 ms. Remains : 2920/2920 places, 5627/5627 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-10-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 5356 ms.
Product exploration explored 100000 steps with 0 reset in 5289 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 2833 ms. (14 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 743 ms. (53 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 650 ms. (61 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 567 ms. (70 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 526 ms. (75 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 593 ms. (67 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 95768 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 5
Probabilistic random walk after 95768 steps, saw 80419 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
[2024-06-07 12:45:56] [INFO ] Invariant cache hit.
[2024-06-07 12:45:56] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2813/2867 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2867 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 53/2920 variables, 53/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2920 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5626/8546 variables, 2920/3027 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8546 variables, 8/3035 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8546 variables, 0/3035 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/8547 variables, 1/3036 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8547 variables, 0/3036 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/8547 variables, 0/3036 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8547/8547 variables, and 3036 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3820 ms.
Refiners :[Positive P Invariants (semi-flows): 107/107 constraints, State Equation: 2920/2920 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2813/2867 variables, 54/54 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-07 12:46:03] [INFO ] Deduced a trap composed of 204 places in 3005 ms of which 18 ms to minimize.
[2024-06-07 12:46:06] [INFO ] Deduced a trap composed of 714 places in 2971 ms of which 19 ms to minimize.
SMT process timed out in 10378ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 54 out of 2920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2920/2920 places, 5627/5627 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 2920 transition count 5626
Applied a total of 1 rules in 19038 ms. Remains 2920 /2920 variables (removed 0) and now considering 5626/5627 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19038 ms. Remains : 2920/2920 places, 5626/5627 transitions.
RANDOM walk for 40000 steps (8 resets) in 2430 ms. (16 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 506 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 515 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 477 ms. (83 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 509 ms. (78 steps per ms) remains 1/4 properties
// Phase 1: matrix 5626 rows 2920 cols
[2024-06-07 12:46:26] [INFO ] Computed 107 invariants in 28 ms
[2024-06-07 12:46:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2813/2866 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2866 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 54/2920 variables, 54/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2920 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5626/8546 variables, 2920/3027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8546 variables, 8/3035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8546 variables, 0/3035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/8546 variables, 0/3035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8546/8546 variables, and 3035 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2239 ms.
Refiners :[Positive P Invariants (semi-flows): 107/107 constraints, State Equation: 2920/2920 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2813/2866 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 12:46:32] [INFO ] Deduced a trap composed of 106 places in 3046 ms of which 18 ms to minimize.
[2024-06-07 12:46:35] [INFO ] Deduced a trap composed of 750 places in 3303 ms of which 20 ms to minimize.
[2024-06-07 12:46:39] [INFO ] Deduced a trap composed of 756 places in 3337 ms of which 20 ms to minimize.
[2024-06-07 12:46:42] [INFO ] Deduced a trap composed of 156 places in 3248 ms of which 18 ms to minimize.
[2024-06-07 12:46:45] [INFO ] Deduced a trap composed of 756 places in 3154 ms of which 19 ms to minimize.
[2024-06-07 12:46:49] [INFO ] Deduced a trap composed of 250 places in 3229 ms of which 19 ms to minimize.
[2024-06-07 12:46:52] [INFO ] Deduced a trap composed of 754 places in 3259 ms of which 19 ms to minimize.
[2024-06-07 12:46:55] [INFO ] Deduced a trap composed of 756 places in 3006 ms of which 17 ms to minimize.
[2024-06-07 12:46:58] [INFO ] Deduced a trap composed of 754 places in 3067 ms of which 16 ms to minimize.
[2024-06-07 12:47:01] [INFO ] Deduced a trap composed of 684 places in 3050 ms of which 18 ms to minimize.
[2024-06-07 12:47:04] [INFO ] Deduced a trap composed of 754 places in 3129 ms of which 18 ms to minimize.
[2024-06-07 12:47:07] [INFO ] Deduced a trap composed of 754 places in 3093 ms of which 18 ms to minimize.
[2024-06-07 12:47:10] [INFO ] Deduced a trap composed of 756 places in 3026 ms of which 17 ms to minimize.
[2024-06-07 12:47:14] [INFO ] Deduced a trap composed of 750 places in 3219 ms of which 19 ms to minimize.
SMT process timed out in 47461ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 2920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2920/2920 places, 5626/5626 transitions.
Applied a total of 0 rules in 21035 ms. Remains 2920 /2920 variables (removed 0) and now considering 5626/5626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21035 ms. Remains : 2920/2920 places, 5626/5626 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (G (OR p1 p0))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 10 factoid took 217 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 5627 rows 2920 cols
[2024-06-07 12:47:35] [INFO ] Computed 107 invariants in 36 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-07 12:47:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 54 out of 2920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2920/2920 places, 5627/5627 transitions.
Applied a total of 0 rules in 740 ms. Remains 2920 /2920 variables (removed 0) and now considering 5627/5627 (removed 0) transitions.
[2024-06-07 12:47:51] [INFO ] Invariant cache hit.
[2024-06-07 12:47:53] [INFO ] Implicit Places using invariants in 1485 ms returned []
[2024-06-07 12:47:53] [INFO ] Invariant cache hit.
[2024-06-07 12:47:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-07 12:47:59] [INFO ] Implicit Places using invariants and state equation in 6236 ms returned []
Implicit Place search using SMT with State Equation took 7728 ms to find 0 implicit places.
[2024-06-07 12:47:59] [INFO ] Redundant transitions in 281 ms returned []
Running 5621 sub problems to find dead transitions.
[2024-06-07 12:47:59] [INFO ] Invariant cache hit.
[2024-06-07 12:47:59] [INFO ] State equation strengthened by 9 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2914/8547 variables, and 97 constraints, problems are : Problem set: 0 solved, 5621 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 5621/2814 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5621 unsolved
[2024-06-07 12:49:22] [INFO ] Deduced a trap composed of 156 places in 255 ms of which 3 ms to minimize.
[2024-06-07 12:49:22] [INFO ] Deduced a trap composed of 106 places in 205 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/8547 variables, and 99 constraints, problems are : Problem set: 0 solved, 5621 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 2807/2814 constraints, Known Traps: 2/2 constraints]
After SMT, in 106862ms problems are : Problem set: 0 solved, 5621 unsolved
Search for dead transitions found 0 dead transitions in 106920ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 115690 ms. Remains : 2920/2920 places, 5627/5627 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 111 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 3439 ms. (11 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 801 ms. (49 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 783 ms. (51 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 606 ms. (65 steps per ms) remains 2/2 properties
[2024-06-07 12:49:48] [INFO ] Invariant cache hit.
[2024-06-07 12:49:48] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2813/2867 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2867 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/2920 variables, 53/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2920 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5626/8546 variables, 2920/3027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8546 variables, 8/3035 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8546 variables, 0/3035 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/8547 variables, 1/3036 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8547 variables, 0/3036 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/8547 variables, 0/3036 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8547/8547 variables, and 3036 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2461 ms.
Refiners :[Positive P Invariants (semi-flows): 107/107 constraints, State Equation: 2920/2920 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2813/2867 variables, 54/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-07 12:49:54] [INFO ] Deduced a trap composed of 546 places in 2997 ms of which 18 ms to minimize.
[2024-06-07 12:49:57] [INFO ] Deduced a trap composed of 516 places in 3143 ms of which 18 ms to minimize.
SMT process timed out in 9057ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 2920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2920/2920 places, 5627/5627 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 2920 transition count 5626
Applied a total of 1 rules in 27194 ms. Remains 2920 /2920 variables (removed 0) and now considering 5626/5627 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27194 ms. Remains : 2920/2920 places, 5626/5627 transitions.
RANDOM walk for 40000 steps (8 resets) in 2981 ms. (13 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 586 ms. (68 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 304406 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 1
Probabilistic random walk after 304406 steps, saw 259737 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
// Phase 1: matrix 5626 rows 2920 cols
[2024-06-07 12:50:29] [INFO ] Computed 107 invariants in 34 ms
[2024-06-07 12:50:29] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2813/2866 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2866 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 54/2920 variables, 54/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2920 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5626/8546 variables, 2920/3027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8546 variables, 8/3035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8546 variables, 0/3035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/8546 variables, 0/3035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8546/8546 variables, and 3035 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2028 ms.
Refiners :[Positive P Invariants (semi-flows): 107/107 constraints, State Equation: 2920/2920 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2813/2866 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 12:50:34] [INFO ] Deduced a trap composed of 106 places in 3081 ms of which 17 ms to minimize.
[2024-06-07 12:50:37] [INFO ] Deduced a trap composed of 750 places in 3161 ms of which 19 ms to minimize.
[2024-06-07 12:50:41] [INFO ] Deduced a trap composed of 756 places in 3176 ms of which 19 ms to minimize.
[2024-06-07 12:50:44] [INFO ] Deduced a trap composed of 156 places in 3028 ms of which 17 ms to minimize.
[2024-06-07 12:50:47] [INFO ] Deduced a trap composed of 756 places in 3172 ms of which 19 ms to minimize.
[2024-06-07 12:50:50] [INFO ] Deduced a trap composed of 250 places in 3103 ms of which 18 ms to minimize.
[2024-06-07 12:50:53] [INFO ] Deduced a trap composed of 754 places in 3178 ms of which 18 ms to minimize.
[2024-06-07 12:50:56] [INFO ] Deduced a trap composed of 756 places in 3182 ms of which 19 ms to minimize.
[2024-06-07 12:50:59] [INFO ] Deduced a trap composed of 754 places in 3005 ms of which 19 ms to minimize.
[2024-06-07 12:51:03] [INFO ] Deduced a trap composed of 684 places in 3166 ms of which 19 ms to minimize.
[2024-06-07 12:51:06] [INFO ] Deduced a trap composed of 754 places in 3153 ms of which 20 ms to minimize.
[2024-06-07 12:51:09] [INFO ] Deduced a trap composed of 754 places in 3189 ms of which 19 ms to minimize.
[2024-06-07 12:51:12] [INFO ] Deduced a trap composed of 756 places in 3165 ms of which 18 ms to minimize.
[2024-06-07 12:51:15] [INFO ] Deduced a trap composed of 750 places in 3177 ms of which 18 ms to minimize.
[2024-06-07 12:51:19] [INFO ] Deduced a trap composed of 736 places in 3049 ms of which 22 ms to minimize.
SMT process timed out in 49972ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 2920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2920/2920 places, 5626/5626 transitions.
Applied a total of 0 rules in 20757 ms. Remains 2920 /2920 variables (removed 0) and now considering 5626/5626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20757 ms. Remains : 2920/2920 places, 5626/5626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2920/2920 places, 5626/5626 transitions.
Applied a total of 0 rules in 20849 ms. Remains 2920 /2920 variables (removed 0) and now considering 5626/5626 (removed 0) transitions.
[2024-06-07 12:52:00] [INFO ] Invariant cache hit.
[2024-06-07 12:52:02] [INFO ] Implicit Places using invariants in 2213 ms returned []
[2024-06-07 12:52:02] [INFO ] Invariant cache hit.
[2024-06-07 12:52:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-07 12:52:09] [INFO ] Implicit Places using invariants and state equation in 6532 ms returned []
Implicit Place search using SMT with State Equation took 8747 ms to find 0 implicit places.
[2024-06-07 12:52:09] [INFO ] Redundant transitions in 292 ms returned []
Running 5620 sub problems to find dead transitions.
[2024-06-07 12:52:09] [INFO ] Invariant cache hit.
[2024-06-07 12:52:09] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2914/8546 variables, and 97 constraints, problems are : Problem set: 0 solved, 5620 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 5620/2813 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5620 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/8546 variables, and 97 constraints, problems are : Problem set: 0 solved, 5620 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 2807/2813 constraints, Known Traps: 0/0 constraints]
After SMT, in 105903ms problems are : Problem set: 0 solved, 5620 unsolved
Search for dead transitions found 0 dead transitions in 105947ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135851 ms. Remains : 2920/2920 places, 5626/5626 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p1))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 221 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 5627 rows 2920 cols
[2024-06-07 12:53:56] [INFO ] Computed 107 invariants in 33 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p1))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 12 factoid took 242 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-10-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-10-LTLCardinality-02 finished in 628713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p0&&(p1||X(p2))))))'
Support contains 160 out of 2920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2920/2920 places, 5627/5627 transitions.
Applied a total of 0 rules in 133 ms. Remains 2920 /2920 variables (removed 0) and now considering 5627/5627 (removed 0) transitions.
[2024-06-07 12:54:11] [INFO ] Invariant cache hit.
[2024-06-07 12:54:12] [INFO ] Implicit Places using invariants in 1433 ms returned []
[2024-06-07 12:54:12] [INFO ] Invariant cache hit.
[2024-06-07 12:54:15] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-07 12:54:18] [INFO ] Implicit Places using invariants and state equation in 6045 ms returned []
Implicit Place search using SMT with State Equation took 7484 ms to find 0 implicit places.
Running 5621 sub problems to find dead transitions.
[2024-06-07 12:54:19] [INFO ] Invariant cache hit.
[2024-06-07 12:54:19] [INFO ] State equation strengthened by 9 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2914/8547 variables, and 97 constraints, problems are : Problem set: 0 solved, 5621 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 5621/2814 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5621 unsolved
[2024-06-07 12:55:40] [INFO ] Deduced a trap composed of 156 places in 252 ms of which 4 ms to minimize.
[2024-06-07 12:55:40] [INFO ] Deduced a trap composed of 106 places in 200 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/8547 variables, and 99 constraints, problems are : Problem set: 0 solved, 5621 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 2807/2814 constraints, Known Traps: 2/2 constraints]
After SMT, in 105914ms problems are : Problem set: 0 solved, 5621 unsolved
Search for dead transitions found 0 dead transitions in 105961ms
Finished structural reductions in LTL mode , in 1 iterations and 113592 ms. Remains : 2920/2920 places, 5627/5627 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-10-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-10-LTLCardinality-06 finished in 113860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&F(p1)))))))'
Support contains 2 out of 2920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2920/2920 places, 5627/5627 transitions.
Applied a total of 0 rules in 141 ms. Remains 2920 /2920 variables (removed 0) and now considering 5627/5627 (removed 0) transitions.
[2024-06-07 12:56:05] [INFO ] Invariant cache hit.
[2024-06-07 12:56:07] [INFO ] Implicit Places using invariants in 1777 ms returned []
[2024-06-07 12:56:07] [INFO ] Invariant cache hit.
[2024-06-07 12:56:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-07 12:56:14] [INFO ] Implicit Places using invariants and state equation in 6974 ms returned []
Implicit Place search using SMT with State Equation took 8756 ms to find 0 implicit places.
Running 5621 sub problems to find dead transitions.
[2024-06-07 12:56:14] [INFO ] Invariant cache hit.
[2024-06-07 12:56:14] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2914/8547 variables, and 97 constraints, problems are : Problem set: 0 solved, 5621 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 5621/2814 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 5621 unsolved
[2024-06-07 12:57:35] [INFO ] Deduced a trap composed of 156 places in 250 ms of which 4 ms to minimize.
[2024-06-07 12:57:35] [INFO ] Deduced a trap composed of 106 places in 217 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/8547 variables, and 99 constraints, problems are : Problem set: 0 solved, 5621 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2920 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 2807/2814 constraints, Known Traps: 2/2 constraints]
After SMT, in 105014ms problems are : Problem set: 0 solved, 5621 unsolved
Search for dead transitions found 0 dead transitions in 105062ms
Finished structural reductions in LTL mode , in 1 iterations and 113971 ms. Remains : 2920/2920 places, 5627/5627 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-10-LTLCardinality-13 finished in 114239 ms.
All properties solved by simple procedures.
Total runtime 1339951 ms.
BK_STOP 1717765079558
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BlocksWorld-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r602-tall-171774424700235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-10.tgz
mv BlocksWorld-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;