fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r612-tall-171774431300159
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for BlocksWorld-PT-12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15155.155 575967.00 664046.00 1182.70 F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r612-tall-171774431300159.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BlocksWorld-PT-12, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r612-tall-171774431300159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 885K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.2M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 37K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 989K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.3M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 119K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 286K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 3.8M Jun 7 06:26 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1717746538340

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 07:48:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-07 07:48:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:48:59] [INFO ] Load time of PNML (sax parser for PT used): 372 ms
[2024-06-07 07:49:00] [INFO ] Transformed 4031 places.
[2024-06-07 07:49:00] [INFO ] Transformed 7813 transitions.
[2024-06-07 07:49:00] [INFO ] Found NUPN structural information;
[2024-06-07 07:49:00] [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]
[2024-06-07 07:49:00] [INFO ] Parsed PT model containing 4031 places and 7813 transitions and 39042 arcs in 540 ms.
Discarding 62 transitions out of 7813. Remains 7751
Built sparse matrix representations for Structural reductions in 61 ms.49585KB 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 1495 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 1514 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 1111 ms. Remains 4031 /4031 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
// Phase 1: matrix 7813 rows 4031 cols
[2024-06-07 07:49:04] [INFO ] Computed 125 invariants in 108 ms
[2024-06-07 07:49:05] [INFO ] Implicit Places using invariants in 1187 ms returned []
[2024-06-07 07:49:05] [INFO ] Invariant cache hit.
[2024-06-07 07:49:09] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-06-07 07:49:10] [INFO ] Implicit Places using invariants and state equation in 4891 ms returned []
Implicit Place search using SMT with State Equation took 6125 ms to find 0 implicit places.
[2024-06-07 07:49:10] [INFO ] Redundant transitions in 912 ms returned []
Running 7807 sub problems to find dead transitions.
[2024-06-07 07:49:11] [INFO ] Invariant cache hit.
[2024-06-07 07:49:11] [INFO ] State equation strengthened by 113 read => feed constraints.
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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/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 30277 ms.
Refiners :[Positive P Invariants (semi-flows): 113/125 constraints, State Equation: 0/4031 constraints, ReadFeed: 0/113 constraints, PredecessorRefiner: 7751/3907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 112 solved, 7695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3969 variables, 7/7 constraints. Problems are: Problem set: 112 solved, 7695 unsolved
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 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 7/125 constraints, State Equation: 0/4031 constraints, ReadFeed: 0/113 constraints, PredecessorRefiner: 3844/3907 constraints, Known Traps: 0/0 constraints]
After SMT, in 132424ms problems are : Problem set: 112 solved, 7695 unsolved
Search for dead transitions found 112 dead transitions in 132628ms
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.39 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 1210 ms. Remains 3975 /4031 variables (removed 56) and now considering 7701/7701 (removed 0) transitions.
// Phase 1: matrix 7701 rows 3975 cols
[2024-06-07 07:51:24] [INFO ] Computed 125 invariants in 41 ms
[2024-06-07 07:51:25] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-06-07 07:51:25] [INFO ] Invariant cache hit.
[2024-06-07 07:51:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-07 07:51:29] [INFO ] Implicit Places using invariants and state equation in 4559 ms returned []
Implicit Place search using SMT with State Equation took 5156 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 147203 ms. Remains : 3975/4031 places, 7701/7813 transitions.
Interrupted Random walk after 405000 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=13 )
Interrupted Random directed walk after 532229 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=17 )
[2024-06-07 07:52:30] [INFO ] Invariant cache hit.
[2024-06-07 07:52:35] [INFO ] [Real]Absence check using 125 positive place invariants in 2594 ms returned sat
[2024-06-07 07:53:36] [INFO ] [Real]Absence check using state equation in 60670 ms returned sat
[2024-06-07 07:53:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 07:53:41] [INFO ] [Nat]Absence check using 125 positive place invariants in 1399 ms returned sat
[2024-06-07 07:55:41] [INFO ] [Nat]Absence check using state equation in 120660 ms returned sat
[2024-06-07 07:55:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-07 07:55:42] [INFO ] [Nat]Added 13 Read/Feed constraints in 131 ms returned sat
[2024-06-07 07:55:48] [INFO ] Deduced a trap composed of 240 places in 5909 ms of which 203 ms to minimize.
[2024-06-07 07:55:54] [INFO ] Deduced a trap composed of 183 places in 6253 ms of which 29 ms to minimize.
[2024-06-07 07:56:01] [INFO ] Deduced a trap composed of 124 places in 5827 ms of which 29 ms to minimize.
[2024-06-07 07:56:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 20049 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 4031/4031 places, 7813/7813 transitions.
Applied a total of 0 rules in 57 ms. Remains 4031 /4031 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
// Phase 1: matrix 7813 rows 4031 cols
[2024-06-07 07:56:02] [INFO ] Computed 125 invariants in 44 ms
[2024-06-07 07:56:06] [INFO ] Implicit Places using invariants in 4467 ms returned []
[2024-06-07 07:56:06] [INFO ] Invariant cache hit.
[2024-06-07 07:56:11] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-06-07 07:56:24] [INFO ] Implicit Places using invariants and state equation in 18242 ms returned []
Implicit Place search using SMT with State Equation took 22730 ms to find 0 implicit places.
Running 7807 sub problems to find dead transitions.
[2024-06-07 07:56:25] [INFO ] Invariant cache hit.
[2024-06-07 07:56:25] [INFO ] State equation strengthened by 113 read => feed constraints.
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 30222 ms.
Refiners :[Positive P Invariants (semi-flows): 113/125 constraints, State Equation: 0/4031 constraints, ReadFeed: 0/113 constraints, PredecessorRefiner: 7751/3907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 112 solved, 7695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3969 variables, 7/7 constraints. Problems are: Problem set: 112 solved, 7695 unsolved
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 30114 ms.
Refiners :[Positive P Invariants (semi-flows): 7/125 constraints, State Equation: 0/4031 constraints, ReadFeed: 0/113 constraints, PredecessorRefiner: 3844/3907 constraints, Known Traps: 0/0 constraints]
After SMT, in 129109ms problems are : Problem set: 112 solved, 7695 unsolved
Search for dead transitions found 112 dead transitions in 129182ms
Found 112 dead transitions using SMT.
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 574659 ms.
ITS solved all properties within timeout

BK_STOP 1717747114307

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BlocksWorld-PT-12"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is BlocksWorld-PT-12, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r612-tall-171774431300159"
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 [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;