Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r231-tall-167856416800949.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 lolaxred
Input is MultiCrashLeafsetExtension-PT-S32C09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416800949
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 31M
-rw-r--r-- 1 mcc users 14K Feb 26 03:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 03:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 03:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:26 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 30M 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-S32C09-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679518327048

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C09
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 20:52:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 20:52:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:52:09] [INFO ] Load time of PNML (sax parser for PT used): 859 ms
[2023-03-22 20:52:09] [INFO ] Transformed 29770 places.
[2023-03-22 20:52:09] [INFO ] Transformed 44921 transitions.
[2023-03-22 20:52:09] [INFO ] Parsed PT model containing 29770 places and 44921 transitions and 170374 arcs in 1189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Normalized transition count is 43865 out of 44921 initially.
// Phase 1: matrix 43865 rows 29770 cols
[2023-03-22 20:52:17] [INFO ] Computed 1823 place invariants in 7026 ms
Incomplete random walk after 10000 steps, including 108 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 16) seen :1
[2023-03-22 20:52:19] [INFO ] Flow matrix only has 43865 transitions (discarded 1056 similar events)
// Phase 1: matrix 43865 rows 29770 cols
[2023-03-22 20:52:26] [INFO ] Computed 1823 place invariants in 7645 ms
[2023-03-22 20:52:31] [INFO ] [Real]Absence check using 88 positive place invariants in 1120 ms returned unknown
[2023-03-22 20:52:36] [INFO ] [Real]Absence check using 88 positive place invariants in 1213 ms returned unknown
[2023-03-22 20:52:41] [INFO ] [Real]Absence check using 88 positive place invariants in 1284 ms returned unknown
[2023-03-22 20:52:46] [INFO ] [Real]Absence check using 88 positive place invariants in 1278 ms returned unknown
[2023-03-22 20:52:51] [INFO ] [Real]Absence check using 88 positive place invariants in 1156 ms returned unknown
[2023-03-22 20:52:56] [INFO ] [Real]Absence check using 88 positive place invariants in 1084 ms returned unknown
[2023-03-22 20:53:01] [INFO ] [Real]Absence check using 88 positive place invariants in 1142 ms returned unknown
[2023-03-22 20:53:06] [INFO ] [Real]Absence check using 88 positive place invariants in 1197 ms returned unknown
[2023-03-22 20:53:11] [INFO ] [Real]Absence check using 88 positive place invariants in 1166 ms returned unknown
[2023-03-22 20:53:17] [INFO ] [Real]Absence check using 88 positive place invariants in 1122 ms returned unknown
[2023-03-22 20:53:22] [INFO ] [Real]Absence check using 88 positive place invariants in 1176 ms returned unknown
[2023-03-22 20:53:27] [INFO ] [Real]Absence check using 88 positive place invariants in 1239 ms returned unknown
[2023-03-22 20:53:32] [INFO ] [Real]Absence check using 88 positive place invariants in 1267 ms returned unknown
[2023-03-22 20:53:37] [INFO ] [Real]Absence check using 88 positive place invariants in 1228 ms returned unknown
[2023-03-22 20:53:42] [INFO ] [Real]Absence check using 88 positive place invariants in 1266 ms returned unknown
[2023-03-22 20:53:47] [INFO ] [Real]Absence check using 88 positive place invariants in 1222 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 33, 33, 99, 1, 99, 99, 1, 33, 33, 33, 33, 99, 1, 33] Max seen :[0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1]
Support contains 16 out of 29770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29770/29770 places, 44921/44921 transitions.
Graph (complete) has 99155 edges and 29770 vertex of which 29716 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.67 ms
Discarding 54 places :
Also discarding 0 output transitions
Drop transitions removed 9495 transitions
Trivial Post-agglo rules discarded 9495 transitions
Performed 9495 trivial Post agglomeration. Transition count delta: 9495
Iterating post reduction 0 with 9495 rules applied. Total rules applied 9496 place count 29716 transition count 35426
Reduce places removed 9495 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 9499 rules applied. Total rules applied 18995 place count 20221 transition count 35422
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 18999 place count 20217 transition count 35422
Performed 594 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 594 Pre rules applied. Total rules applied 18999 place count 20217 transition count 34828
Deduced a syphon composed of 594 places in 49 ms
Reduce places removed 594 places and 0 transitions.
Iterating global reduction 3 with 1188 rules applied. Total rules applied 20187 place count 19623 transition count 34828
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 37 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 20253 place count 19590 transition count 34795
Free-agglomeration rule (complex) applied 1574 times.
Iterating global reduction 3 with 1574 rules applied. Total rules applied 21827 place count 19590 transition count 33221
Reduce places removed 1574 places and 0 transitions.
Iterating post reduction 3 with 1574 rules applied. Total rules applied 23401 place count 18016 transition count 33221
Partial Free-agglomeration rule applied 3687 times.
Drop transitions removed 3687 transitions
Iterating global reduction 4 with 3687 rules applied. Total rules applied 27088 place count 18016 transition count 33221
Applied a total of 27088 rules in 12901 ms. Remains 18016 /29770 variables (removed 11754) and now considering 33221/44921 (removed 11700) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12907 ms. Remains : 18016/29770 places, 33221/44921 transitions.
Normalized transition count is 31656 out of 33221 initially.
// Phase 1: matrix 31656 rows 18016 cols
[2023-03-22 20:54:09] [INFO ] Computed 1769 place invariants in 9793 ms
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 311578 steps, including 5624 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 6
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 476781 steps, including 838 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 2
Interrupted Best-First random walk after 471586 steps, including 829 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 3
Interrupted Best-First random walk after 462201 steps, including 813 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 0
Interrupted Best-First random walk after 467657 steps, including 822 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 2
Interrupted Best-First random walk after 484198 steps, including 851 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 1
Interrupted Best-First random walk after 478311 steps, including 841 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 2
Interrupted Best-First random walk after 490792 steps, including 863 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 1
Interrupted Best-First random walk after 490094 steps, including 862 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen 2
Interrupted Best-First random walk after 484733 steps, including 852 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 2
[2023-03-22 20:55:24] [INFO ] Flow matrix only has 31656 transitions (discarded 1565 similar events)
// Phase 1: matrix 31656 rows 18016 cols
[2023-03-22 20:55:34] [INFO ] Computed 1769 place invariants in 9911 ms
[2023-03-22 20:55:37] [INFO ] [Real]Absence check using 65 positive place invariants in 612 ms returned sat
[2023-03-22 20:55:38] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1196 ms returned sat
[2023-03-22 20:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:56:19] [INFO ] [Real]Absence check using state equation in 41428 ms returned unknown
[2023-03-22 20:56:22] [INFO ] [Real]Absence check using 65 positive place invariants in 567 ms returned sat
[2023-03-22 20:56:23] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1085 ms returned sat
[2023-03-22 20:56:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:57:04] [INFO ] [Real]Absence check using state equation in 41590 ms returned unknown
[2023-03-22 20:57:07] [INFO ] [Real]Absence check using 65 positive place invariants in 569 ms returned sat
[2023-03-22 20:57:07] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 589 ms returned unsat
[2023-03-22 20:57:10] [INFO ] [Real]Absence check using 65 positive place invariants in 555 ms returned sat
[2023-03-22 20:57:11] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1058 ms returned sat
[2023-03-22 20:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:57:52] [INFO ] [Real]Absence check using state equation in 41637 ms returned unknown
[2023-03-22 20:57:55] [INFO ] [Real]Absence check using 65 positive place invariants in 579 ms returned sat
[2023-03-22 20:57:55] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 491 ms returned unsat
[2023-03-22 20:57:57] [INFO ] [Real]Absence check using 65 positive place invariants in 536 ms returned sat
[2023-03-22 20:57:58] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 944 ms returned unsat
[2023-03-22 20:58:01] [INFO ] [Real]Absence check using 65 positive place invariants in 574 ms returned sat
[2023-03-22 20:58:02] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1022 ms returned sat
[2023-03-22 20:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:58:43] [INFO ] [Real]Absence check using state equation in 41637 ms returned unknown
[2023-03-22 20:58:46] [INFO ] [Real]Absence check using 65 positive place invariants in 530 ms returned sat
[2023-03-22 20:58:47] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 938 ms returned sat
[2023-03-22 20:58:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:59:28] [INFO ] [Real]Absence check using state equation in 41815 ms returned unknown
[2023-03-22 20:59:31] [INFO ] [Real]Absence check using 65 positive place invariants in 560 ms returned sat
[2023-03-22 20:59:32] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 936 ms returned sat
[2023-03-22 20:59:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:00:13] [INFO ] [Real]Absence check using state equation in 41792 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 2, 1] Max seen :[0, 0, 1, 0, 1, 1, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 18016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18016/18016 places, 33221/33221 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 18016 transition count 33216
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 18011 transition count 33216
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 18011 transition count 33208
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 26 place count 18003 transition count 33208
Applied a total of 26 rules in 2650 ms. Remains 18003 /18016 variables (removed 13) and now considering 33208/33221 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2652 ms. Remains : 18003/18016 places, 33208/33221 transitions.
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:00:26] [INFO ] Computed 1769 place invariants in 9822 ms
Interrupted random walk after 313777 steps, including 5668 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 1
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 484734 steps, including 852 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 0
Interrupted Best-First random walk after 488124 steps, including 858 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen 0
Interrupted Best-First random walk after 483305 steps, including 850 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 0
Interrupted Best-First random walk after 478940 steps, including 842 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 478191 steps, including 841 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
[2023-03-22 21:01:21] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:01:31] [INFO ] Computed 1769 place invariants in 9835 ms
[2023-03-22 21:01:33] [INFO ] [Real]Absence check using 65 positive place invariants in 601 ms returned sat
[2023-03-22 21:01:34] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1032 ms returned sat
[2023-03-22 21:01:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:02:16] [INFO ] [Real]Absence check using state equation in 41643 ms returned unknown
[2023-03-22 21:02:18] [INFO ] [Real]Absence check using 65 positive place invariants in 604 ms returned sat
[2023-03-22 21:02:19] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1058 ms returned sat
[2023-03-22 21:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:03:01] [INFO ] [Real]Absence check using state equation in 41598 ms returned unknown
[2023-03-22 21:03:03] [INFO ] [Real]Absence check using 65 positive place invariants in 609 ms returned sat
[2023-03-22 21:03:05] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1282 ms returned sat
[2023-03-22 21:03:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:03:46] [INFO ] [Real]Absence check using state equation in 41326 ms returned unknown
[2023-03-22 21:03:48] [INFO ] [Real]Absence check using 65 positive place invariants in 565 ms returned sat
[2023-03-22 21:03:49] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 951 ms returned sat
[2023-03-22 21:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:04:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 21:04:33] [INFO ] [Real]Absence check using 65 positive place invariants in 585 ms returned sat
[2023-03-22 21:04:34] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 980 ms returned sat
[2023-03-22 21:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:05:16] [INFO ] [Real]Absence check using state equation in 41701 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 2] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Applied a total of 0 rules in 1255 ms. Remains 18003 /18003 variables (removed 0) and now considering 33208/33208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1255 ms. Remains : 18003/18003 places, 33208/33208 transitions.
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:05:28] [INFO ] Computed 1769 place invariants in 11140 ms
Interrupted random walk after 320730 steps, including 5792 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 485876 steps, including 854 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen 0
Interrupted Best-First random walk after 479550 steps, including 843 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 479014 steps, including 842 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 483789 steps, including 851 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 0
Interrupted Best-First random walk after 480764 steps, including 845 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 0
[2023-03-22 21:06:23] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:06:34] [INFO ] Computed 1769 place invariants in 10234 ms
[2023-03-22 21:06:36] [INFO ] [Real]Absence check using 65 positive place invariants in 592 ms returned sat
[2023-03-22 21:06:37] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 978 ms returned sat
[2023-03-22 21:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:07:19] [INFO ] [Real]Absence check using state equation in 41718 ms returned unknown
[2023-03-22 21:07:21] [INFO ] [Real]Absence check using 65 positive place invariants in 567 ms returned sat
[2023-03-22 21:07:22] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1034 ms returned sat
[2023-03-22 21:07:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:08:04] [INFO ] [Real]Absence check using state equation in 41693 ms returned unknown
[2023-03-22 21:08:06] [INFO ] [Real]Absence check using 65 positive place invariants in 602 ms returned sat
[2023-03-22 21:08:07] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1016 ms returned sat
[2023-03-22 21:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:08:49] [INFO ] [Real]Absence check using state equation in 41633 ms returned unknown
[2023-03-22 21:08:51] [INFO ] [Real]Absence check using 65 positive place invariants in 578 ms returned sat
[2023-03-22 21:08:52] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1043 ms returned sat
[2023-03-22 21:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:09:34] [INFO ] [Real]Absence check using state equation in 41646 ms returned unknown
[2023-03-22 21:09:36] [INFO ] [Real]Absence check using 65 positive place invariants in 585 ms returned sat
[2023-03-22 21:09:37] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 989 ms returned sat
[2023-03-22 21:09:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:10:19] [INFO ] [Real]Absence check using state equation in 41684 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 2] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Applied a total of 0 rules in 1174 ms. Remains 18003 /18003 variables (removed 0) and now considering 33208/33208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1174 ms. Remains : 18003/18003 places, 33208/33208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Applied a total of 0 rules in 1177 ms. Remains 18003 /18003 variables (removed 0) and now considering 33208/33208 (removed 0) transitions.
[2023-03-22 21:10:21] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
[2023-03-22 21:10:21] [INFO ] Invariant cache hit.
[2023-03-22 21:10:23] [INFO ] Implicit Places using invariants in 2015 ms returned []
Implicit Place search using SMT only with invariants took 2020 ms to find 0 implicit places.
[2023-03-22 21:10:23] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
[2023-03-22 21:10:23] [INFO ] Invariant cache hit.
[2023-03-22 21:10:25] [INFO ] Dead Transitions using invariants and state equation in 1412 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4614 ms. Remains : 18003/18003 places, 33208/33208 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:10:34] [INFO ] Computed 1769 place invariants in 9562 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 998 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
[2023-03-22 21:10:35] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:10:45] [INFO ] Computed 1769 place invariants in 9534 ms
[2023-03-22 21:10:47] [INFO ] [Real]Absence check using 65 positive place invariants in 571 ms returned sat
[2023-03-22 21:10:48] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 973 ms returned sat
[2023-03-22 21:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:10:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18003 transition count 33206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 18001 transition count 33206
Applied a total of 4 rules in 2392 ms. Remains 18001 /18003 variables (removed 2) and now considering 33206/33208 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2394 ms. Remains : 18001/18003 places, 33206/33208 transitions.
Normalized transition count is 31640 out of 33206 initially.
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-22 21:11:02] [INFO ] Computed 1769 place invariants in 9646 ms
Interrupted random walk after 323898 steps, including 5849 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 491962 steps, including 865 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
[2023-03-22 21:11:37] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-22 21:11:47] [INFO ] Computed 1769 place invariants in 9578 ms
[2023-03-22 21:11:49] [INFO ] [Real]Absence check using 65 positive place invariants in 561 ms returned sat
[2023-03-22 21:11:50] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 979 ms returned sat
[2023-03-22 21:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:12:32] [INFO ] [Real]Absence check using state equation in 41740 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1157 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1157 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1165 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
[2023-03-22 21:12:34] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-22 21:12:34] [INFO ] Invariant cache hit.
[2023-03-22 21:12:35] [INFO ] Implicit Places using invariants in 1385 ms returned []
Implicit Place search using SMT only with invariants took 1386 ms to find 0 implicit places.
[2023-03-22 21:12:35] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-22 21:12:35] [INFO ] Invariant cache hit.
[2023-03-22 21:12:37] [INFO ] Dead Transitions using invariants and state equation in 1417 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3980 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00 in 132148 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:12:46] [INFO ] Computed 1769 place invariants in 9686 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 974 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
[2023-03-22 21:12:48] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:12:58] [INFO ] Computed 1769 place invariants in 10055 ms
[2023-03-22 21:13:00] [INFO ] [Real]Absence check using 65 positive place invariants in 608 ms returned sat
[2023-03-22 21:13:01] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1068 ms returned sat
[2023-03-22 21:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:13:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 18003 transition count 33207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 18002 transition count 33207
Applied a total of 2 rules in 2381 ms. Remains 18002 /18003 variables (removed 1) and now considering 33207/33208 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2383 ms. Remains : 18002/18003 places, 33207/33208 transitions.
Normalized transition count is 31642 out of 33207 initially.
// Phase 1: matrix 31642 rows 18002 cols
[2023-03-22 21:13:15] [INFO ] Computed 1769 place invariants in 9863 ms
Interrupted random walk after 321485 steps, including 5807 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 479364 steps, including 843 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
[2023-03-22 21:13:50] [INFO ] Flow matrix only has 31642 transitions (discarded 1565 similar events)
// Phase 1: matrix 31642 rows 18002 cols
[2023-03-22 21:14:00] [INFO ] Computed 1769 place invariants in 10025 ms
[2023-03-22 21:14:02] [INFO ] [Real]Absence check using 65 positive place invariants in 606 ms returned sat
[2023-03-22 21:14:03] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1078 ms returned sat
[2023-03-22 21:14:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:14:45] [INFO ] [Real]Absence check using state equation in 41536 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18002/18002 places, 33207/33207 transitions.
Applied a total of 0 rules in 1158 ms. Remains 18002 /18002 variables (removed 0) and now considering 33207/33207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1158 ms. Remains : 18002/18002 places, 33207/33207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18002/18002 places, 33207/33207 transitions.
Applied a total of 0 rules in 1166 ms. Remains 18002 /18002 variables (removed 0) and now considering 33207/33207 (removed 0) transitions.
[2023-03-22 21:14:47] [INFO ] Flow matrix only has 31642 transitions (discarded 1565 similar events)
[2023-03-22 21:14:47] [INFO ] Invariant cache hit.
[2023-03-22 21:14:49] [INFO ] Implicit Places using invariants in 1426 ms returned []
Implicit Place search using SMT only with invariants took 1427 ms to find 0 implicit places.
[2023-03-22 21:14:49] [INFO ] Flow matrix only has 31642 transitions (discarded 1565 similar events)
[2023-03-22 21:14:49] [INFO ] Invariant cache hit.
[2023-03-22 21:14:50] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4035 ms. Remains : 18002/18002 places, 33207/33207 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01 in 133484 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:15:00] [INFO ] Computed 1769 place invariants in 9623 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 973 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
[2023-03-22 21:15:01] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:15:11] [INFO ] Computed 1769 place invariants in 9638 ms
[2023-03-22 21:15:13] [INFO ] [Real]Absence check using 65 positive place invariants in 569 ms returned sat
[2023-03-22 21:15:14] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 967 ms returned sat
[2023-03-22 21:15:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:15:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18003 transition count 33206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 18001 transition count 33206
Applied a total of 4 rules in 2440 ms. Remains 18001 /18003 variables (removed 2) and now considering 33206/33208 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2445 ms. Remains : 18001/18003 places, 33206/33208 transitions.
Normalized transition count is 31640 out of 33206 initially.
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-22 21:15:28] [INFO ] Computed 1769 place invariants in 9638 ms
Interrupted random walk after 318743 steps, including 5758 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 486589 steps, including 856 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen 0
[2023-03-22 21:16:03] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-22 21:16:12] [INFO ] Computed 1769 place invariants in 9430 ms
[2023-03-22 21:16:15] [INFO ] [Real]Absence check using 65 positive place invariants in 584 ms returned sat
[2023-03-22 21:16:16] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 962 ms returned sat
[2023-03-22 21:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:16:57] [INFO ] [Real]Absence check using state equation in 41671 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1165 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1165 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1170 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
[2023-03-22 21:17:00] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-22 21:17:00] [INFO ] Invariant cache hit.
[2023-03-22 21:17:01] [INFO ] Implicit Places using invariants in 1437 ms returned []
Implicit Place search using SMT only with invariants took 1437 ms to find 0 implicit places.
[2023-03-22 21:17:01] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-22 21:17:01] [INFO ] Invariant cache hit.
[2023-03-22 21:17:02] [INFO ] Dead Transitions using invariants and state equation in 1419 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4034 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05 in 132255 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:17:12] [INFO ] Computed 1769 place invariants in 9566 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 946 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
[2023-03-22 21:17:13] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:17:23] [INFO ] Computed 1769 place invariants in 9443 ms
[2023-03-22 21:17:25] [INFO ] [Real]Absence check using 65 positive place invariants in 596 ms returned sat
[2023-03-22 21:17:26] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 975 ms returned sat
[2023-03-22 21:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:17:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18003 transition count 33206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 18001 transition count 33206
Applied a total of 4 rules in 2382 ms. Remains 18001 /18003 variables (removed 2) and now considering 33206/33208 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2383 ms. Remains : 18001/18003 places, 33206/33208 transitions.
Normalized transition count is 31640 out of 33206 initially.
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-22 21:17:40] [INFO ] Computed 1769 place invariants in 9571 ms
Interrupted random walk after 316759 steps, including 5721 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 483926 steps, including 851 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 0
[2023-03-22 21:18:15] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-22 21:18:24] [INFO ] Computed 1769 place invariants in 9648 ms
[2023-03-22 21:18:27] [INFO ] [Real]Absence check using 65 positive place invariants in 616 ms returned sat
[2023-03-22 21:18:28] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1154 ms returned sat
[2023-03-22 21:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:19:09] [INFO ] [Real]Absence check using state equation in 41433 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1209 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1209 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1198 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
[2023-03-22 21:19:12] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-22 21:19:12] [INFO ] Invariant cache hit.
[2023-03-22 21:19:13] [INFO ] Implicit Places using invariants in 1420 ms returned []
Implicit Place search using SMT only with invariants took 1421 ms to find 0 implicit places.
[2023-03-22 21:19:13] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-22 21:19:13] [INFO ] Invariant cache hit.
[2023-03-22 21:19:15] [INFO ] Dead Transitions using invariants and state equation in 1399 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4025 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08 in 132101 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:19:24] [INFO ] Computed 1769 place invariants in 9815 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 935 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
[2023-03-22 21:19:26] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-22 21:19:35] [INFO ] Computed 1769 place invariants in 9848 ms
[2023-03-22 21:19:38] [INFO ] [Real]Absence check using 65 positive place invariants in 605 ms returned sat
[2023-03-22 21:19:39] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1159 ms returned sat
[2023-03-22 21:19:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:19:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 18003 transition count 33207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 18002 transition count 33207
Applied a total of 2 rules in 2403 ms. Remains 18002 /18003 variables (removed 1) and now considering 33207/33208 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2403 ms. Remains : 18002/18003 places, 33207/33208 transitions.
Normalized transition count is 31641 out of 33207 initially.
// Phase 1: matrix 31641 rows 18002 cols
[2023-03-22 21:19:53] [INFO ] Computed 1769 place invariants in 9852 ms
Interrupted random walk after 319955 steps, including 5779 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 491948 steps, including 865 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
[2023-03-22 21:20:28] [INFO ] Flow matrix only has 31641 transitions (discarded 1566 similar events)
// Phase 1: matrix 31641 rows 18002 cols
[2023-03-22 21:20:37] [INFO ] Computed 1769 place invariants in 9516 ms
[2023-03-22 21:20:40] [INFO ] [Real]Absence check using 65 positive place invariants in 603 ms returned sat
[2023-03-22 21:20:41] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1002 ms returned sat
[2023-03-22 21:20:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:21:22] [INFO ] [Real]Absence check using state equation in 41620 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 18002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18002/18002 places, 33207/33207 transitions.
Applied a total of 0 rules in 1178 ms. Remains 18002 /18002 variables (removed 0) and now considering 33207/33207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1178 ms. Remains : 18002/18002 places, 33207/33207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18002/18002 places, 33207/33207 transitions.
Applied a total of 0 rules in 1183 ms. Remains 18002 /18002 variables (removed 0) and now considering 33207/33207 (removed 0) transitions.
[2023-03-22 21:21:25] [INFO ] Flow matrix only has 31641 transitions (discarded 1566 similar events)
[2023-03-22 21:21:25] [INFO ] Invariant cache hit.
[2023-03-22 21:21:26] [INFO ] Implicit Places using invariants in 1404 ms returned []
Implicit Place search using SMT only with invariants took 1405 ms to find 0 implicit places.
[2023-03-22 21:21:26] [INFO ] Flow matrix only has 31641 transitions (discarded 1566 similar events)
[2023-03-22 21:21:26] [INFO ] Invariant cache hit.
[2023-03-22 21:21:28] [INFO ] Dead Transitions using invariants and state equation in 1446 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4045 ms. Remains : 18002/18002 places, 33207/33207 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13 in 132958 ms.
[2023-03-22 21:21:30] [INFO ] Flatten gal took : 1746 ms
[2023-03-22 21:21:30] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 21:21:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18003 places, 33208 transitions and 200151 arcs took 135 ms.
Total runtime 1761862 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MultiCrashLeafsetExtension-PT-S32C09
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
Upper Bounds

BK_STOP 1679520210542

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 5 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 10 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 15 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 20 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 25 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 35 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 40 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 45 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 50 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 55 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 65 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 70 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 75 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 81 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 86 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 91 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 96 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 101 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 108 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 113 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 786 Killed lola --conf=$BIN_DIR/configfiles/upperboundsconf --formula=$DIR/UpperBounds.xml $DIR/model.pnml

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-S32C09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is MultiCrashLeafsetExtension-PT-S32C09, 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 r231-tall-167856416800949"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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