fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r233-tall-167856419400781
Last Updated
May 14, 2023

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S16C06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
856.268 166813.00 191694.00 678.50 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856419400781.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400781
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 13K Feb 26 03:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 03:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 03:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.2M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679611470088

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 22:44:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 22:44:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 22:44:31] [INFO ] Load time of PNML (sax parser for PT used): 288 ms
[2023-03-23 22:44:31] [INFO ] Transformed 5568 places.
[2023-03-23 22:44:31] [INFO ] Transformed 7799 transitions.
[2023-03-23 22:44:31] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 489 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Normalized transition count is 7527 out of 7799 initially.
// Phase 1: matrix 7527 rows 5568 cols
[2023-03-23 22:44:32] [INFO ] Computed 573 place invariants in 357 ms
Incomplete random walk after 10000 steps, including 159 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 16) seen :11
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :4
[2023-03-23 22:44:33] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2023-03-23 22:44:33] [INFO ] Computed 573 place invariants in 224 ms
[2023-03-23 22:44:34] [INFO ] [Real]Absence check using 50 positive place invariants in 77 ms returned sat
[2023-03-23 22:44:34] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 123 ms returned unsat
[2023-03-23 22:44:34] [INFO ] [Real]Absence check using 50 positive place invariants in 67 ms returned sat
[2023-03-23 22:44:35] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 204 ms returned sat
[2023-03-23 22:44:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 22:44:39] [INFO ] [Real]Absence check using state equation in 4279 ms returned unknown
[2023-03-23 22:44:39] [INFO ] [Real]Absence check using 50 positive place invariants in 70 ms returned sat
[2023-03-23 22:44:40] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 193 ms returned sat
[2023-03-23 22:44:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 22:44:44] [INFO ] [Real]Absence check using state equation in 4298 ms returned unknown
[2023-03-23 22:44:44] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2023-03-23 22:44:45] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 120 ms returned unsat
[2023-03-23 22:44:45] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2023-03-23 22:44:45] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 185 ms returned unsat
[2023-03-23 22:44:46] [INFO ] [Real]Absence check using 50 positive place invariants in 64 ms returned sat
[2023-03-23 22:44:46] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 129 ms returned unsat
[2023-03-23 22:44:46] [INFO ] [Real]Absence check using 50 positive place invariants in 64 ms returned sat
[2023-03-23 22:44:47] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 132 ms returned unsat
[2023-03-23 22:44:47] [INFO ] [Real]Absence check using 50 positive place invariants in 65 ms returned sat
[2023-03-23 22:44:47] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 202 ms returned sat
[2023-03-23 22:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 22:44:52] [INFO ] [Real]Absence check using state equation in 4268 ms returned unknown
[2023-03-23 22:44:52] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2023-03-23 22:44:52] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 223 ms returned sat
[2023-03-23 22:44:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 22:44:57] [INFO ] [Real]Absence check using state equation in 4247 ms returned unknown
[2023-03-23 22:44:57] [INFO ] [Real]Absence check using 50 positive place invariants in 60 ms returned sat
[2023-03-23 22:44:57] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 121 ms returned unsat
[2023-03-23 22:44:58] [INFO ] [Real]Absence check using 50 positive place invariants in 72 ms returned sat
[2023-03-23 22:44:58] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 118 ms returned unsat
[2023-03-23 22:44:59] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2023-03-23 22:44:59] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 123 ms returned unsat
[2023-03-23 22:44:59] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2023-03-23 22:44:59] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 119 ms returned unsat
[2023-03-23 22:45:00] [INFO ] [Real]Absence check using 50 positive place invariants in 69 ms returned sat
[2023-03-23 22:45:00] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 115 ms returned unsat
[2023-03-23 22:45:00] [INFO ] [Real]Absence check using 50 positive place invariants in 60 ms returned sat
[2023-03-23 22:45:01] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 122 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 51, 17, 1, 1, 1, 1, 17, 51, 1, 1, 1, 1, 1, 1] Max seen :[1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 5568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5536 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.19 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 1628 transitions
Trivial Post-agglo rules discarded 1628 transitions
Performed 1628 trivial Post agglomeration. Transition count delta: 1628
Iterating post reduction 0 with 1628 rules applied. Total rules applied 1629 place count 5536 transition count 6171
Reduce places removed 1628 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1630 rules applied. Total rules applied 3259 place count 3908 transition count 6169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 3261 place count 3906 transition count 6169
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 3261 place count 3906 transition count 5965
Deduced a syphon composed of 204 places in 8 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 3669 place count 3702 transition count 5965
Discarding 1424 places :
Symmetric choice reduction at 3 with 1424 rule applications. Total rules 5093 place count 2278 transition count 4541
Iterating global reduction 3 with 1424 rules applied. Total rules applied 6517 place count 2278 transition count 4541
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 6517 place count 2278 transition count 4532
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 6535 place count 2269 transition count 4532
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 6769 place count 2035 transition count 3128
Iterating global reduction 3 with 234 rules applied. Total rules applied 7003 place count 2035 transition count 3128
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 7037 place count 2018 transition count 3111
Free-agglomeration rule (complex) applied 164 times.
Iterating global reduction 3 with 164 rules applied. Total rules applied 7201 place count 2018 transition count 4117
Reduce places removed 164 places and 0 transitions.
Iterating post reduction 3 with 164 rules applied. Total rules applied 7365 place count 1854 transition count 4117
Partial Free-agglomeration rule applied 51 times.
Drop transitions removed 51 transitions
Iterating global reduction 4 with 51 rules applied. Total rules applied 7416 place count 1854 transition count 4117
Applied a total of 7416 rules in 2160 ms. Remains 1854 /5568 variables (removed 3714) and now considering 4117/7799 (removed 3682) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2162 ms. Remains : 1854/5568 places, 4117/7799 transitions.
Normalized transition count is 3719 out of 4117 initially.
// Phase 1: matrix 3719 rows 1854 cols
[2023-03-23 22:45:03] [INFO ] Computed 541 place invariants in 47 ms
Incomplete random walk after 1000000 steps, including 26661 resets, run finished after 16549 ms. (steps per millisecond=60 ) properties (out of 4) seen :3
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 4866 resets, run finished after 3553 ms. (steps per millisecond=281 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4866 resets, run finished after 3488 ms. (steps per millisecond=286 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4866 resets, run finished after 3509 ms. (steps per millisecond=284 ) properties (out of 3) seen :0
[2023-03-23 22:45:30] [INFO ] Flow matrix only has 3719 transitions (discarded 398 similar events)
// Phase 1: matrix 3719 rows 1854 cols
[2023-03-23 22:45:30] [INFO ] Computed 541 place invariants in 47 ms
[2023-03-23 22:45:30] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-23 22:45:30] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 37 ms returned unsat
[2023-03-23 22:45:30] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-23 22:45:31] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 103 ms returned sat
[2023-03-23 22:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 22:45:32] [INFO ] [Real]Absence check using state equation in 1145 ms returned sat
[2023-03-23 22:45:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 22:45:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-23 22:45:32] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 87 ms returned sat
[2023-03-23 22:45:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 22:45:33] [INFO ] [Nat]Absence check using state equation in 1046 ms returned sat
[2023-03-23 22:45:33] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:45:34] [INFO ] [Nat]Added 2178 Read/Feed constraints in 589 ms returned sat
[2023-03-23 22:45:35] [INFO ] Deduced a trap composed of 276 places in 1362 ms of which 6 ms to minimize.
[2023-03-23 22:45:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1834 ms
[2023-03-23 22:45:36] [INFO ] Computed and/alt/rep : 1614/3894/1614 causal constraints (skipped 2088 transitions) in 323 ms.
[2023-03-23 22:45:37] [INFO ] Added : 14 causal constraints over 3 iterations in 1134 ms. Result :sat
[2023-03-23 22:45:37] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2023-03-23 22:45:37] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[1, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 1854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1854/1854 places, 4117/4117 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1854 transition count 4116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1853 transition count 4116
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1853 transition count 4114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 1851 transition count 4114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 1849 transition count 4112
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 1849 transition count 4112
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 1849 transition count 4112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 1848 transition count 4111
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 1848 transition count 4111
Applied a total of 13 rules in 482 ms. Remains 1848 /1854 variables (removed 6) and now considering 4111/4117 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 482 ms. Remains : 1848/1854 places, 4111/4117 transitions.
Normalized transition count is 3713 out of 4111 initially.
// Phase 1: matrix 3713 rows 1848 cols
[2023-03-23 22:45:38] [INFO ] Computed 541 place invariants in 59 ms
Incomplete random walk after 1000000 steps, including 26663 resets, run finished after 15818 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4866 resets, run finished after 3535 ms. (steps per millisecond=282 ) properties (out of 1) seen :0
[2023-03-23 22:45:57] [INFO ] Flow matrix only has 3713 transitions (discarded 398 similar events)
// Phase 1: matrix 3713 rows 1848 cols
[2023-03-23 22:45:57] [INFO ] Computed 541 place invariants in 45 ms
[2023-03-23 22:45:57] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2023-03-23 22:45:57] [INFO ] [Real]Absence check using 31 positive and 510 generalized place invariants in 94 ms returned sat
[2023-03-23 22:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 22:45:59] [INFO ] [Real]Absence check using state equation in 1160 ms returned sat
[2023-03-23 22:45:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 22:45:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 28 ms returned sat
[2023-03-23 22:45:59] [INFO ] [Nat]Absence check using 31 positive and 510 generalized place invariants in 97 ms returned sat
[2023-03-23 22:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 22:46:00] [INFO ] [Nat]Absence check using state equation in 1228 ms returned sat
[2023-03-23 22:46:00] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:46:01] [INFO ] [Nat]Added 2178 Read/Feed constraints in 303 ms returned sat
[2023-03-23 22:46:02] [INFO ] Deduced a trap composed of 284 places in 1348 ms of which 3 ms to minimize.
[2023-03-23 22:46:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1678 ms
[2023-03-23 22:46:03] [INFO ] Computed and/alt/rep : 1610/3887/1610 causal constraints (skipped 2086 transitions) in 294 ms.
[2023-03-23 22:46:03] [INFO ] Added : 14 causal constraints over 3 iterations in 1069 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1848/1848 places, 4111/4111 transitions.
Applied a total of 0 rules in 125 ms. Remains 1848 /1848 variables (removed 0) and now considering 4111/4111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 1848/1848 places, 4111/4111 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1848/1848 places, 4111/4111 transitions.
Applied a total of 0 rules in 118 ms. Remains 1848 /1848 variables (removed 0) and now considering 4111/4111 (removed 0) transitions.
[2023-03-23 22:46:04] [INFO ] Flow matrix only has 3713 transitions (discarded 398 similar events)
[2023-03-23 22:46:04] [INFO ] Invariant cache hit.
[2023-03-23 22:46:08] [INFO ] Implicit Places using invariants in 4039 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 84, 98, 99, 100, 101, 102, 103, 104, 116, 126, 134, 140, 144, 146, 161, 167, 169, 170, 171, 172, 173, 174, 175, 177, 181, 187, 195, 205, 217, 230, 242, 243, 244, 245, 246, 247, 248, 258, 266, 272, 276, 278, 280, 295, 301, 303, 304, 305, 306, 307, 308, 309, 311, 313, 317, 323, 331, 341, 352, 362, 363, 364, 365, 366, 367, 368, 376, 382, 386, 388, 390, 392, 407, 413, 415, 416, 417, 418, 419, 420, 421, 423, 425, 427, 431, 437, 445, 454, 462, 463, 464, 465, 466, 467, 468, 474, 478, 480, 482, 484, 486, 501, 507, 509, 510, 511, 512, 513, 514, 515, 517, 519, 521, 523, 527, 533, 540, 546, 547, 548, 549, 550, 551, 552, 556, 558, 560, 562, 564, 566, 581, 587, 589, 590, 591, 592, 593, 594, 595, 597, 599, 601, 603, 605, 609, 614, 618, 619, 620, 621, 622, 623, 624, 626, 628, 630, 632, 634, 636, 651, 657, 659, 660, 661, 662, 663, 665, 667, 669, 671, 673, 675, 677, 682, 684, 685, 686, 687, 688, 689, 690, 692, 694, 696, 698, 700, 702, 717, 723, 725, 726, 727, 728, 729, 730, 731, 733, 735, 737, 739, 741, 743, 745, 747, 748, 749, 750, 751, 752, 753, 755, 757, 759, 761, 763, 765, 780, 782, 785, 787, 788, 789, 790, 791, 792, 793, 795, 797, 799, 801, 803, 805, 807, 809, 810, 811, 812, 813, 814, 815, 817, 819, 821, 823, 825, 827, 842, 848, 850, 851, 852, 853, 854, 855, 856, 858, 860, 862, 864, 866, 868, 870, 872, 873, 874, 875, 876, 877, 878, 880, 882, 884, 886, 888, 890, 905, 911, 913, 914, 915, 916, 917, 918, 919, 921, 923, 925, 927, 929, 931, 933, 936, 937, 938, 939, 940, 941, 942, 944, 946, 948, 950, 952, 954, 969, 975, 977, 978, 979, 980, 981, 982, 983, 985, 987, 989, 991, 993, 995, 999, 1004, 1005, 1006, 1007, 1008, 1009, 1010, 1014, 1016, 1018, 1020, 1022, 1024, 1039, 1045, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1055, 1057, 1059, 1061, 1063, 1067, 1073, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1092, 1096, 1098, 1100, 1102, 1104, 1119, 1125, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1135, 1137, 1139, 1141, 1145, 1151, 1159, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1182, 1188, 1192, 1194, 1196, 1198, 1213, 1219, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1229, 1231, 1233, 1237, 1243, 1251, 1261, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1288, 1296, 1302, 1306, 1308, 1310, 1325, 1331, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1341, 1343, 1347, 1353, 1361, 1371, 1383, 1396, 1397, 1398, 1399, 1400, 1401, 1402, 1414, 1424, 1432, 1438, 1442, 1444, 1459, 1461, 1464, 1466, 1467, 1468, 1469, 1470, 1471, 1472, 1474, 1478, 1484, 1492, 1502, 1514, 1528, 1543, 1544, 1545, 1546, 1547, 1548, 1549, 1563, 1575, 1585, 1593, 1599, 1603, 1618]
Discarding 495 places :
Implicit Place search using SMT only with invariants took 4053 ms to find 495 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1353/1848 places, 4111/4111 transitions.
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 191 place count 1162 transition count 3920
Iterating global reduction 0 with 191 rules applied. Total rules applied 382 place count 1162 transition count 3920
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 573 place count 971 transition count 3729
Iterating global reduction 0 with 191 rules applied. Total rules applied 764 place count 971 transition count 3729
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 767 place count 971 transition count 3726
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 770 place count 968 transition count 3726
Applied a total of 770 rules in 247 ms. Remains 968 /1353 variables (removed 385) and now considering 3726/4111 (removed 385) transitions.
[2023-03-23 22:46:08] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
// Phase 1: matrix 3328 rows 968 cols
[2023-03-23 22:46:08] [INFO ] Computed 46 place invariants in 24 ms
[2023-03-23 22:46:09] [INFO ] Implicit Places using invariants in 1049 ms returned []
[2023-03-23 22:46:09] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
[2023-03-23 22:46:09] [INFO ] Invariant cache hit.
[2023-03-23 22:46:10] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:46:28] [INFO ] Implicit Places using invariants and state equation in 19177 ms returned []
Implicit Place search using SMT with State Equation took 20233 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 968/1848 places, 3726/4111 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24653 ms. Remains : 968/1848 places, 3726/4111 transitions.
Normalized transition count is 3328 out of 3726 initially.
// Phase 1: matrix 3328 rows 968 cols
[2023-03-23 22:46:28] [INFO ] Computed 46 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 28280 resets, run finished after 15414 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3588 resets, run finished after 2572 ms. (steps per millisecond=388 ) properties (out of 1) seen :0
[2023-03-23 22:46:46] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
// Phase 1: matrix 3328 rows 968 cols
[2023-03-23 22:46:46] [INFO ] Computed 46 place invariants in 26 ms
[2023-03-23 22:46:47] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 22:46:47] [INFO ] [Real]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 22:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 22:46:47] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2023-03-23 22:46:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 22:46:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 22:46:47] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 22:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 22:46:48] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2023-03-23 22:46:48] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:46:49] [INFO ] [Nat]Added 2178 Read/Feed constraints in 491 ms returned sat
[2023-03-23 22:46:49] [INFO ] Deduced a trap composed of 113 places in 455 ms of which 1 ms to minimize.
[2023-03-23 22:46:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 695 ms
[2023-03-23 22:46:50] [INFO ] Computed and/alt/rep : 1339/1942/1339 causal constraints (skipped 1927 transitions) in 194 ms.
[2023-03-23 22:46:50] [INFO ] Added : 11 causal constraints over 3 iterations in 734 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 3726/3726 transitions.
Applied a total of 0 rules in 93 ms. Remains 968 /968 variables (removed 0) and now considering 3726/3726 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 968/968 places, 3726/3726 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 3726/3726 transitions.
Applied a total of 0 rules in 96 ms. Remains 968 /968 variables (removed 0) and now considering 3726/3726 (removed 0) transitions.
[2023-03-23 22:46:50] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
[2023-03-23 22:46:50] [INFO ] Invariant cache hit.
[2023-03-23 22:46:51] [INFO ] Implicit Places using invariants in 1012 ms returned []
[2023-03-23 22:46:51] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
[2023-03-23 22:46:51] [INFO ] Invariant cache hit.
[2023-03-23 22:46:52] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:47:09] [INFO ] Implicit Places using invariants and state equation in 17985 ms returned []
Implicit Place search using SMT with State Equation took 19000 ms to find 0 implicit places.
[2023-03-23 22:47:10] [INFO ] Redundant transitions in 257 ms returned []
[2023-03-23 22:47:10] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
[2023-03-23 22:47:10] [INFO ] Invariant cache hit.
[2023-03-23 22:47:11] [INFO ] Dead Transitions using invariants and state equation in 1252 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20621 ms. Remains : 968/968 places, 3726/3726 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-07
Normalized transition count is 3328 out of 3726 initially.
// Phase 1: matrix 3328 rows 968 cols
[2023-03-23 22:47:11] [INFO ] Computed 46 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 282 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2023-03-23 22:47:11] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
// Phase 1: matrix 3328 rows 968 cols
[2023-03-23 22:47:11] [INFO ] Computed 46 place invariants in 26 ms
[2023-03-23 22:47:11] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 22:47:11] [INFO ] [Real]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 22:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 22:47:12] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2023-03-23 22:47:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 22:47:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 22:47:12] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-23 22:47:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 22:47:13] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2023-03-23 22:47:13] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 22:47:13] [INFO ] [Nat]Added 2178 Read/Feed constraints in 497 ms returned sat
[2023-03-23 22:47:14] [INFO ] Deduced a trap composed of 113 places in 423 ms of which 1 ms to minimize.
[2023-03-23 22:47:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 684 ms
[2023-03-23 22:47:14] [INFO ] Computed and/alt/rep : 1339/1942/1339 causal constraints (skipped 1927 transitions) in 179 ms.
[2023-03-23 22:47:15] [INFO ] Added : 11 causal constraints over 3 iterations in 713 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-07 in 4077 ms.
[2023-03-23 22:47:16] [INFO ] Flatten gal took : 301 ms
Total runtime 164521 ms.
ITS solved all properties within timeout

BK_STOP 1679611636901

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -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="MultiCrashLeafsetExtension-PT-S16C06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856419400781"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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