fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r035-smll-171620175600112
Last Updated
July 7, 2024

About the Execution of ITS-Tools for AutoFlight-PT-24b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3799.707 529352.00 1622030.00 978.60 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r035-smll-171620175600112.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 itstools
Input is AutoFlight-PT-24b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-smll-171620175600112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K 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 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:27 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 13K Apr 12 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Apr 12 22:14 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 538K 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 1716216549016

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-24b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202405141337
[2024-05-20 14:49:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-20 14:49:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:49:12] [INFO ] Load time of PNML (sax parser for PT used): 519 ms
[2024-05-20 14:49:12] [INFO ] Transformed 2230 places.
[2024-05-20 14:49:12] [INFO ] Transformed 2228 transitions.
[2024-05-20 14:49:12] [INFO ] Found NUPN structural information;
[2024-05-20 14:49:12] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 887 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 892 transitions
Trivial Post-agglo rules discarded 892 transitions
Performed 892 trivial Post agglomeration. Transition count delta: 892
Iterating post reduction 0 with 892 rules applied. Total rules applied 892 place count 2230 transition count 1336
Reduce places removed 892 places and 0 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 1060 rules applied. Total rules applied 1952 place count 1338 transition count 1168
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 2000 place count 1290 transition count 1168
Performed 295 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 295 Pre rules applied. Total rules applied 2000 place count 1290 transition count 873
Deduced a syphon composed of 295 places in 26 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 3 with 590 rules applied. Total rules applied 2590 place count 995 transition count 873
Performed 434 Post agglomeration using F-continuation condition.Transition count delta: 434
Deduced a syphon composed of 434 places in 1 ms
Reduce places removed 434 places and 0 transitions.
Iterating global reduction 3 with 868 rules applied. Total rules applied 3458 place count 561 transition count 439
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 3458 rules in 409 ms. Remains 561 /2230 variables (removed 1669) and now considering 439/2228 (removed 1789) transitions.
// Phase 1: matrix 439 rows 561 cols
[2024-05-20 14:49:13] [INFO ] Computed 148 invariants in 43 ms
[2024-05-20 14:49:15] [INFO ] Implicit Places using invariants in 2253 ms returned [171, 174, 177, 180, 183, 186, 189, 192, 195, 198, 201, 204, 207, 210, 213, 216, 219, 222, 225, 228, 231, 234, 237, 240, 560]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 2304 ms to find 25 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 536/2230 places, 439/2228 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 536 transition count 415
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 512 transition count 415
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 100 place count 486 transition count 389
Applied a total of 100 rules in 34 ms. Remains 486 /536 variables (removed 50) and now considering 389/439 (removed 50) transitions.
// Phase 1: matrix 389 rows 486 cols
[2024-05-20 14:49:15] [INFO ] Computed 123 invariants in 7 ms
[2024-05-20 14:49:16] [INFO ] Implicit Places using invariants in 890 ms returned []
[2024-05-20 14:49:16] [INFO ] Invariant cache hit.
[2024-05-20 14:49:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-20 14:49:20] [INFO ] Implicit Places using invariants and state equation in 4090 ms returned []
Implicit Place search using SMT with State Equation took 4985 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 486/2230 places, 389/2228 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 7763 ms. Remains : 486/2230 places, 389/2228 transitions.
Discarding 96 transitions out of 389. Remains 293
Initial state reduction rules removed 1 formulas.
[2024-05-20 14:49:21] [INFO ] Flatten gal took : 250 ms
[2024-05-20 14:49:21] [INFO ] Flatten gal took : 127 ms
[2024-05-20 14:49:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14645792404759789207.gal : 53 ms
[2024-05-20 14:49:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5160954636745874377.prop : 24 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14645792404759789207.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5160954636745874377.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5160954636745874377.prop.
Reachability property qltransition_146 is true.
Reachability property qltransition_144 is true.
Reachability property qltransition_142 is true.
Reachability property qltransition_140 is true.
Reachability property qltransition_138 is true.
Reachability property qltransition_136 is true.
Reachability property qltransition_134 is true.
Reachability property qltransition_132 is true.
Reachability property qltransition_130 is true.
Reachability property qltransition_128 is true.
Reachability property qltransition_127 is true.
Reachability property qltransition_124 is true.
Reachability property qltransition_122 is true.
Reachability property qltransition_120 is true.
Reachability property qltransition_118 is true.
Reachability property qltransition_116 is true.
Reachability property qltransition_114 is true.
Reachability property qltransition_112 is true.
Reachability property qltransition_110 is true.
Reachability property qltransition_108 is true.
Reachability property qltransition_106 is true.
Reachability property qltransition_104 is true.
Reachability property qltransition_102 is true.
Reachability property qltransition_100 is true.
Reachability property qltransition_98 is true.
Reachability property qltransition_96 is true.
SDD proceeding with computation,266 properties remain. new max is 2
SDD size :1 after 28
RANDOM walk for 40000 steps (499 resets) in 7989 ms. (5 steps per ms) remains 119/292 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
SDD proceeding with computation,266 properties remain. new max is 4
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
SDD size :28 after 730
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 14 ms. (26 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 119/119 properties
[2024-05-20 14:49:22] [INFO ] Invariant cache hit.
[2024-05-20 14:49:23] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,266 properties remain. new max is 8
SDD size :730 after 177148
SDD proceeding with computation,266 properties remain. new max is 16
SDD size :177148 after 3.8742e+08
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 180/386 variables, 73/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
SDD proceeding with computation,266 properties remain. new max is 32
SDD size :3.8742e+08 after 1.44604e+14
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 180/459 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-20 14:49:26] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 22 ms to minimize.
[2024-05-20 14:49:26] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-20 14:49:26] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-05-20 14:49:26] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-20 14:49:26] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-05-20 14:49:26] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-20 14:49:26] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2024-05-20 14:49:26] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-05-20 14:49:26] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-05-20 14:49:27] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/875 variables, and 469 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5022 ms.
Refiners :[Domain max(s): 386/486 constraints, Positive P Invariants (semi-flows): 73/123 constraints, State Equation: 0/486 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 180/386 variables, 73/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 180/459 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 10/469 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-20 14:49:29] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 100/486 variables, 50/520 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 100/620 constraints. Problems are: Problem set: 0 solved, 119 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 Int declared 486/875 variables, and 620 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5022 ms.
Refiners :[Domain max(s): 486/486 constraints, Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 0/486 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/119 constraints, Known Traps: 11/11 constraints]
After SMT, in 10211ms problems are : Problem set: 0 solved, 119 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 206 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 389/389 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 469 transition count 372
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 469 transition count 372
Free-agglomeration rule applied 46 times.
Iterating global reduction 0 with 46 rules applied. Total rules applied 80 place count 469 transition count 326
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 126 place count 423 transition count 326
Applied a total of 126 rules in 106 ms. Remains 423 /486 variables (removed 63) and now considering 326/389 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 423/486 places, 326/389 transitions.
RANDOM walk for 4000000 steps (60730 resets) in 81960 ms. (48 steps per ms) remains 67/119 properties
BEST_FIRST walk for 400004 steps (252 resets) in 2458 ms. (162 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (250 resets) in 1860 ms. (214 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (367 resets) in 1719 ms. (232 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (366 resets) in 1789 ms. (223 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (370 resets) in 2201 ms. (181 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (342 resets) in 1679 ms. (238 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (374 resets) in 1931 ms. (207 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (350 resets) in 1909 ms. (209 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (368 resets) in 1621 ms. (246 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (348 resets) in 2016 ms. (198 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (376 resets) in 1711 ms. (233 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (341 resets) in 1783 ms. (224 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (375 resets) in 1898 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (346 resets) in 1634 ms. (244 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (370 resets) in 1763 ms. (226 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1569 ms. (254 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (371 resets) in 1712 ms. (233 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (342 resets) in 1593 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (366 resets) in 1648 ms. (242 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (347 resets) in 1561 ms. (256 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (373 resets) in 1484 ms. (269 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (349 resets) in 1538 ms. (259 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (367 resets) in 1718 ms. (232 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (347 resets) in 1650 ms. (242 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (369 resets) in 1610 ms. (248 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (343 resets) in 1672 ms. (239 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (375 resets) in 1597 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (350 resets) in 1915 ms. (208 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (377 resets) in 1632 ms. (244 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (344 resets) in 1608 ms. (248 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (374 resets) in 1989 ms. (201 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (351 resets) in 1975 ms. (202 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (368 resets) in 1895 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (347 resets) in 1645 ms. (243 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (344 resets) in 1811 ms. (220 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (351 resets) in 1718 ms. (232 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (343 resets) in 1712 ms. (233 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (345 resets) in 1925 ms. (207 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (348 resets) in 1613 ms. (247 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (347 resets) in 1684 ms. (237 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (336 resets) in 1617 ms. (247 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (343 resets) in 1708 ms. (234 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (347 resets) in 1569 ms. (254 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (344 resets) in 2008 ms. (199 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1603 ms. (249 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (340 resets) in 1962 ms. (203 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (346 resets) in 1602 ms. (249 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (346 resets) in 1727 ms. (231 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (352 resets) in 1654 ms. (241 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (343 resets) in 1904 ms. (209 steps per ms) remains 67/67 properties
// Phase 1: matrix 326 rows 423 cols
[2024-05-20 14:50:23] [INFO ] Computed 123 invariants in 5 ms
[2024-05-20 14:50:23] [INFO ] State equation strengthened by 166 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 185/294 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 129/423 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-20 14:50:25] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 4 ms to minimize.
[2024-05-20 14:50:25] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 3 ms to minimize.
[2024-05-20 14:50:26] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 326/749 variables, 423/549 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 166/715 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/749 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 67 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/749 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/749 variables, and 715 constraints, problems are : Problem set: 0 solved, 67 unsolved in 14800 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 423/423 constraints, ReadFeed: 166/166 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 185/294 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 129/423 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-20 14:50:39] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-05-20 14:50:39] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 3 ms to minimize.
[2024-05-20 14:50:39] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 326/749 variables, 423/552 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/749 variables, 166/718 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/749 variables, 67/785 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/749 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (OVERLAPS) 0/749 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
SDD proceeding with computation,266 properties remain. new max is 64
SDD size :1.44604e+14 after 3.79071e+19
Reachability property qltransition_370 is true.
After SMT solving in domain Int declared 749/749 variables, and 785 constraints, problems are : Problem set: 0 solved, 67 unsolved in 23739 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 423/423 constraints, ReadFeed: 166/166 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 6/6 constraints]
After SMT, in 38610ms problems are : Problem set: 0 solved, 67 unsolved
Fused 67 Parikh solutions to 66 different solutions.
Reachability property qltransition_332 is true.
Reachability property qltransition_329 is true.
Reachability property qltransition_328 is true.
Reachability property qltransition_326 is true.
Reachability property qltransition_323 is true.
Reachability property qltransition_322 is true.
Reachability property qltransition_320 is true.
Reachability property qltransition_318 is true.
Reachability property qltransition_316 is true.
Reachability property qltransition_183 is true.
Parikh walk visited 9 properties in 17287 ms.
Support contains 91 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 326/326 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 416 transition count 319
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 416 transition count 319
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 416 transition count 317
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 414 transition count 317
Applied a total of 18 rules in 59 ms. Remains 414 /423 variables (removed 9) and now considering 317/326 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 414/423 places, 317/326 transitions.
SDD proceeding with computation,255 properties remain. new max is 64
SDD size :3.79071e+19 after 7.67767e+20
SDD proceeding with computation,255 properties remain. new max is 128
SDD size :7.67767e+20 after 7.67767e+20
SDD proceeding with computation,255 properties remain. new max is 256
SDD size :7.67767e+20 after 7.67769e+20
SDD proceeding with computation,255 properties remain. new max is 512
SDD size :7.67769e+20 after 7.67772e+20
SDD proceeding with computation,255 properties remain. new max is 1024
SDD size :7.67772e+20 after 7.67778e+20
SDD proceeding with computation,255 properties remain. new max is 2048
SDD size :7.67778e+20 after 7.67791e+20
SDD proceeding with computation,255 properties remain. new max is 4096
SDD size :7.67791e+20 after 7.67815e+20
SDD proceeding with computation,255 properties remain. new max is 8192
SDD size :7.67815e+20 after 7.67865e+20
SDD proceeding with computation,255 properties remain. new max is 16384
SDD size :7.67865e+20 after 7.67914e+20
Reachability property qltransition_369 is true.
Reachability property qltransition_176 is true.
SDD proceeding with computation,253 properties remain. new max is 16384
SDD size :7.67914e+20 after 7.79506e+20
RANDOM walk for 4000000 steps (39597 resets) in 67805 ms. (58 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (245 resets) in 1811 ms. (220 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (236 resets) in 1875 ms. (213 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (333 resets) in 2128 ms. (187 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (282 resets) in 1597 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (333 resets) in 1997 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (279 resets) in 1745 ms. (229 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (284 resets) in 2332 ms. (171 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (326 resets) in 2446 ms. (163 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (287 resets) in 1556 ms. (256 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (284 resets) in 1515 ms. (263 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (332 resets) in 1748 ms. (228 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (282 resets) in 1867 ms. (214 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (289 resets) in 1489 ms. (268 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (326 resets) in 2165 ms. (184 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (282 resets) in 1670 ms. (239 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (284 resets) in 1590 ms. (251 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (329 resets) in 1864 ms. (214 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (290 resets) in 1682 ms. (237 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (291 resets) in 1791 ms. (223 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (336 resets) in 2270 ms. (176 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (298 resets) in 1839 ms. (217 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (298 resets) in 1631 ms. (245 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (338 resets) in 2096 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (288 resets) in 1644 ms. (243 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (283 resets) in 1613 ms. (247 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (284 resets) in 1456 ms. (274 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (282 resets) in 1491 ms. (268 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (295 resets) in 1694 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (288 resets) in 1547 ms. (258 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (280 resets) in 1608 ms. (248 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (294 resets) in 1871 ms. (213 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (294 resets) in 2160 ms. (185 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (284 resets) in 1917 ms. (208 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (283 resets) in 1530 ms. (261 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (292 resets) in 1737 ms. (230 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (282 resets) in 1746 ms. (228 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (291 resets) in 1546 ms. (258 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (279 resets) in 2119 ms. (188 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (301 resets) in 1623 ms. (246 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (288 resets) in 1578 ms. (253 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (295 resets) in 2321 ms. (172 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (291 resets) in 1586 ms. (252 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (292 resets) in 1578 ms. (253 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (298 resets) in 1438 ms. (277 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (293 resets) in 2199 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (293 resets) in 1552 ms. (257 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (284 resets) in 1588 ms. (251 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (278 resets) in 2000 ms. (199 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (286 resets) in 1603 ms. (249 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (292 resets) in 1631 ms. (245 steps per ms) remains 58/58 properties
SDD proceeding with computation,253 properties remain. new max is 32768
SDD size :7.79506e+20 after 7.79533e+20
SDD proceeding with computation,253 properties remain. new max is 65536
SDD size :7.79533e+20 after 7.8013e+20
Reachability property qltransition_368 is true.
Reachability property qltransition_367 is true.
Reachability property qltransition_169 is true.
Reachability property qltransition_162 is true.
SDD proceeding with computation,249 properties remain. new max is 65536
SDD size :7.8013e+20 after 1.04779e+21
Reachability property qltransition_365 is true.
Reachability property qltransition_150 is true.
SDD proceeding with computation,247 properties remain. new max is 65536
SDD size :1.04779e+21 after 1.1153e+21
Interrupted probabilistic random walk after 7155161 steps, run timeout after 135001 ms. (steps per millisecond=53 ) properties seen :25 out of 58
Probabilistic random walk after 7155161 steps, saw 2282910 distinct states, run finished after 135026 ms. (steps per millisecond=52 ) properties seen :25
// Phase 1: matrix 317 rows 414 cols
[2024-05-20 14:54:20] [INFO ] Computed 123 invariants in 3 ms
[2024-05-20 14:54:20] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 226/292 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 122/414 variables, 97/123 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 317/731 variables, 414/537 constraints. Problems are: Problem set: 0 solved, 33 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 168/705 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/731 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 731/731 variables, and 705 constraints, problems are : Problem set: 0 solved, 33 unsolved in 3076 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 414/414 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 226/292 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 122/414 variables, 97/123 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 317/731 variables, 414/537 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 168/705 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 33/738 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/731 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/731 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 731/731 variables, and 738 constraints, problems are : Problem set: 0 solved, 33 unsolved in 10254 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 414/414 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 13361ms problems are : Problem set: 0 solved, 33 unsolved
SDD proceeding with computation,247 properties remain. new max is 131072
SDD size :1.1153e+21 after 1.11531e+21
Parikh walk visited 24 properties in 28113 ms.
Support contains 18 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 317/317 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 413 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 413 transition count 316
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 34 place count 413 transition count 284
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 66 place count 381 transition count 284
Applied a total of 66 rules in 85 ms. Remains 381 /414 variables (removed 33) and now considering 284/317 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 381/414 places, 284/317 transitions.
RANDOM walk for 4000000 steps (39682 resets) in 35006 ms. (114 steps per ms) remains 9/9 properties
Reachability property qltransition_366 is true.
BEST_FIRST walk for 4000004 steps (5519 resets) in 15677 ms. (255 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (4876 resets) in 14541 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000002 steps (4916 resets) in 14122 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (4964 resets) in 13904 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (4933 resets) in 14360 ms. (278 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (4965 resets) in 13998 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (4921 resets) in 14475 ms. (276 steps per ms) remains 9/9 properties
Reachability property qltransition_155 is true.
SDD proceeding with computation,245 properties remain. new max is 131072
SDD size :1.11531e+21 after 1.24968e+21
BEST_FIRST walk for 4000001 steps (4967 resets) in 14079 ms. (284 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000003 steps (4861 resets) in 14122 ms. (283 steps per ms) remains 8/8 properties
// Phase 1: matrix 284 rows 381 cols
[2024-05-20 14:55:48] [INFO ] Computed 123 invariants in 3 ms
[2024-05-20 14:55:48] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 225/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 140/381 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 284/665 variables, 381/504 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 200/704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/665 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 704 constraints, problems are : Problem set: 0 solved, 8 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 381/381 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 225/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 140/381 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 284/665 variables, 381/504 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 200/704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 8/712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/665 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 712 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1511 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 381/381 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 2478ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 5229 ms.
Support contains 16 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 284/284 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 381 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 379 transition count 282
Applied a total of 4 rules in 32 ms. Remains 379 /381 variables (removed 2) and now considering 282/284 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 379/381 places, 282/284 transitions.
RANDOM walk for 4000000 steps (39372 resets) in 34759 ms. (115 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (5874 resets) in 15644 ms. (255 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (5059 resets) in 13789 ms. (290 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (5025 resets) in 14844 ms. (269 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (5020 resets) in 13801 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (5104 resets) in 13853 ms. (288 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (5020 resets) in 14144 ms. (282 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (5030 resets) in 14070 ms. (284 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4000004 steps (5020 resets) in 14352 ms. (278 steps per ms) remains 7/7 properties
// Phase 1: matrix 282 rows 379 cols
[2024-05-20 14:56:37] [INFO ] Computed 123 invariants in 2 ms
[2024-05-20 14:56:37] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 224/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 141/379 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 282/661 variables, 379/502 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 202/704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/661 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 704 constraints, problems are : Problem set: 0 solved, 7 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 379/379 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 224/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 141/379 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 282/661 variables, 379/502 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 202/704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 7/711 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/661 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 711 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1306 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 379/379 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 2262ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 4646 ms.
Support contains 14 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 282/282 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 377 transition count 280
Applied a total of 4 rules in 29 ms. Remains 377 /379 variables (removed 2) and now considering 280/282 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 377/379 places, 280/282 transitions.
RANDOM walk for 4000000 steps (39541 resets) in 31899 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (6245 resets) in 15354 ms. (260 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (5156 resets) in 13674 ms. (292 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (5152 resets) in 14063 ms. (284 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (5023 resets) in 13445 ms. (297 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (5219 resets) in 13582 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (5133 resets) in 13511 ms. (296 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000004 steps (5064 resets) in 13419 ms. (298 steps per ms) remains 6/6 properties
// Phase 1: matrix 280 rows 377 cols
[2024-05-20 14:57:19] [INFO ] Computed 123 invariants in 19 ms
[2024-05-20 14:57:19] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 223/235 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 142/377 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 280/657 variables, 377/500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 204/704 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/657 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/657 variables, and 704 constraints, problems are : Problem set: 0 solved, 6 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 377/377 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 223/235 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 142/377 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 280/657 variables, 377/500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 204/704 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 6/710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/657 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 657/657 variables, and 710 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1369 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 377/377 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2208ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 4607 ms.
Support contains 12 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 280/280 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 377 transition count 278
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 375 transition count 278
Applied a total of 4 rules in 25 ms. Remains 375 /377 variables (removed 2) and now considering 278/280 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 375/377 places, 278/280 transitions.
RANDOM walk for 4000000 steps (39408 resets) in 28838 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (6655 resets) in 15835 ms. (252 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000001 steps (5225 resets) in 13579 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (5223 resets) in 13870 ms. (288 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (5348 resets) in 13612 ms. (293 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (5224 resets) in 13293 ms. (300 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000004 steps (5263 resets) in 13229 ms. (302 steps per ms) remains 5/5 properties
// Phase 1: matrix 278 rows 375 cols
[2024-05-20 14:57:56] [INFO ] Computed 123 invariants in 1 ms
[2024-05-20 14:57:56] [INFO ] State equation strengthened by 206 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 222/232 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 143/375 variables, 117/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 278/653 variables, 375/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 206/704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/653 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 653/653 variables, and 704 constraints, problems are : Problem set: 0 solved, 5 unsolved in 896 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 375/375 constraints, ReadFeed: 206/206 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 222/232 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 143/375 variables, 117/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 278/653 variables, 375/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 206/704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 5/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/653 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/653 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 653/653 variables, and 709 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1113 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 375/375 constraints, ReadFeed: 206/206 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2025ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 95 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=19 )
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 5 properties in 14 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 293 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 526584 ms.

BK_STOP 1716217078368

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-24b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
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 itstools"
echo " Input is AutoFlight-PT-24b, 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 r035-smll-171620175600112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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