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.r520-tall-171662337800111.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 ltsminxred
Input is QuasiCertifProtocol-PT-32, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337800111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 80K Apr 13 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 499K Apr 13 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 13 03:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 216K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 387K Apr 13 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 236K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 942K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717221964172

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:06:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:06:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:06:05] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-06-01 06:06:05] [INFO ] Transformed 3806 places.
[2024-06-01 06:06:05] [INFO ] Transformed 506 transitions.
[2024-06-01 06:06:05] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1069 resets) in 2361 ms. (16 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 699 ms. (5 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 149 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1425 ms. (2 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 601 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 681 ms. (5 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 443389 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 16
Probabilistic random walk after 443389 steps, saw 55857 distinct states, run finished after 3017 ms. (steps per millisecond=146 ) properties seen :0
// Phase 1: matrix 506 rows 3806 cols
[2024-06-01 06:06:10] [INFO ] Computed 3301 invariants in 172 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3736 variables, 2208/2208 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3736/4312 variables, and 2208 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 2208/3298 constraints, State Equation: 0/3806 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3736 variables, 2208/2208 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3736/4312 variables, and 2208 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 2208/3298 constraints, State Equation: 0/3806 constraints, PredecessorRefiner: 0/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 17099ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3736 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3736 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.21 ms
Discarding 70 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 73 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 3736/3806 places, 506/506 transitions.
RANDOM walk for 40000 steps (1068 resets) in 1359 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 326 ms. (12 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 410 ms. (9 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 634 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 780 ms. (5 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 502346 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 16
Probabilistic random walk after 502346 steps, saw 62819 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
// Phase 1: matrix 506 rows 3736 cols
[2024-06-01 06:06:32] [INFO ] Computed 3232 invariants in 133 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3736 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3736 variables, 0/3232 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-00 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-01 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-02 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-05 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-09 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-13 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-14 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 506/4242 variables, 3736/6968 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4242 variables, 0/6968 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 0/4242 variables, 0/6968 constraints. Problems are: Problem set: 7 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4242/4242 variables, and 6968 constraints, problems are : Problem set: 7 solved, 9 unsolved in 27546 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 3736/3736 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3736 variables, 3232/3232 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3736 variables, 0/3232 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 506/4242 variables, 3736/6968 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4242 variables, 9/6977 constraints. Problems are: Problem set: 7 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4242/4242 variables, and 6977 constraints, problems are : Problem set: 7 solved, 9 unsolved in 45036 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 3736/3736 constraints, PredecessorRefiner: 9/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 77662ms problems are : Problem set: 7 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3736 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 37 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 3736/3736 places, 506/506 transitions.
RANDOM walk for 40000 steps (1074 resets) in 1028 ms. (38 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (33 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (35 resets) in 4156 ms. (9 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 7369 ms. (5 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 262 ms. (152 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (37 resets) in 244 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (33 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 198 ms. (201 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (33 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (37 resets) in 405 ms. (98 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 1386637 steps, run timeout after 9001 ms. (steps per millisecond=154 ) properties seen :0 out of 9
Probabilistic random walk after 1386637 steps, saw 167001 distinct states, run finished after 9002 ms. (steps per millisecond=154 ) properties seen :0
[2024-06-01 06:08:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3736 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3736 variables, 0/3232 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 506/4242 variables, 3736/6968 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4242 variables, 0/6968 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 0/4242 variables, 0/6968 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4242/4242 variables, and 6968 constraints, problems are : Problem set: 0 solved, 9 unsolved in 20914 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 3736/3736 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3736 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3736 variables, 0/3232 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 506/4242 variables, 3736/6968 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4242 variables, 9/6977 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4242 variables, 0/6977 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4242/4242 variables, and 6977 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75030 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 3736/3736 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 99060ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3736 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 38 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 3736/3736 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 25 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-06-01 06:09:41] [INFO ] Invariant cache hit.
[2024-06-01 06:09:42] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2024-06-01 06:09:42] [INFO ] Invariant cache hit.
[2024-06-01 06:09:44] [INFO ] Implicit Places using invariants and state equation in 2306 ms returned []
Implicit Place search using SMT with State Equation took 3448 ms to find 0 implicit places.
[2024-06-01 06:09:44] [INFO ] Redundant transitions in 33 ms returned []
Running 472 sub problems to find dead transitions.
[2024-06-01 06:09:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3735/4242 variables, and 3232 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 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 3735/4242 variables, and 3232 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints]
After SMT, in 60950ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60956ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64473 ms. Remains : 3736/3736 places, 506/506 transitions.
[2024-06-01 06:10:46] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 38 ms.
[2024-06-01 06:10:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3736 places, 506 transitions and 7870 arcs took 12 ms.
[2024-06-01 06:10:46] [INFO ] Flatten gal took : 312 ms
Total runtime 281269 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-03
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-04
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-06
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-07
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-08
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-10
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-11
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-12
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-15

BK_STOP 1717222247066

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/555/inv_0_
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/555/inv_1_
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/555/inv_2_
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/555/inv_3_
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/555/inv_4_
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/555/inv_5_
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/555/inv_6_
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/555/inv_7_
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/555/inv_8_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="QuasiCertifProtocol-PT-32"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-PT-32, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337800111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-32 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;