Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 37M
-rw-r--r-- 1 mcc users 14K Feb 26 02:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 02:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 02:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 02:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 37M 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-S32C12-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678740627150

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C12
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:50:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 20:50:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:50:29] [INFO ] Load time of PNML (sax parser for PT used): 1076 ms
[2023-03-13 20:50:29] [INFO ] Transformed 36724 places.
[2023-03-13 20:50:29] [INFO ] Transformed 54827 transitions.
[2023-03-13 20:50:30] [INFO ] Parsed PT model containing 36724 places and 54827 transitions and 203278 arcs in 1359 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Normalized transition count is 53771 out of 54827 initially.
// Phase 1: matrix 53771 rows 36724 cols
[2023-03-13 20:50:40] [INFO ] Computed 2033 place invariants in 9784 ms
Incomplete random walk after 10000 steps, including 81 resets, run finished after 595 ms. (steps per millisecond=16 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 16) seen :0
[2023-03-13 20:50:42] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
// Phase 1: matrix 53771 rows 36724 cols
[2023-03-13 20:50:53] [INFO ] Computed 2033 place invariants in 10271 ms
Current structural bounds on expressions (after SMT) : [33, 1, 33, 1, 33, 33, 99, 33, 1, 33, 99, 33, 99, 33, 33, 33] Max seen :[0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0]
Support contains 16 out of 36724 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36724/36724 places, 54827/54827 transitions.
Graph (complete) has 119009 edges and 36724 vertex of which 36664 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.76 ms
Discarding 60 places :
Also discarding 0 output transitions
Drop transitions removed 12645 transitions
Trivial Post-agglo rules discarded 12645 transitions
Performed 12645 trivial Post agglomeration. Transition count delta: 12645
Iterating post reduction 0 with 12645 rules applied. Total rules applied 12646 place count 36664 transition count 42182
Reduce places removed 12645 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 12664 rules applied. Total rules applied 25310 place count 24019 transition count 42163
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 25329 place count 24000 transition count 42163
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 791 Pre rules applied. Total rules applied 25329 place count 24000 transition count 41372
Deduced a syphon composed of 791 places in 172 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 3 with 1582 rules applied. Total rules applied 26911 place count 23209 transition count 41372
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 67 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 26977 place count 23176 transition count 41339
Free-agglomeration rule (complex) applied 1579 times.
Iterating global reduction 3 with 1579 rules applied. Total rules applied 28556 place count 23176 transition count 39760
Reduce places removed 1579 places and 0 transitions.
Iterating post reduction 3 with 1579 rules applied. Total rules applied 30135 place count 21597 transition count 39760
Partial Free-agglomeration rule applied 5253 times.
Drop transitions removed 5253 transitions
Iterating global reduction 4 with 5253 rules applied. Total rules applied 35388 place count 21597 transition count 39760
Applied a total of 35388 rules in 13854 ms. Remains 21597 /36724 variables (removed 15127) and now considering 39760/54827 (removed 15067) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13861 ms. Remains : 21597/36724 places, 39760/54827 transitions.
Normalized transition count is 38194 out of 39760 initially.
// Phase 1: matrix 38194 rows 21597 cols
[2023-03-13 20:52:42] [INFO ] Computed 1973 place invariants in 14990 ms
FORMULA MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 256433 steps, including 3482 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 7
FORMULA MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 341479 steps, including 473 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen 0
Interrupted Best-First random walk after 338108 steps, including 468 resets, run timeout after 5001 ms. (steps per millisecond=67 ) properties seen 1
Interrupted Best-First random walk after 343418 steps, including 475 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen 1
Interrupted Best-First random walk after 308995 steps, including 428 resets, run timeout after 5001 ms. (steps per millisecond=61 ) properties seen 0
Interrupted Best-First random walk after 329250 steps, including 456 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 2
FORMULA MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 353714 steps, including 490 resets, run timeout after 5001 ms. (steps per millisecond=70 ) properties seen 2
[2023-03-13 20:53:42] [INFO ] Flow matrix only has 38194 transitions (discarded 1566 similar events)
// Phase 1: matrix 38194 rows 21597 cols
[2023-03-13 20:53:59] [INFO ] Computed 1973 place invariants in 17465 ms
[2023-03-13 20:54:03] [INFO ] [Real]Absence check using 65 positive place invariants in 974 ms returned sat
[2023-03-13 20:54:04] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1340 ms returned sat
[2023-03-13 20:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:54:44] [INFO ] [Real]Absence check using state equation in 40160 ms returned unknown
[2023-03-13 20:54:48] [INFO ] [Real]Absence check using 65 positive place invariants in 905 ms returned sat
[2023-03-13 20:54:49] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1330 ms returned sat
[2023-03-13 20:54:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:55:29] [INFO ] [Real]Absence check using state equation in 40199 ms returned unknown
[2023-03-13 20:55:33] [INFO ] [Real]Absence check using 65 positive place invariants in 900 ms returned sat
[2023-03-13 20:55:34] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1643 ms returned sat
[2023-03-13 20:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:56:14] [INFO ] [Real]Absence check using state equation in 40080 ms returned unknown
[2023-03-13 20:56:18] [INFO ] [Real]Absence check using 65 positive place invariants in 884 ms returned sat
[2023-03-13 20:56:19] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1345 ms returned sat
[2023-03-13 20:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:56:59] [INFO ] [Real]Absence check using state equation in 40403 ms returned unknown
[2023-03-13 20:57:03] [INFO ] [Real]Absence check using 65 positive place invariants in 877 ms returned sat
[2023-03-13 20:57:04] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 776 ms returned unsat
[2023-03-13 20:57:07] [INFO ] [Real]Absence check using 65 positive place invariants in 880 ms returned sat
[2023-03-13 20:57:08] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1216 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 2, 1, 1, 1] Max seen :[0, 0, 0, 0, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 21597 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21597/21597 places, 39760/39760 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21597 transition count 39752
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 21589 transition count 39752
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 21589 transition count 39751
Deduced a syphon composed of 1 places in 33 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 21588 transition count 39751
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 21588 transition count 39741
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 38 place count 21578 transition count 39741
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 21578 transition count 39741
Applied a total of 39 rules in 4650 ms. Remains 21578 /21597 variables (removed 19) and now considering 39741/39760 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4651 ms. Remains : 21578/21597 places, 39741/39760 transitions.
Normalized transition count is 38175 out of 39741 initially.
// Phase 1: matrix 38175 rows 21578 cols
[2023-03-13 20:57:27] [INFO ] Computed 1973 place invariants in 14138 ms
Interrupted random walk after 258997 steps, including 3520 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 377189 steps, including 522 resets, run timeout after 5001 ms. (steps per millisecond=75 ) properties seen 0
Interrupted Best-First random walk after 381225 steps, including 528 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen 0
Interrupted Best-First random walk after 380881 steps, including 527 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen 0
Interrupted Best-First random walk after 381530 steps, including 528 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen 0
[2023-03-13 20:58:17] [INFO ] Flow matrix only has 38175 transitions (discarded 1566 similar events)
// Phase 1: matrix 38175 rows 21578 cols
[2023-03-13 20:58:32] [INFO ] Computed 1973 place invariants in 14491 ms
[2023-03-13 20:58:35] [INFO ] [Real]Absence check using 65 positive place invariants in 855 ms returned sat
[2023-03-13 20:58:36] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1342 ms returned sat
[2023-03-13 20:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:59:17] [INFO ] [Real]Absence check using state equation in 40478 ms returned unknown
[2023-03-13 20:59:20] [INFO ] [Real]Absence check using 65 positive place invariants in 851 ms returned sat
[2023-03-13 20:59:22] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1730 ms returned sat
[2023-03-13 20:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:00:02] [INFO ] [Real]Absence check using state equation in 40112 ms returned unknown
[2023-03-13 21:00:05] [INFO ] [Real]Absence check using 65 positive place invariants in 813 ms returned sat
[2023-03-13 21:00:06] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1160 ms returned sat
[2023-03-13 21:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:00:47] [INFO ] [Real]Absence check using state equation in 40726 ms returned unknown
[2023-03-13 21:00:50] [INFO ] [Real]Absence check using 65 positive place invariants in 817 ms returned sat
[2023-03-13 21:00:51] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1334 ms returned sat
[2023-03-13 21:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:01:32] [INFO ] [Real]Absence check using state equation in 40596 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 2, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 21578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21578/21578 places, 39741/39741 transitions.
Applied a total of 0 rules in 1523 ms. Remains 21578 /21578 variables (removed 0) and now considering 39741/39741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1523 ms. Remains : 21578/21578 places, 39741/39741 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21578/21578 places, 39741/39741 transitions.
Applied a total of 0 rules in 1501 ms. Remains 21578 /21578 variables (removed 0) and now considering 39741/39741 (removed 0) transitions.
[2023-03-13 21:01:35] [INFO ] Flow matrix only has 38175 transitions (discarded 1566 similar events)
[2023-03-13 21:01:35] [INFO ] Invariant cache hit.
[2023-03-13 21:01:37] [INFO ] Implicit Places using invariants in 1824 ms returned []
Implicit Place search using SMT only with invariants took 1828 ms to find 0 implicit places.
[2023-03-13 21:01:37] [INFO ] Flow matrix only has 38175 transitions (discarded 1566 similar events)
[2023-03-13 21:01:37] [INFO ] Invariant cache hit.
[2023-03-13 21:01:38] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5166 ms. Remains : 21578/21578 places, 39741/39741 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-01
Normalized transition count is 38175 out of 39741 initially.
// Phase 1: matrix 38175 rows 21578 cols
[2023-03-13 21:01:54] [INFO ] Computed 1973 place invariants in 15301 ms
Incomplete random walk after 10000 steps, including 135 resets, run finished after 1206 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
[2023-03-13 21:01:55] [INFO ] Flow matrix only has 38175 transitions (discarded 1566 similar events)
// Phase 1: matrix 38175 rows 21578 cols
[2023-03-13 21:02:10] [INFO ] Computed 1973 place invariants in 14438 ms
[2023-03-13 21:02:13] [INFO ] [Real]Absence check using 65 positive place invariants in 857 ms returned sat
[2023-03-13 21:02:15] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1528 ms returned sat
[2023-03-13 21:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:02:15] [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 21578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21578/21578 places, 39741/39741 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 21578 transition count 39740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 21577 transition count 39740
Applied a total of 2 rules in 2967 ms. Remains 21577 /21578 variables (removed 1) and now considering 39740/39741 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2970 ms. Remains : 21577/21578 places, 39740/39741 transitions.
Normalized transition count is 38174 out of 39740 initially.
// Phase 1: matrix 38174 rows 21577 cols
[2023-03-13 21:02:32] [INFO ] Computed 1973 place invariants in 14550 ms
Interrupted random walk after 250817 steps, including 3411 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 360040 steps, including 498 resets, run timeout after 5001 ms. (steps per millisecond=71 ) properties seen 0
[2023-03-13 21:03:07] [INFO ] Flow matrix only has 38174 transitions (discarded 1566 similar events)
// Phase 1: matrix 38174 rows 21577 cols
[2023-03-13 21:03:22] [INFO ] Computed 1973 place invariants in 14263 ms
[2023-03-13 21:03:25] [INFO ] [Real]Absence check using 65 positive place invariants in 843 ms returned sat
[2023-03-13 21:03:26] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1328 ms returned sat
[2023-03-13 21:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:04:07] [INFO ] [Real]Absence check using state equation in 40483 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 21577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21577/21577 places, 39740/39740 transitions.
Applied a total of 0 rules in 1470 ms. Remains 21577 /21577 variables (removed 0) and now considering 39740/39740 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1470 ms. Remains : 21577/21577 places, 39740/39740 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21577/21577 places, 39740/39740 transitions.
Applied a total of 0 rules in 1415 ms. Remains 21577 /21577 variables (removed 0) and now considering 39740/39740 (removed 0) transitions.
[2023-03-13 21:04:09] [INFO ] Flow matrix only has 38174 transitions (discarded 1566 similar events)
[2023-03-13 21:04:10] [INFO ] Invariant cache hit.
[2023-03-13 21:04:11] [INFO ] Implicit Places using invariants in 1747 ms returned []
Implicit Place search using SMT only with invariants took 1757 ms to find 0 implicit places.
[2023-03-13 21:04:11] [INFO ] Flow matrix only has 38174 transitions (discarded 1566 similar events)
[2023-03-13 21:04:11] [INFO ] Invariant cache hit.
[2023-03-13 21:04:13] [INFO ] Dead Transitions using invariants and state equation in 1739 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4936 ms. Remains : 21577/21577 places, 39740/39740 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-01 in 154547 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-03
Normalized transition count is 38175 out of 39741 initially.
// Phase 1: matrix 38175 rows 21578 cols
[2023-03-13 21:04:28] [INFO ] Computed 1973 place invariants in 14528 ms
Incomplete random walk after 10000 steps, including 135 resets, run finished after 1183 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
[2023-03-13 21:04:29] [INFO ] Flow matrix only has 38175 transitions (discarded 1566 similar events)
// Phase 1: matrix 38175 rows 21578 cols
[2023-03-13 21:04:43] [INFO ] Computed 1973 place invariants in 14463 ms
[2023-03-13 21:04:46] [INFO ] [Real]Absence check using 65 positive place invariants in 814 ms returned sat
[2023-03-13 21:04:48] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1284 ms returned sat
[2023-03-13 21:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:04:48] [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 21578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21578/21578 places, 39741/39741 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 21578 transition count 39740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 21577 transition count 39740
Applied a total of 2 rules in 2829 ms. Remains 21577 /21578 variables (removed 1) and now considering 39740/39741 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2831 ms. Remains : 21577/21578 places, 39740/39741 transitions.
Normalized transition count is 38174 out of 39740 initially.
// Phase 1: matrix 38174 rows 21577 cols
[2023-03-13 21:05:08] [INFO ] Computed 1973 place invariants in 16315 ms
Interrupted random walk after 255460 steps, including 3473 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 386019 steps, including 534 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen 0
[2023-03-13 21:05:43] [INFO ] Flow matrix only has 38174 transitions (discarded 1566 similar events)
// Phase 1: matrix 38174 rows 21577 cols
[2023-03-13 21:05:57] [INFO ] Computed 1973 place invariants in 14284 ms
[2023-03-13 21:06:00] [INFO ] [Real]Absence check using 65 positive place invariants in 821 ms returned sat
[2023-03-13 21:06:01] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1337 ms returned sat
[2023-03-13 21:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:06:42] [INFO ] [Real]Absence check using state equation in 40551 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 21577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21577/21577 places, 39740/39740 transitions.
Applied a total of 0 rules in 1334 ms. Remains 21577 /21577 variables (removed 0) and now considering 39740/39740 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1334 ms. Remains : 21577/21577 places, 39740/39740 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21577/21577 places, 39740/39740 transitions.
Applied a total of 0 rules in 1328 ms. Remains 21577 /21577 variables (removed 0) and now considering 39740/39740 (removed 0) transitions.
[2023-03-13 21:06:45] [INFO ] Flow matrix only has 38174 transitions (discarded 1566 similar events)
[2023-03-13 21:06:45] [INFO ] Invariant cache hit.
[2023-03-13 21:06:46] [INFO ] Implicit Places using invariants in 1690 ms returned []
Implicit Place search using SMT only with invariants took 1699 ms to find 0 implicit places.
[2023-03-13 21:06:46] [INFO ] Flow matrix only has 38174 transitions (discarded 1566 similar events)
[2023-03-13 21:06:46] [INFO ] Invariant cache hit.
[2023-03-13 21:06:48] [INFO ] Dead Transitions using invariants and state equation in 1664 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4706 ms. Remains : 21577/21577 places, 39740/39740 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-03 in 155027 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-06
Normalized transition count is 38175 out of 39741 initially.
// Phase 1: matrix 38175 rows 21578 cols
[2023-03-13 21:07:03] [INFO ] Computed 1973 place invariants in 15174 ms
Incomplete random walk after 10000 steps, including 136 resets, run finished after 1357 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
[2023-03-13 21:07:05] [INFO ] Flow matrix only has 38175 transitions (discarded 1566 similar events)
// Phase 1: matrix 38175 rows 21578 cols
[2023-03-13 21:07:21] [INFO ] Computed 1973 place invariants in 16458 ms
[2023-03-13 21:07:24] [INFO ] [Real]Absence check using 65 positive place invariants in 827 ms returned sat
[2023-03-13 21:07:26] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1588 ms returned sat
[2023-03-13 21:07:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:07:26] [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) : [2] Max seen :[0]
Support contains 1 out of 21578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21578/21578 places, 39741/39741 transitions.
Applied a total of 0 rules in 1354 ms. Remains 21578 /21578 variables (removed 0) and now considering 39741/39741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1356 ms. Remains : 21578/21578 places, 39741/39741 transitions.
Normalized transition count is 38175 out of 39741 initially.
// Phase 1: matrix 38175 rows 21578 cols
[2023-03-13 21:07:42] [INFO ] Computed 1973 place invariants in 14238 ms
Interrupted random walk after 268978 steps, including 3657 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 394543 steps, including 546 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 0
[2023-03-13 21:08:17] [INFO ] Flow matrix only has 38175 transitions (discarded 1566 similar events)
// Phase 1: matrix 38175 rows 21578 cols
[2023-03-13 21:08:31] [INFO ] Computed 1973 place invariants in 13777 ms
[2023-03-13 21:08:34] [INFO ] [Real]Absence check using 65 positive place invariants in 808 ms returned sat
[2023-03-13 21:08:35] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1131 ms returned sat
[2023-03-13 21:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:09:16] [INFO ] [Real]Absence check using state equation in 40780 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 21578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21578/21578 places, 39741/39741 transitions.
Applied a total of 0 rules in 1344 ms. Remains 21578 /21578 variables (removed 0) and now considering 39741/39741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1344 ms. Remains : 21578/21578 places, 39741/39741 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21578/21578 places, 39741/39741 transitions.
Applied a total of 0 rules in 1350 ms. Remains 21578 /21578 variables (removed 0) and now considering 39741/39741 (removed 0) transitions.
[2023-03-13 21:09:18] [INFO ] Flow matrix only has 38175 transitions (discarded 1566 similar events)
[2023-03-13 21:09:19] [INFO ] Invariant cache hit.
[2023-03-13 21:09:20] [INFO ] Implicit Places using invariants in 1730 ms returned []
Implicit Place search using SMT only with invariants took 1737 ms to find 0 implicit places.
[2023-03-13 21:09:20] [INFO ] Flow matrix only has 38175 transitions (discarded 1566 similar events)
[2023-03-13 21:09:20] [INFO ] Invariant cache hit.
[2023-03-13 21:09:22] [INFO ] Dead Transitions using invariants and state equation in 1750 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4847 ms. Remains : 21578/21578 places, 39741/39741 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-06 in 153951 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-08
Normalized transition count is 38175 out of 39741 initially.
// Phase 1: matrix 38175 rows 21578 cols
[2023-03-13 21:09:38] [INFO ] Computed 1973 place invariants in 15778 ms
Incomplete random walk after 10000 steps, including 135 resets, run finished after 1142 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
[2023-03-13 21:09:39] [INFO ] Flow matrix only has 38175 transitions (discarded 1566 similar events)
// Phase 1: matrix 38175 rows 21578 cols
[2023-03-13 21:09:55] [INFO ] Computed 1973 place invariants in 15791 ms
[2023-03-13 21:09:58] [INFO ] [Real]Absence check using 65 positive place invariants in 820 ms returned sat
[2023-03-13 21:09:59] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1275 ms returned sat
[2023-03-13 21:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:10:00] [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 21578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21578/21578 places, 39741/39741 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 21578 transition count 39740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 21577 transition count 39740
Applied a total of 2 rules in 2785 ms. Remains 21577 /21578 variables (removed 1) and now considering 39740/39741 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2786 ms. Remains : 21577/21578 places, 39740/39741 transitions.
Normalized transition count is 38174 out of 39740 initially.
// Phase 1: matrix 38174 rows 21577 cols
[2023-03-13 21:10:19] [INFO ] Computed 1973 place invariants in 15927 ms
Interrupted random walk after 268192 steps, including 3645 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 393928 steps, including 545 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 0
[2023-03-13 21:10:54] [INFO ] Flow matrix only has 38174 transitions (discarded 1566 similar events)
// Phase 1: matrix 38174 rows 21577 cols
[2023-03-13 21:11:08] [INFO ] Computed 1973 place invariants in 14153 ms
[2023-03-13 21:11:11] [INFO ] [Real]Absence check using 65 positive place invariants in 797 ms returned sat
[2023-03-13 21:11:12] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1161 ms returned sat
[2023-03-13 21:11:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:11:53] [INFO ] [Real]Absence check using state equation in 40824 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 21577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21577/21577 places, 39740/39740 transitions.
Applied a total of 0 rules in 1317 ms. Remains 21577 /21577 variables (removed 0) and now considering 39740/39740 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1317 ms. Remains : 21577/21577 places, 39740/39740 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21577/21577 places, 39740/39740 transitions.
Applied a total of 0 rules in 1317 ms. Remains 21577 /21577 variables (removed 0) and now considering 39740/39740 (removed 0) transitions.
[2023-03-13 21:11:56] [INFO ] Flow matrix only has 38174 transitions (discarded 1566 similar events)
[2023-03-13 21:11:56] [INFO ] Invariant cache hit.
[2023-03-13 21:11:57] [INFO ] Implicit Places using invariants in 1694 ms returned []
Implicit Place search using SMT only with invariants took 1695 ms to find 0 implicit places.
[2023-03-13 21:11:57] [INFO ] Flow matrix only has 38174 transitions (discarded 1566 similar events)
[2023-03-13 21:11:57] [INFO ] Invariant cache hit.
[2023-03-13 21:11:59] [INFO ] Dead Transitions using invariants and state equation in 1659 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4682 ms. Remains : 21577/21577 places, 39740/39740 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C12-UpperBounds-08 in 156966 ms.
[2023-03-13 21:12:01] [INFO ] Flatten gal took : 2011 ms
[2023-03-13 21:12:01] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 8 ms.
[2023-03-13 21:12:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 21578 places, 39741 transitions and 245294 arcs took 166 ms.
Total runtime 1293513 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running MultiCrashLeafsetExtension (PT), instance S32C12
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 21578 places, 39741 transitions, 245294 arcs.
Final Score: 2.08298008383E8
Took : 817 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13827352 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15994928 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
Caught signal 15, terminating.

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-S32C12"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is MultiCrashLeafsetExtension-PT-S32C12, 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 r235-tall-167856422600973"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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