About the Execution of ITS-Tools for BlocksWorld-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 369488.00 | 0.00 | 0.00 | FTFFFFFFFFTTTTTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r016-smll-174853764300019.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is BlocksWorld-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853764300019
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 330K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-00
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-01
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-02
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-03
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-04
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-05
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-06
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-07
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-08
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-09
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-10
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-11
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-12
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-13
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-14
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748556381204
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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 22:06:23] [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]
[2025-05-29 22:06:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 22:06:24] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2025-05-29 22:06:24] [INFO ] Transformed 379 places.
[2025-05-29 22:06:24] [INFO ] Transformed 685 transitions.
[2025-05-29 22:06:24] [INFO ] Found NUPN structural information;
[2025-05-29 22:06:24] [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]
[2025-05-29 22:06:24] [INFO ] Parsed PT model containing 379 places and 685 transitions and 3412 arcs in 501 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA BlocksWorld-PT-03-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 685/685 transitions.
Applied a total of 0 rules in 111 ms. Remains 379 /379 variables (removed 0) and now considering 685/685 (removed 0) transitions.
// Phase 1: matrix 685 rows 379 cols
[2025-05-29 22:06:24] [INFO ] Computed 37 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:06:26] [INFO ] Implicit Places using invariants in 1339 ms returned []
[2025-05-29 22:06:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:06:27] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-05-29 22:06:27] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 3008 ms to find 0 implicit places.
Running 680 sub problems to find dead transitions.
[2025-05-29 22:06:27] [INFO ] Invariant cache hit.
[2025-05-29 22:06:27] [INFO ] State equation strengthened by 27 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Problem TDEAD1 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD682 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 27/27 constraints. Problems are: Problem set: 26 solved, 654 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:06:38] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 1/28 constraints. Problems are: Problem set: 26 solved, 654 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:06:45] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 1/29 constraints. Problems are: Problem set: 26 solved, 654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/1064 variables, and 29 constraints, problems are : Problem set: 26 solved, 654 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 27/37 constraints, State Equation: 0/379 constraints, ReadFeed: 0/27 constraints, PredecessorRefiner: 667/343 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 654 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 6/6 constraints. Problems are: Problem set: 26 solved, 654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 2/8 constraints. Problems are: Problem set: 26 solved, 654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/8 constraints. Problems are: Problem set: 26 solved, 654 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD678 is UNSAT
At refinement iteration 3 (OVERLAPS) 18/379 variables, 31/39 constraints. Problems are: Problem set: 36 solved, 644 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:07:14] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 1/40 constraints. Problems are: Problem set: 36 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/1064 variables, and 40 constraints, problems are : Problem set: 36 solved, 644 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/379 constraints, ReadFeed: 0/27 constraints, PredecessorRefiner: 324/343 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62713ms problems are : Problem set: 36 solved, 644 unsolved
Search for dead transitions found 36 dead transitions in 62759ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 379/379 places, 649/685 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 361 transition count 649
Applied a total of 18 rules in 23 ms. Remains 361 /379 variables (removed 18) and now considering 649/649 (removed 0) transitions.
// Phase 1: matrix 649 rows 361 cols
[2025-05-29 22:07:30] [INFO ] Computed 37 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:07:31] [INFO ] Implicit Places using invariants in 568 ms returned []
[2025-05-29 22:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:07:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-29 22:07:32] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1538 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 361/379 places, 649/685 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67505 ms. Remains : 361/379 places, 649/685 transitions.
Support contains 29 out of 361 places after structural reductions.
[2025-05-29 22:07:32] [INFO ] Flatten gal took : 198 ms
[2025-05-29 22:07:32] [INFO ] Flatten gal took : 95 ms
[2025-05-29 22:07:33] [INFO ] Input system was already deterministic with 649 transitions.
RANDOM walk for 40000 steps (8 resets) in 2928 ms. (13 steps per ms) remains 9/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 194 ms. (205 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 9/9 properties
[2025-05-29 22:07:34] [INFO ] Invariant cache hit.
[2025-05-29 22:07:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 241/1010 variables, and 16 constraints, problems are : Problem set: 9 solved, 0 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 16/37 constraints, State Equation: 0/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BlocksWorld-PT-03-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
FORMULA BlocksWorld-PT-03-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA BlocksWorld-PT-03-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 18 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2025-05-29 22:07:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:07:35] [INFO ] Implicit Places using invariants in 420 ms returned []
[2025-05-29 22:07:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:07:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-29 22:07:36] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1384 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2025-05-29 22:07:36] [INFO ] Invariant cache hit.
[2025-05-29 22:07:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/1010 variables, and 37 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
SMT process timed out in 61181ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 61200ms
Finished structural reductions in LTL mode , in 1 iterations and 62612 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 413 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 930 ms.
Product exploration explored 100000 steps with 50000 reset in 587 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 p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-03-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-03-LTLCardinality-01 finished in 64669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)&&X(p1)))&&X(X(F(p2))))))'
Support contains 6 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 17 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2025-05-29 22:08:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:08:40] [INFO ] Implicit Places using invariants in 546 ms returned []
[2025-05-29 22:08:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:08:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-29 22:08:41] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2025-05-29 22:08:41] [INFO ] Invariant cache hit.
[2025-05-29 22:08:41] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
SMT process timed out in 30854ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 30858ms
Finished structural reductions in LTL mode , in 1 iterations and 32459 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 444 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-02
Product exploration explored 100000 steps with 3 reset in 1653 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-02 finished in 34588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G(p1)))))'
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 135 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2025-05-29 22:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:09:14] [INFO ] Implicit Places using invariants in 557 ms returned []
[2025-05-29 22:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:09:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-29 22:09:15] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:09:15] [INFO ] Redundant transitions in 61 ms returned []
Running 644 sub problems to find dead transitions.
[2025-05-29 22:09:15] [INFO ] Invariant cache hit.
[2025-05-29 22:09:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
SMT process timed out in 31122ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 31125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32681 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 1914 ms.
Stack based approach found an accepted trace after 5616 steps with 0 reset with depth 5617 and stack size 3939 in 79 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-04 finished in 34827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 6 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2025-05-29 22:09:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:09:49] [INFO ] Implicit Places using invariants in 588 ms returned []
[2025-05-29 22:09:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:09:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-29 22:09:50] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1863 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2025-05-29 22:09:50] [INFO ] Invariant cache hit.
[2025-05-29 22:09:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/1010 variables, and 37 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 325/723 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 723 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61310ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 61313ms
Finished structural reductions in LTL mode , in 1 iterations and 63184 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-07 finished in 63334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U p0))'
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 69 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2025-05-29 22:10:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:10:52] [INFO ] Implicit Places using invariants in 567 ms returned []
[2025-05-29 22:10:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:10:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-29 22:10:53] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:10:53] [INFO ] Redundant transitions in 14 ms returned []
Running 644 sub problems to find dead transitions.
[2025-05-29 22:10:53] [INFO ] Invariant cache hit.
[2025-05-29 22:10:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
SMT process timed out in 31387ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 31391ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33017 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-08
Product exploration explored 100000 steps with 78 reset in 1193 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-08 finished in 34352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 27 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2025-05-29 22:11:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:11:27] [INFO ] Implicit Places using invariants in 477 ms returned []
[2025-05-29 22:11:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:11:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-29 22:11:27] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:11:27] [INFO ] Redundant transitions in 8 ms returned []
Running 644 sub problems to find dead transitions.
[2025-05-29 22:11:27] [INFO ] Invariant cache hit.
[2025-05-29 22:11:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)timeout
(s339 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/1010 variables, and 37 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
SMT process timed out in 60933ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 60935ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62301 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-09
Product exploration explored 100000 steps with 636 reset in 1592 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-09 finished in 64018 ms.
All properties solved by simple procedures.
Total runtime 366720 ms.
BK_STOP 1748556750692
--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-03"
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-5832"
echo " Executing tool itstools"
echo " Input is BlocksWorld-PT-03, 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 r016-smll-174853764300019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-03.tgz
mv BlocksWorld-PT-03 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.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 ;