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.r470-smll-171620175500102.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 AutoFlight-PT-12b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r470-smll-171620175500102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 266K May 18 16:42 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 1717191642516

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:40:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 21:40:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:40:44] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2024-05-31 21:40:44] [INFO ] Transformed 1126 places.
[2024-05-31 21:40:44] [INFO ] Transformed 1124 transitions.
[2024-05-31 21:40:44] [INFO ] Found NUPN structural information;
[2024-05-31 21:40:44] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 400 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 448 transitions
Trivial Post-agglo rules discarded 448 transitions
Performed 448 trivial Post agglomeration. Transition count delta: 448
Iterating post reduction 0 with 448 rules applied. Total rules applied 448 place count 1126 transition count 676
Reduce places removed 448 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 532 rules applied. Total rules applied 980 place count 678 transition count 592
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 1004 place count 654 transition count 592
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 1004 place count 654 transition count 441
Deduced a syphon composed of 151 places in 13 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 1306 place count 503 transition count 441
Performed 218 Post agglomeration using F-continuation condition.Transition count delta: 218
Deduced a syphon composed of 218 places in 1 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 3 with 436 rules applied. Total rules applied 1742 place count 285 transition count 223
Applied a total of 1742 rules in 181 ms. Remains 285 /1126 variables (removed 841) and now considering 223/1124 (removed 901) transitions.
// Phase 1: matrix 223 rows 285 cols
[2024-05-31 21:40:44] [INFO ] Computed 76 invariants in 21 ms
[2024-05-31 21:40:45] [INFO ] Implicit Places using invariants in 910 ms returned [87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 284]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 966 ms to find 13 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 272/1126 places, 223/1124 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 272 transition count 211
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 260 transition count 211
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 52 place count 246 transition count 197
Applied a total of 52 rules in 22 ms. Remains 246 /272 variables (removed 26) and now considering 197/223 (removed 26) transitions.
// Phase 1: matrix 197 rows 246 cols
[2024-05-31 21:40:45] [INFO ] Computed 63 invariants in 8 ms
[2024-05-31 21:40:46] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-31 21:40:46] [INFO ] Invariant cache hit.
[2024-05-31 21:40:46] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-31 21:40:47] [INFO ] Implicit Places using invariants and state equation in 1343 ms returned []
Implicit Place search using SMT with State Equation took 1870 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 246/1126 places, 197/1124 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 3079 ms. Remains : 246/1126 places, 197/1124 transitions.
Discarding 48 transitions out of 197. Remains 149
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (903 resets) in 2811 ms. (14 steps per ms) remains 42/148 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
[2024-05-31 21:40:49] [INFO ] Invariant cache hit.
[2024-05-31 21:40:49] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 107/178 variables, 29/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 107/207 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-31 21:40:49] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 17 ms to minimize.
[2024-05-31 21:40:50] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 7 ms to minimize.
[2024-05-31 21:40:50] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 2 ms to minimize.
[2024-05-31 21:40:50] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:40:50] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 2 ms to minimize.
[2024-05-31 21:40:50] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 68/246 variables, 34/247 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 68/315 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-31 21:40:51] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
[2024-05-31 21:40:51] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 197/443 variables, 246/563 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 60/623 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/443 variables, and 623 constraints, problems are : Problem set: 0 solved, 42 unsolved in 5015 ms.
Refiners :[Domain max(s): 246/246 constraints, Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 246/246 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 107/178 variables, 29/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 107/207 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-31 21:40:54] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 68/246 variables, 34/248 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 68/316 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-31 21:40:55] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 197/443 variables, 246/565 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 60/625 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 42/667 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/443 variables, and 667 constraints, problems are : Problem set: 0 solved, 42 unsolved in 5009 ms.
Refiners :[Domain max(s): 246/246 constraints, Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 246/246 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 10/10 constraints]
After SMT, in 10099ms problems are : Problem set: 0 solved, 42 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 197/197 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 234 transition count 185
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 234 transition count 185
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 234 transition count 161
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 72 place count 210 transition count 161
Applied a total of 72 rules in 60 ms. Remains 210 /246 variables (removed 36) and now considering 161/197 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 210/246 places, 161/197 transitions.
RANDOM walk for 4000000 steps (75326 resets) in 33114 ms. (120 steps per ms) remains 26/42 properties
BEST_FIRST walk for 400003 steps (844 resets) in 1146 ms. (348 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (834 resets) in 827 ms. (483 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (821 resets) in 803 ms. (497 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (851 resets) in 789 ms. (506 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (828 resets) in 830 ms. (481 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (840 resets) in 781 ms. (511 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (857 resets) in 785 ms. (508 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (835 resets) in 784 ms. (509 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (840 resets) in 881 ms. (453 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (838 resets) in 759 ms. (526 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (835 resets) in 1151 ms. (347 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (828 resets) in 1077 ms. (371 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (851 resets) in 739 ms. (540 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (828 resets) in 812 ms. (492 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (842 resets) in 758 ms. (527 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (838 resets) in 803 ms. (497 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (828 resets) in 841 ms. (475 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (849 resets) in 1132 ms. (353 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (857 resets) in 958 ms. (417 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (841 resets) in 772 ms. (517 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (842 resets) in 778 ms. (513 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (837 resets) in 808 ms. (494 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (848 resets) in 873 ms. (457 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (834 resets) in 1047 ms. (381 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (846 resets) in 1128 ms. (354 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (831 resets) in 732 ms. (545 steps per ms) remains 26/26 properties
// Phase 1: matrix 161 rows 210 cols
[2024-05-31 21:41:13] [INFO ] Computed 63 invariants in 6 ms
[2024-05-31 21:41:13] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 111/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 60/210 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 161/371 variables, 210/273 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 84/357 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/371 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 357 constraints, problems are : Problem set: 0 solved, 26 unsolved in 2203 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 210/210 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 111/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 60/210 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 161/371 variables, 210/273 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 84/357 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 26/383 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 383 constraints, problems are : Problem set: 0 solved, 26 unsolved in 3400 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 210/210 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 5644ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 2335 ms.
Support contains 39 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 161/161 transitions.
Applied a total of 0 rules in 9 ms. Remains 210 /210 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 210/210 places, 161/161 transitions.
RANDOM walk for 4000000 steps (75550 resets) in 30713 ms. (130 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (833 resets) in 772 ms. (517 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (841 resets) in 775 ms. (515 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (827 resets) in 743 ms. (537 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (823 resets) in 742 ms. (538 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (842 resets) in 738 ms. (541 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (826 resets) in 739 ms. (540 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (843 resets) in 737 ms. (542 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (828 resets) in 741 ms. (539 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (845 resets) in 738 ms. (541 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (833 resets) in 739 ms. (540 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (833 resets) in 762 ms. (524 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (814 resets) in 739 ms. (540 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (843 resets) in 735 ms. (543 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (830 resets) in 757 ms. (527 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (813 resets) in 742 ms. (538 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (841 resets) in 744 ms. (536 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (852 resets) in 742 ms. (538 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (827 resets) in 744 ms. (536 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (839 resets) in 742 ms. (538 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (841 resets) in 741 ms. (539 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (830 resets) in 745 ms. (536 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (838 resets) in 747 ms. (534 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (855 resets) in 742 ms. (538 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400004 steps (845 resets) in 733 ms. (544 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (825 resets) in 733 ms. (544 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 3833857 steps, run timeout after 36001 ms. (steps per millisecond=106 ) properties seen :12 out of 25
Probabilistic random walk after 3833857 steps, saw 1024797 distinct states, run finished after 36010 ms. (steps per millisecond=106 ) properties seen :12
[2024-05-31 21:42:10] [INFO ] Invariant cache hit.
[2024-05-31 21:42:10] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 122/148 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 62/210 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 161/371 variables, 210/273 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 84/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/371 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 357 constraints, problems are : Problem set: 0 solved, 13 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 210/210 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 122/148 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 62/210 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 161/371 variables, 210/273 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 84/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 13/370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 370 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1531 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 210/210 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 2403ms problems are : Problem set: 0 solved, 13 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 13 properties in 3 ms. (steps per millisecond=16 )
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 )
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 )
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 )
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 )
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 )
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 13 properties in 19 ms.
Able to resolve query QuasiLiveness after proving 149 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 88988 ms.
ITS solved all properties within timeout

BK_STOP 1717191733230

--------------------
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 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="AutoFlight-PT-12b"
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 AutoFlight-PT-12b, 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 r470-smll-171620175500102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-12b.tgz
mv AutoFlight-PT-12b 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 ;