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.r510-tall-171654365300412.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 NoC3x3-PT-7B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r510-tall-171654365300412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 06:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 06:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 06:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 06:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 2.0M 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717232345980

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-7B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:59:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 08:59:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:59:07] [INFO ] Load time of PNML (sax parser for PT used): 310 ms
[2024-06-01 08:59:07] [INFO ] Transformed 7014 places.
[2024-06-01 08:59:07] [INFO ] Transformed 8833 transitions.
[2024-06-01 08:59:07] [INFO ] Found NUPN structural information;
[2024-06-01 08:59:07] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 516 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7824 edges and 7014 vertex of which 4885 / 7014 are part of one of the 33 SCC in 31 ms
Free SCC test removed 4852 places
Ensure Unique test removed 5920 transitions
Reduce isomorphic transitions removed 5920 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 353 transitions
Trivial Post-agglo rules discarded 353 transitions
Performed 353 trivial Post agglomeration. Transition count delta: 353
Iterating post reduction 0 with 353 rules applied. Total rules applied 354 place count 2162 transition count 2560
Reduce places removed 353 places and 0 transitions.
Iterating post reduction 1 with 353 rules applied. Total rules applied 707 place count 1809 transition count 2560
Performed 934 Post agglomeration using F-continuation condition.Transition count delta: 934
Deduced a syphon composed of 934 places in 2 ms
Reduce places removed 934 places and 0 transitions.
Iterating global reduction 2 with 1868 rules applied. Total rules applied 2575 place count 875 transition count 1626
Applied a total of 2575 rules in 449 ms. Remains 875 /7014 variables (removed 6139) and now considering 1626/8833 (removed 7207) transitions.
[2024-06-01 08:59:08] [INFO ] Flow matrix only has 1424 transitions (discarded 202 similar events)
// Phase 1: matrix 1424 rows 875 cols
[2024-06-01 08:59:08] [INFO ] Computed 66 invariants in 22 ms
[2024-06-01 08:59:09] [INFO ] Implicit Places using invariants in 1018 ms returned [13, 89, 195, 271, 399, 556, 650, 728, 831]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1130 ms to find 9 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 866/7014 places, 1626/8833 transitions.
Graph (trivial) has 705 edges and 866 vertex of which 48 / 866 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Applied a total of 1 rules in 16 ms. Remains 842 /866 variables (removed 24) and now considering 1578/1626 (removed 48) transitions.
[2024-06-01 08:59:09] [INFO ] Flow matrix only has 1376 transitions (discarded 202 similar events)
// Phase 1: matrix 1376 rows 842 cols
[2024-06-01 08:59:09] [INFO ] Computed 57 invariants in 10 ms
[2024-06-01 08:59:10] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-06-01 08:59:10] [INFO ] Flow matrix only has 1376 transitions (discarded 202 similar events)
[2024-06-01 08:59:10] [INFO ] Invariant cache hit.
[2024-06-01 08:59:10] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-01 08:59:11] [INFO ] Implicit Places using invariants and state equation in 1687 ms returned []
Implicit Place search using SMT with State Equation took 2249 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 842/7014 places, 1578/8833 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 3866 ms. Remains : 842/7014 places, 1578/8833 transitions.
Discarding 624 transitions out of 1578. Remains 954
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (528 resets) in 4168 ms. (9 steps per ms) remains 73/953 properties
BEST_FIRST walk for 4004 steps (4 resets) in 26 ms. (148 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 18 ms. (210 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 18 ms. (210 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 24 ms. (160 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 24 ms. (160 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
[2024-06-01 08:59:13] [INFO ] Flow matrix only has 1376 transitions (discarded 202 similar events)
[2024-06-01 08:59:13] [INFO ] Invariant cache hit.
[2024-06-01 08:59:13] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 337/417 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 337/446 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 425/842 variables, 28/474 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 425/899 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1375/2217 variables, 842/1741 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/2217 variables, 70/1811 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2217/2218 variables, and 1811 constraints, problems are : Problem set: 0 solved, 73 unsolved in 5013 ms.
Refiners :[Domain max(s): 842/842 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 842/842 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 337/417 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 337/446 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 425/842 variables, 28/474 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 425/899 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1375/2217 variables, 842/1741 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2217 variables, 70/1811 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2217 variables, 73/1884 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2217/2218 variables, and 1884 constraints, problems are : Problem set: 0 solved, 73 unsolved in 5016 ms.
Refiners :[Domain max(s): 842/842 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 842/842 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 10122ms problems are : Problem set: 0 solved, 73 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 80 out of 842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 842/842 places, 1578/1578 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 842 transition count 1545
Discarding 430 places :
Symmetric choice reduction at 1 with 430 rule applications. Total rules 463 place count 412 transition count 1037
Iterating global reduction 1 with 430 rules applied. Total rules applied 893 place count 412 transition count 1037
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 405 transitions.
Iterating post reduction 1 with 405 rules applied. Total rules applied 1298 place count 412 transition count 632
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1300 place count 411 transition count 643
Free-agglomeration rule applied 170 times.
Iterating global reduction 2 with 170 rules applied. Total rules applied 1470 place count 411 transition count 473
Reduce places removed 170 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (complete) has 687 edges and 241 vertex of which 191 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Iterating post reduction 2 with 206 rules applied. Total rules applied 1676 place count 191 transition count 418
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 1721 place count 191 transition count 373
Applied a total of 1721 rules in 146 ms. Remains 191 /842 variables (removed 651) and now considering 373/1578 (removed 1205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 191/842 places, 373/1578 transitions.
RANDOM walk for 4000000 steps (8 resets) in 35423 ms. (112 steps per ms) remains 25/73 properties
BEST_FIRST walk for 400003 steps (8 resets) in 986 ms. (405 steps per ms) remains 14/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 920 ms. (434 steps per ms) remains 11/14 properties
BEST_FIRST walk for 400002 steps (8 resets) in 892 ms. (447 steps per ms) remains 10/11 properties
BEST_FIRST walk for 400003 steps (8 resets) in 665 ms. (600 steps per ms) remains 6/10 properties
BEST_FIRST walk for 400004 steps (8 resets) in 725 ms. (550 steps per ms) remains 6/6 properties
BEST_FIRST walk for 400003 steps (8 resets) in 665 ms. (600 steps per ms) remains 6/6 properties
BEST_FIRST walk for 400003 steps (8 resets) in 637 ms. (626 steps per ms) remains 6/6 properties
BEST_FIRST walk for 400003 steps (8 resets) in 748 ms. (534 steps per ms) remains 5/6 properties
BEST_FIRST walk for 400003 steps (8 resets) in 579 ms. (689 steps per ms) remains 4/5 properties
[2024-06-01 08:59:35] [INFO ] Flow matrix only has 282 transitions (discarded 91 similar events)
// Phase 1: matrix 282 rows 191 cols
[2024-06-01 08:59:35] [INFO ] Computed 44 invariants in 2 ms
[2024-06-01 08:59:35] [INFO ] State equation strengthened by 157 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 163/191 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 282/473 variables, 191/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 157/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/473 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 392 constraints, problems are : Problem set: 0 solved, 4 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 191/191 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 163/191 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 282/473 variables, 191/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 157/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 4/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/473 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 396 constraints, problems are : Problem set: 0 solved, 4 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 191/191 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 539ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 352 steps, including 24 resets, run visited all 1 properties in 4 ms. (steps per millisecond=88 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 39 ms.
Able to resolve query QuasiLiveness after proving 954 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 28964 ms.
ITS solved all properties within timeout

BK_STOP 1717232376439

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 QuasiLiveness -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="NoC3x3-PT-7B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is NoC3x3-PT-7B, 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 r510-tall-171654365300412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-7B.tgz
mv NoC3x3-PT-7B 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;