Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r016-oct2-177944372500072.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is AirplaneLD-PT-0500, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-oct2-177944372500072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.3M
-rw-r--r-- 1 mcc users 312K Mar 4 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1023K Mar 4 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 229K Mar 4 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Mar 4 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 16K Mar 17 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 17 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 117K Mar 17 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 507K Mar 17 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 611K Mar 4 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.0M Mar 4 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 125K Mar 4 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 687K Mar 4 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 56K Mar 17 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 109K Mar 17 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 2.2M Mar 3 18:30 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1779686718918

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AirplaneLD-PT-0500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202505121319
[2026-05-25 05:25:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-25 05:25:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 05:25:21] [INFO ] Load time of PNML (sax parser for PT used): 419 ms
[2026-05-25 05:25:21] [INFO ] Transformed 3519 places.
[2026-05-25 05:25:21] [INFO ] Transformed 4008 transitions.
[2026-05-25 05:25:21] [INFO ] Found NUPN structural information;
[2026-05-25 05:25:21] [INFO ] Parsed PT model containing 3519 places and 4008 transitions and 15278 arcs in 675 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 3519/3519 places, 4008/4008 transitions.
Reduce places removed 1505 places and 0 transitions.
Iterating post reduction 0 with 1505 rules applied. Total rules applied 1505 place count 2014 transition count 4008
Applied a total of 1505 rules in 131 ms. Remains 2014 /3519 variables (removed 1505) and now considering 4008/4008 (removed 0) transitions.
// Phase 1: matrix 4008 rows 2014 cols
[2026-05-25 05:25:21] [INFO ] Computed 1 invariants in 417 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:25:23] [INFO ] Implicit Places using invariants in 2108 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2160 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 2013/3519 places, 4008/4008 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2013 transition count 4006
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 2011 transition count 4006
Applied a total of 4 rules in 43 ms. Remains 2011 /2013 variables (removed 2) and now considering 4006/4008 (removed 2) transitions.
// Phase 1: matrix 4006 rows 2011 cols
[2026-05-25 05:25:23] [INFO ] Computed 0 invariants in 319 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:25:25] [INFO ] Implicit Places using invariants in 1533 ms returned []
[2026-05-25 05:25:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:25:29] [INFO ] Implicit Places using invariants and state equation in 4605 ms returned []
Implicit Place search using SMT with State Equation took 6143 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 2011/3519 places, 4006/4008 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 8508 ms. Remains : 2011/3519 places, 4006/4008 transitions.
Discarding 1999 transitions out of 4006. Remains 2007
Initial state reduction rules removed 5 formulas.
[2026-05-25 05:25:32] [INFO ] Flatten gal took : 869 ms
[2026-05-25 05:25:32] [INFO ] Flatten gal took : 315 ms
[2026-05-25 05:25:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10217083691872467988.gal : 124 ms
[2026-05-25 05:25:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13925462194516050765.prop : 30 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10217083691872467988.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13925462194516050765.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13925462194516050765.prop.
RANDOM walk for 40000 steps (5739 resets) in 14171 ms. (2 steps per ms) remains 562/2002 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 19 ms. (6 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 22 ms. (5 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 19 ms. (6 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 45 ms. (2 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 562/562 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 562/562 properties
[2026-05-25 05:25:34] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,2002 properties remain. new max is 4
SDD size :1 after 283
SDD proceeding with computation,2002 properties remain. new max is 8
SDD size :283 after 288
SDD proceeding with computation,2002 properties remain. new max is 16
SDD size :288 after 297
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/565 variables, 565/565 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/6017 variables, and 565 constraints, problems are : Problem set: 0 solved, 562 unsolved in 5075 ms.
Refiners :[Domain max(s): 565/2011 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 562/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 565/565 constraints. Problems are: Problem set: 0 solved, 562 unsolved
SDD proceeding with computation,2002 properties remain. new max is 32
SDD size :297 after 313
SDD proceeding with computation,2002 properties remain. new max is 64
SDD size :313 after 346
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 565/6017 variables, and 565 constraints, problems are : Problem set: 0 solved, 562 unsolved in 5034 ms.
Refiners :[Domain max(s): 565/2011 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 336/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13104ms problems are : Problem set: 0 solved, 562 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 565 out of 2011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2011/2011 places, 4006/4006 transitions.
Graph (complete) has 2759 edges and 2011 vertex of which 2010 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 2010 transition count 4003
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 2010 transition count 4001
Deduced a syphon composed of 2 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 2007 transition count 4001
Discarding 1433 places :
Symmetric choice reduction at 1 with 1433 rule applications. Total rules 1442 place count 574 transition count 2568
Iterating global reduction 1 with 1433 rules applied. Total rules applied 2875 place count 574 transition count 2568
Ensure Unique test removed 1433 transitions
Reduce isomorphic transitions removed 1433 transitions.
Iterating post reduction 1 with 1433 rules applied. Total rules applied 4308 place count 574 transition count 1135
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 4313 place count 574 transition count 1130
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 4318 place count 569 transition count 1130
Applied a total of 4318 rules in 240 ms. Remains 569 /2011 variables (removed 1442) and now considering 1130/4006 (removed 2876) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 569/2011 places, 1130/4006 transitions.
SDD proceeding with computation,2002 properties remain. new max is 128
SDD size :346 after 411
RANDOM walk for 186286 steps (27875 resets) in 6536 ms. (28 steps per ms) remains 0/562 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 2007 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 29023 ms.

BK_STOP 1779686749634

--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -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 QuasiLiveness -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="AirplaneLD-PT-0500"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is AirplaneLD-PT-0500, examination is QuasiLiveness"
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-oct2-177944372500072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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