Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r021-smll-174853770100056.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-12, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-174853770100056
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.7M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 115K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 277K 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 3.8M 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

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1748549151653

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202505121319
[2025-05-29 20:05:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-05-29 20:05:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:05:58] [INFO ] Load time of PNML (sax parser for PT used): 2427 ms
[2025-05-29 20:05:58] [INFO ] Transformed 4031 places.
[2025-05-29 20:05:58] [INFO ] Transformed 7813 transitions.
[2025-05-29 20:05:58] [INFO ] Found NUPN structural information;
[2025-05-29 20:05:58] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52, pred_on_table_53, pred_on_table_54, pred_on_table_55, pred_on_table_56, pred_on_table_57, pred_on_table_58, pred_on_table_59, pred_on_table_60, pred_on_table_61]
[2025-05-29 20:05:58] [INFO ] Parsed PT model containing 4031 places and 7813 transitions and 39042 arcs in 2743 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 7 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 66 ms.21854KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 4031/4031 places, 7813/7813 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 2712 ms. Remains 4031 /4031 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 2741 ms. Remains : 4031/4031 places, 7813/7813 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 4031/4031 places, 7813/7813 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 2444 ms. Remains 4031 /4031 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
// Phase 1: matrix 7813 rows 4031 cols
[2025-05-29 20:06:04] [INFO ] Computed 125 invariants in 223 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:06:17] [INFO ] Implicit Places using invariants in 13137 ms returned []
[2025-05-29 20:06:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:06:25] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-05-29 20:06:50] [INFO ] Implicit Places using invariants and state equation in 33615 ms returned []
Implicit Place search using SMT with State Equation took 46851 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:06:52] [INFO ] Redundant transitions in 1580 ms returned []
Running 7807 sub problems to find dead transitions.
[2025-05-29 20:06:52] [INFO ] Invariant cache hit.
[2025-05-29 20:06:52] [INFO ] State equation strengthened by 113 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Problem TDEAD1 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2266 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2707 is UNSAT
Problem TDEAD2770 is UNSAT
Problem TDEAD2833 is UNSAT
Problem TDEAD2896 is UNSAT
Problem TDEAD2959 is UNSAT
Problem TDEAD3022 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3148 is UNSAT
Problem TDEAD3211 is UNSAT
Problem TDEAD3274 is UNSAT
Problem TDEAD3463 is UNSAT
Problem TDEAD3526 is UNSAT
Problem TDEAD3589 is UNSAT
Problem TDEAD3652 is UNSAT
Problem TDEAD3715 is UNSAT
Problem TDEAD3841 is UNSAT
Problem TDEAD3904 is UNSAT
Problem TDEAD3967 is UNSAT
Problem TDEAD4030 is UNSAT
Problem TDEAD4152 is UNSAT
Problem TDEAD4272 is UNSAT
Problem TDEAD4390 is UNSAT
Problem TDEAD4506 is UNSAT
Problem TDEAD4620 is UNSAT
Problem TDEAD4732 is UNSAT
Problem TDEAD4842 is UNSAT
Problem TDEAD4950 is UNSAT
Problem TDEAD5056 is UNSAT
Problem TDEAD5160 is UNSAT
Problem TDEAD5262 is UNSAT
Problem TDEAD5362 is UNSAT
Problem TDEAD5460 is UNSAT
Problem TDEAD5556 is UNSAT
Problem TDEAD5742 is UNSAT
Problem TDEAD5832 is UNSAT
Problem TDEAD5920 is UNSAT
Problem TDEAD6006 is UNSAT
Problem TDEAD6090 is UNSAT
Problem TDEAD6172 is UNSAT
Problem TDEAD6252 is UNSAT
Problem TDEAD6330 is UNSAT
Problem TDEAD6406 is UNSAT
Problem TDEAD6480 is UNSAT
Problem TDEAD6552 is UNSAT
Problem TDEAD6622 is UNSAT
Problem TDEAD6756 is UNSAT
Problem TDEAD6820 is UNSAT
Problem TDEAD6882 is UNSAT
Problem TDEAD6942 is UNSAT
Problem TDEAD7000 is UNSAT
Problem TDEAD7056 is UNSAT
Problem TDEAD7110 is UNSAT
Problem TDEAD7162 is UNSAT
Problem TDEAD7212 is UNSAT
Problem TDEAD7306 is UNSAT
Problem TDEAD7350 is UNSAT
Problem TDEAD7392 is UNSAT
Problem TDEAD7432 is UNSAT
Problem TDEAD7470 is UNSAT
Problem TDEAD7506 is UNSAT
Problem TDEAD7540 is UNSAT
Problem TDEAD7572 is UNSAT
Problem TDEAD7602 is UNSAT
Problem TDEAD7630 is UNSAT
Problem TDEAD7656 is UNSAT
Problem TDEAD7722 is UNSAT
Problem TDEAD7740 is UNSAT
Problem TDEAD7756 is UNSAT
Problem TDEAD7770 is UNSAT
Problem TDEAD7782 is UNSAT
Problem TDEAD7800 is UNSAT
Problem TDEAD7806 is UNSAT
Problem TDEAD7810 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4025 variables, 113/113 constraints. Problems are: Problem set: 112 solved, 7695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4025/11844 variables, and 113 constraints, problems are : Problem set: 112 solved, 7695 unsolved in 30328 ms.
Refiners :[Positive P Invariants (semi-flows): 113/125 constraints, State Equation: 0/4031 constraints, ReadFeed: 0/113 constraints, PredecessorRefiner: 7751/3906 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 112 solved, 7695 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3969 variables, 7/7 constraints. Problems are: Problem set: 112 solved, 7695 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3969/11844 variables, and 7 constraints, problems are : Problem set: 112 solved, 7695 unsolved in 30147 ms.
Refiners :[Positive P Invariants (semi-flows): 7/125 constraints, State Equation: 0/4031 constraints, ReadFeed: 0/113 constraints, PredecessorRefiner: 3845/3906 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84550ms problems are : Problem set: 112 solved, 7695 unsolved
Search for dead transitions found 112 dead transitions in 84653ms
Found 112 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 112 transitions
Dead transitions reduction (with SMT) removed 112 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 4031/4031 places, 7701/7813 transitions.
Computed a total of 56 stabilizing places and 0 stable transitions
Graph (complete) has 22245 edges and 4031 vertex of which 3975 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.28 ms
Discarding 56 places :
Also discarding 0 output transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 1 rules in 1933 ms. Remains 3975 /4031 variables (removed 56) and now considering 7701/7701 (removed 0) transitions.
// Phase 1: matrix 7701 rows 3975 cols
[2025-05-29 20:08:19] [INFO ] Computed 125 invariants in 57 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:08:28] [INFO ] Implicit Places using invariants in 10053 ms returned []
[2025-05-29 20:08:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:08:36] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-05-29 20:08:52] [INFO ] Implicit Places using invariants and state equation in 23227 ms returned []
Implicit Place search using SMT with State Equation took 33283 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 3975/4031 places, 7701/7813 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 170837 ms. Remains : 3975/4031 places, 7701/7813 transitions.
Interrupted Random walk after 229918 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Interrupted Random directed walk after 296440 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
[2025-05-29 20:09:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-05-29 20:10:14] [INFO ] [Real]Absence check using 125 positive place invariants in 18296 ms returned sat
[2025-05-29 20:14:52] [INFO ] [Real]Absence check using state equation in 277578 ms returned unknown
Interrupted Random directed walk after 294871 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
Interrupted Random walk after 230968 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Interrupted Random directed walk after 294851 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=9 )
Interrupted Random walk after 247318 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 3975/3975 places, 7701/7701 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1816 ms. Remains 3975 /3975 variables (removed 0) and now considering 7701/7701 (removed 0) transitions.
[2025-05-29 20:16:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:17:07] [INFO ] Implicit Places using invariants in 12931 ms returned []
[2025-05-29 20:17:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:17:14] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-05-29 20:17:35] [INFO ] Implicit Places using invariants and state equation in 28209 ms returned []
Implicit Place search using SMT with State Equation took 41147 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:17:36] [INFO ] Redundant transitions in 1381 ms returned []
Running 7695 sub problems to find dead transitions.
[2025-05-29 20:17:36] [INFO ] Invariant cache hit.
[2025-05-29 20:17:36] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3969 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 7695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3969/11676 variables, and 113 constraints, problems are : Problem set: 0 solved, 7695 unsolved in 30212 ms.
Refiners :[Positive P Invariants (semi-flows): 113/125 constraints, State Equation: 0/3975 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 7695/3850 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7695 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3969 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 7695 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:18:50] [INFO ] Deduced a trap composed of 348 places in 1459 ms of which 210 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:18:52] [INFO ] Deduced a trap composed of 124 places in 834 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:18:53] [INFO ] Deduced a trap composed of 183 places in 1067 ms of which 188 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:18:54] [INFO ] Deduced a trap composed of 295 places in 1005 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:18:55] [INFO ] Deduced a trap composed of 124 places in 378 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:18:58] [INFO ] Deduced a trap composed of 240 places in 1205 ms of which 304 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:18:59] [INFO ] Deduced a trap composed of 240 places in 1135 ms of which 255 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:19:00] [INFO ] Deduced a trap composed of 295 places in 996 ms of which 201 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3969/11676 variables, and 121 constraints, problems are : Problem set: 0 solved, 7695 unsolved in 30166 ms.
Refiners :[Positive P Invariants (semi-flows): 113/125 constraints, State Equation: 0/3975 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 3845/3850 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84068ms problems are : Problem set: 0 solved, 7695 unsolved
Search for dead transitions found 0 dead transitions in 84102ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 128483 ms. Remains : 3975/3975 places, 7701/7701 transitions.
Interrupted Random walk after 243454 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
Interrupted Random directed walk after 299786 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
[2025-05-29 20:20:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-05-29 20:20:23] [INFO ] [Real]Absence check using 125 positive place invariants in 18995 ms returned sat
[2025-05-29 20:25:00] [INFO ] [Real]Absence check using state equation in 277000 ms returned unknown
Interrupted Random directed walk after 299438 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
Interrupted Random walk after 230208 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Interrupted Random directed walk after 309108 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random walk after 241446 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
[2025-05-29 20:27:02] [INFO ] Flatten gal took : 852 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4937018510453892817
[2025-05-29 20:27:02] [INFO ] Too many transitions (7813) to apply POR reductions. Disabling POR matrices.
[2025-05-29 20:27:02] [INFO ] Applying decomposition
[2025-05-29 20:27:02] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4937018510453892817
Running compilation step : cd /tmp/ltsmin4937018510453892817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-29 20:27:03] [INFO ] Flatten gal took : 428 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16177258158201318485.txt' '-o' '/tmp/graph16177258158201318485.bin' '-w' '/tmp/graph16177258158201318485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16177258158201318485.bin' '-l' '-1' '-v' '-w' '/tmp/graph16177258158201318485.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:27:04] [INFO ] Decomposing Gal with order
[2025-05-29 20:27:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:27:06] [INFO ] Removed a total of 14878 redundant transitions.
[2025-05-29 20:27:07] [INFO ] Flatten gal took : 2084 ms
[2025-05-29 20:27:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 640 labels/synchronizations in 375 ms.
[2025-05-29 20:27:08] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock15037813694247063304.gal : 170 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock15037813694247063304.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...235
No direction supplied, using forward translation only.
Compilation finished in 66548 ms.
Running link step : cd /tmp/ltsmin4937018510453892817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 128 ms.
Running LTSmin : cd /tmp/ltsmin4937018510453892817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'

BK_STOP 1748550915506

--------------------
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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-12"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-12, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-smll-174853770100056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-12.tgz
mv BlocksWorld-PT-12 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;