Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 13K Apr 29 16:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 16:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 16:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 9 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 12M May 10 09:34 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-S24C05-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652845193796

Running Version 202205111006
[2022-05-18 03:39:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 03:39:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 03:39:55] [INFO ] Load time of PNML (sax parser for PT used): 693 ms
[2022-05-18 03:39:55] [INFO ] Transformed 11106 places.
[2022-05-18 03:39:55] [INFO ] Transformed 16561 transitions.
[2022-05-18 03:39:55] [INFO ] Parsed PT model containing 11106 places and 16561 transitions in 889 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Normalized transition count is 15961 out of 16561 initially.
// Phase 1: matrix 15961 rows 11106 cols
[2022-05-18 03:39:57] [INFO ] Computed 975 place invariants in 1081 ms
Incomplete random walk after 10000 steps, including 193 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 16) seen :7
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :1
[2022-05-18 03:39:58] [INFO ] Flow matrix only has 15961 transitions (discarded 600 similar events)
// Phase 1: matrix 15961 rows 11106 cols
[2022-05-18 03:39:59] [INFO ] Computed 975 place invariants in 872 ms
[2022-05-18 03:40:00] [INFO ] [Real]Absence check using 64 positive place invariants in 227 ms returned sat
[2022-05-18 03:40:01] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 513 ms returned sat
[2022-05-18 03:40:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:40:04] [INFO ] [Real]Absence check using state equation in 3153 ms returned unknown
[2022-05-18 03:40:05] [INFO ] [Real]Absence check using 64 positive place invariants in 187 ms returned sat
[2022-05-18 03:40:05] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 278 ms returned unsat
[2022-05-18 03:40:06] [INFO ] [Real]Absence check using 64 positive place invariants in 157 ms returned sat
[2022-05-18 03:40:07] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 492 ms returned sat
[2022-05-18 03:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:40:10] [INFO ] [Real]Absence check using state equation in 3358 ms returned unknown
[2022-05-18 03:40:12] [INFO ] [Real]Absence check using 64 positive place invariants in 170 ms returned sat
[2022-05-18 03:40:12] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 263 ms returned unsat
[2022-05-18 03:40:13] [INFO ] [Real]Absence check using 64 positive place invariants in 179 ms returned sat
[2022-05-18 03:40:14] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 520 ms returned sat
[2022-05-18 03:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:40:17] [INFO ] [Real]Absence check using state equation in 3320 ms returned unknown
[2022-05-18 03:40:18] [INFO ] [Real]Absence check using 64 positive place invariants in 181 ms returned sat
[2022-05-18 03:40:19] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 505 ms returned sat
[2022-05-18 03:40:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:40:22] [INFO ] [Real]Absence check using state equation in 3292 ms returned unknown
[2022-05-18 03:40:23] [INFO ] [Real]Absence check using 64 positive place invariants in 168 ms returned sat
[2022-05-18 03:40:23] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 278 ms returned unsat
[2022-05-18 03:40:25] [INFO ] [Real]Absence check using 64 positive place invariants in 172 ms returned sat
[2022-05-18 03:40:25] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 538 ms returned sat
[2022-05-18 03:40:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:40:28] [INFO ] [Real]Absence check using state equation in 3322 ms returned unknown
[2022-05-18 03:40:30] [INFO ] [Real]Absence check using 64 positive place invariants in 165 ms returned sat
[2022-05-18 03:40:30] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 277 ms returned unsat
[2022-05-18 03:40:31] [INFO ] [Real]Absence check using 64 positive place invariants in 167 ms returned sat
[2022-05-18 03:40:32] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 482 ms returned unsat
[2022-05-18 03:40:33] [INFO ] [Real]Absence check using 64 positive place invariants in 168 ms returned sat
[2022-05-18 03:40:33] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 531 ms returned sat
[2022-05-18 03:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:40:37] [INFO ] [Real]Absence check using state equation in 3324 ms returned unknown
[2022-05-18 03:40:38] [INFO ] [Real]Absence check using 64 positive place invariants in 172 ms returned sat
[2022-05-18 03:40:38] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 486 ms returned sat
[2022-05-18 03:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:40:42] [INFO ] [Real]Absence check using state equation in 3357 ms returned unknown
[2022-05-18 03:40:43] [INFO ] [Real]Absence check using 64 positive place invariants in 169 ms returned sat
[2022-05-18 03:40:43] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 269 ms returned unsat
[2022-05-18 03:40:44] [INFO ] [Real]Absence check using 64 positive place invariants in 162 ms returned sat
[2022-05-18 03:40:44] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 251 ms returned unsat
[2022-05-18 03:40:46] [INFO ] [Real]Absence check using 64 positive place invariants in 159 ms returned sat
[2022-05-18 03:40:46] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 250 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 11106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 11106/11106 places, 16561/16561 transitions.
Graph (complete) has 37715 edges and 11106 vertex of which 11068 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.69 ms
Discarding 38 places :
Also discarding 0 output transitions
Drop transitions removed 2999 transitions
Trivial Post-agglo rules discarded 2999 transitions
Performed 2999 trivial Post agglomeration. Transition count delta: 2999
Iterating post reduction 0 with 2999 rules applied. Total rules applied 3000 place count 11068 transition count 13562
Reduce places removed 2999 places and 0 transitions.
Iterating post reduction 1 with 2999 rules applied. Total rules applied 5999 place count 8069 transition count 13562
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 5999 place count 8069 transition count 13312
Deduced a syphon composed of 250 places in 11 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 6499 place count 7819 transition count 13312
Discarding 2749 places :
Symmetric choice reduction at 2 with 2749 rule applications. Total rules 9248 place count 5070 transition count 10563
Iterating global reduction 2 with 2749 rules applied. Total rules applied 11997 place count 5070 transition count 10563
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 11997 place count 5070 transition count 10554
Deduced a syphon composed of 9 places in 25 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 12015 place count 5061 transition count 10554
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 12564 place count 4512 transition count 7809
Iterating global reduction 2 with 549 rules applied. Total rules applied 13113 place count 4512 transition count 7809
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 22 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 13163 place count 4487 transition count 7784
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 2 with 337 rules applied. Total rules applied 13500 place count 4487 transition count 9643
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 2 with 337 rules applied. Total rules applied 13837 place count 4150 transition count 9643
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 13862 place count 4150 transition count 9643
Applied a total of 13862 rules in 6571 ms. Remains 4150 /11106 variables (removed 6956) and now considering 9643/16561 (removed 6918) transitions.
Finished structural reductions, in 1 iterations. Remains : 4150/11106 places, 9643/16561 transitions.
Normalized transition count is 8757 out of 9643 initially.
// Phase 1: matrix 8757 rows 4150 cols
[2022-05-18 03:40:53] [INFO ] Computed 937 place invariants in 254 ms
Interrupted random walk after 982182 steps, including 31434 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen 2
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4659 ms. (steps per millisecond=214 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4650 ms. (steps per millisecond=215 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4776 ms. (steps per millisecond=209 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4718 ms. (steps per millisecond=211 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4754 ms. (steps per millisecond=210 ) properties (out of 5) seen :0
[2022-05-18 03:41:46] [INFO ] Flow matrix only has 8757 transitions (discarded 886 similar events)
// Phase 1: matrix 8757 rows 4150 cols
[2022-05-18 03:41:46] [INFO ] Computed 937 place invariants in 217 ms
[2022-05-18 03:41:47] [INFO ] [Real]Absence check using 49 positive place invariants in 87 ms returned sat
[2022-05-18 03:41:47] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 211 ms returned sat
[2022-05-18 03:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:41:51] [INFO ] [Real]Absence check using state equation in 3593 ms returned sat
[2022-05-18 03:41:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:41:52] [INFO ] [Nat]Absence check using 49 positive place invariants in 125 ms returned sat
[2022-05-18 03:41:52] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 198 ms returned sat
[2022-05-18 03:41:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:41:55] [INFO ] [Nat]Absence check using state equation in 3246 ms returned sat
[2022-05-18 03:41:55] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2022-05-18 03:41:57] [INFO ] [Nat]Added 5002 Read/Feed constraints in 1771 ms returned sat
[2022-05-18 03:42:02] [INFO ] Deduced a trap composed of 370 places in 4599 ms of which 12 ms to minimize.
[2022-05-18 03:42:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5256 ms
[2022-05-18 03:42:03] [INFO ] Computed and/alt/rep : 4613/6646/4613 causal constraints (skipped 4119 transitions) in 1071 ms.
[2022-05-18 03:42:05] [INFO ] Added : 6 causal constraints over 2 iterations in 2754 ms. Result :sat
[2022-05-18 03:42:06] [INFO ] [Real]Absence check using 49 positive place invariants in 133 ms returned sat
[2022-05-18 03:42:06] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 205 ms returned sat
[2022-05-18 03:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:42:10] [INFO ] [Real]Absence check using state equation in 3547 ms returned sat
[2022-05-18 03:42:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:42:11] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2022-05-18 03:42:11] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 196 ms returned sat
[2022-05-18 03:42:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:42:15] [INFO ] [Nat]Absence check using state equation in 3824 ms returned sat
[2022-05-18 03:42:16] [INFO ] [Nat]Added 5002 Read/Feed constraints in 1694 ms returned unsat
[2022-05-18 03:42:17] [INFO ] [Real]Absence check using 49 positive place invariants in 83 ms returned sat
[2022-05-18 03:42:17] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 210 ms returned sat
[2022-05-18 03:42:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:42:20] [INFO ] [Real]Absence check using state equation in 3231 ms returned sat
[2022-05-18 03:42:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:42:21] [INFO ] [Nat]Absence check using 49 positive place invariants in 78 ms returned sat
[2022-05-18 03:42:21] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 215 ms returned sat
[2022-05-18 03:42:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:42:25] [INFO ] [Nat]Absence check using state equation in 3538 ms returned sat
[2022-05-18 03:42:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:42:29] [INFO ] [Nat]Added 5002 Read/Feed constraints in 4170 ms returned sat
[2022-05-18 03:42:30] [INFO ] Computed and/alt/rep : 4613/6646/4613 causal constraints (skipped 4119 transitions) in 762 ms.
[2022-05-18 03:42:32] [INFO ] Added : 8 causal constraints over 2 iterations in 2428 ms. Result :sat
[2022-05-18 03:42:32] [INFO ] [Real]Absence check using 49 positive place invariants in 76 ms returned sat
[2022-05-18 03:42:32] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 203 ms returned sat
[2022-05-18 03:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:42:36] [INFO ] [Real]Absence check using state equation in 3081 ms returned sat
[2022-05-18 03:42:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:42:36] [INFO ] [Nat]Absence check using 49 positive place invariants in 77 ms returned sat
[2022-05-18 03:42:36] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 210 ms returned sat
[2022-05-18 03:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:42:40] [INFO ] [Nat]Absence check using state equation in 3430 ms returned sat
[2022-05-18 03:42:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:42:46] [INFO ] [Nat]Added 5002 Read/Feed constraints in 6273 ms returned unknown
[2022-05-18 03:42:47] [INFO ] [Real]Absence check using 49 positive place invariants in 77 ms returned sat
[2022-05-18 03:42:47] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 207 ms returned sat
[2022-05-18 03:42:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:42:50] [INFO ] [Real]Absence check using state equation in 3442 ms returned sat
[2022-05-18 03:42:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:42:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2022-05-18 03:42:51] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 195 ms returned sat
[2022-05-18 03:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:42:54] [INFO ] [Nat]Absence check using state equation in 3168 ms returned sat
[2022-05-18 03:42:55] [INFO ] [Nat]Added 5002 Read/Feed constraints in 1182 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 0, 1, 1, 0] Max seen :[0, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 4150 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4150/4150 places, 9643/9643 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4150 transition count 9642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4149 transition count 9642
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 4149 transition count 9641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 4148 transition count 9641
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 4147 transition count 9640
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 4147 transition count 9640
Applied a total of 6 rules in 1482 ms. Remains 4147 /4150 variables (removed 3) and now considering 9640/9643 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 4147/4150 places, 9640/9643 transitions.
Normalized transition count is 8754 out of 9640 initially.
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:42:57] [INFO ] Computed 937 place invariants in 227 ms
Incomplete random walk after 1000000 steps, including 32006 resets, run finished after 29804 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3902 resets, run finished after 4697 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4661 ms. (steps per millisecond=214 ) properties (out of 2) seen :0
[2022-05-18 03:43:37] [INFO ] Flow matrix only has 8754 transitions (discarded 886 similar events)
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:43:37] [INFO ] Computed 937 place invariants in 222 ms
[2022-05-18 03:43:37] [INFO ] [Real]Absence check using 49 positive place invariants in 89 ms returned sat
[2022-05-18 03:43:37] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 221 ms returned sat
[2022-05-18 03:43:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:43:41] [INFO ] [Real]Absence check using state equation in 3806 ms returned sat
[2022-05-18 03:43:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:43:42] [INFO ] [Nat]Absence check using 49 positive place invariants in 91 ms returned sat
[2022-05-18 03:43:42] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 235 ms returned sat
[2022-05-18 03:43:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:43:46] [INFO ] [Nat]Absence check using state equation in 3685 ms returned sat
[2022-05-18 03:43:46] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2022-05-18 03:43:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:43:50] [INFO ] [Nat]Added 5002 Read/Feed constraints in 3605 ms returned sat
[2022-05-18 03:43:54] [INFO ] Deduced a trap composed of 683 places in 4421 ms of which 5 ms to minimize.
[2022-05-18 03:43:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5008 ms
[2022-05-18 03:43:55] [INFO ] Computed and/alt/rep : 4610/6642/4610 causal constraints (skipped 4119 transitions) in 596 ms.
[2022-05-18 03:43:57] [INFO ] Added : 8 causal constraints over 2 iterations in 2141 ms. Result :sat
[2022-05-18 03:43:57] [INFO ] [Real]Absence check using 49 positive place invariants in 79 ms returned sat
[2022-05-18 03:43:58] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 217 ms returned sat
[2022-05-18 03:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:44:01] [INFO ] [Real]Absence check using state equation in 3602 ms returned sat
[2022-05-18 03:44:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:44:02] [INFO ] [Nat]Absence check using 49 positive place invariants in 78 ms returned sat
[2022-05-18 03:44:02] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 203 ms returned sat
[2022-05-18 03:44:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:44:06] [INFO ] [Nat]Absence check using state equation in 4000 ms returned sat
[2022-05-18 03:44:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:44:11] [INFO ] [Nat]Added 5002 Read/Feed constraints in 5145 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 0] Max seen :[0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 4147 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4147/4147 places, 9640/9640 transitions.
Applied a total of 0 rules in 569 ms. Remains 4147 /4147 variables (removed 0) and now considering 9640/9640 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4147/4147 places, 9640/9640 transitions.
Normalized transition count is 8754 out of 9640 initially.
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:44:12] [INFO ] Computed 937 place invariants in 213 ms
Interrupted random walk after 917636 steps, including 29372 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 0
Interrupted Best-First random walk after 944908 steps, including 3687 resets, run timeout after 5001 ms. (steps per millisecond=188 ) properties seen 0
[2022-05-18 03:44:47] [INFO ] Flow matrix only has 8754 transitions (discarded 886 similar events)
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:44:48] [INFO ] Computed 937 place invariants in 213 ms
[2022-05-18 03:44:48] [INFO ] [Real]Absence check using 49 positive place invariants in 80 ms returned sat
[2022-05-18 03:44:48] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 223 ms returned sat
[2022-05-18 03:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:44:52] [INFO ] [Real]Absence check using state equation in 3617 ms returned sat
[2022-05-18 03:44:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:44:53] [INFO ] [Nat]Absence check using 49 positive place invariants in 82 ms returned sat
[2022-05-18 03:44:53] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 217 ms returned sat
[2022-05-18 03:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:44:56] [INFO ] [Nat]Absence check using state equation in 3403 ms returned sat
[2022-05-18 03:44:56] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2022-05-18 03:45:00] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:45:00] [INFO ] [Nat]Added 5002 Read/Feed constraints in 3609 ms returned sat
[2022-05-18 03:45:04] [INFO ] Deduced a trap composed of 683 places in 4379 ms of which 4 ms to minimize.
[2022-05-18 03:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4966 ms
[2022-05-18 03:45:05] [INFO ] Computed and/alt/rep : 4610/6642/4610 causal constraints (skipped 4119 transitions) in 623 ms.
[2022-05-18 03:45:07] [INFO ] Added : 8 causal constraints over 2 iterations in 2237 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4147 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4147/4147 places, 9640/9640 transitions.
Applied a total of 0 rules in 466 ms. Remains 4147 /4147 variables (removed 0) and now considering 9640/9640 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4147/4147 places, 9640/9640 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4147/4147 places, 9640/9640 transitions.
Applied a total of 0 rules in 455 ms. Remains 4147 /4147 variables (removed 0) and now considering 9640/9640 (removed 0) transitions.
[2022-05-18 03:45:08] [INFO ] Flow matrix only has 8754 transitions (discarded 886 similar events)
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:45:09] [INFO ] Computed 937 place invariants in 216 ms
[2022-05-18 03:45:13] [INFO ] Implicit Places using invariants in 4338 ms returned []
[2022-05-18 03:45:13] [INFO ] Flow matrix only has 8754 transitions (discarded 886 similar events)
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:45:13] [INFO ] Computed 937 place invariants in 213 ms
[2022-05-18 03:45:17] [INFO ] Implicit Places using invariants and state equation in 4192 ms returned []
Implicit Place search using SMT with State Equation took 8577 ms to find 0 implicit places.
[2022-05-18 03:45:18] [INFO ] Redundant transitions in 1401 ms returned []
[2022-05-18 03:45:18] [INFO ] Flow matrix only has 8754 transitions (discarded 886 similar events)
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:45:19] [INFO ] Computed 937 place invariants in 236 ms
[2022-05-18 03:45:24] [INFO ] Dead Transitions using invariants and state equation in 5298 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4147/4147 places, 9640/9640 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-05
Normalized transition count is 8754 out of 9640 initially.
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:45:24] [INFO ] Computed 937 place invariants in 213 ms
Incomplete random walk after 10000 steps, including 320 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
[2022-05-18 03:45:24] [INFO ] Flow matrix only has 8754 transitions (discarded 886 similar events)
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:45:25] [INFO ] Computed 937 place invariants in 257 ms
[2022-05-18 03:45:25] [INFO ] [Real]Absence check using 49 positive place invariants in 80 ms returned sat
[2022-05-18 03:45:25] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 212 ms returned sat
[2022-05-18 03:45:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:45:29] [INFO ] [Real]Absence check using state equation in 3593 ms returned sat
[2022-05-18 03:45:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:45:29] [INFO ] [Nat]Absence check using 49 positive place invariants in 79 ms returned sat
[2022-05-18 03:45:30] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 214 ms returned sat
[2022-05-18 03:45:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:45:33] [INFO ] [Nat]Absence check using state equation in 3166 ms returned sat
[2022-05-18 03:45:33] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2022-05-18 03:45:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:45:34] [INFO ] [Nat]Added 5002 Read/Feed constraints in 1166 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4147 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4147/4147 places, 9640/9640 transitions.
Applied a total of 0 rules in 502 ms. Remains 4147 /4147 variables (removed 0) and now considering 9640/9640 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4147/4147 places, 9640/9640 transitions.
Normalized transition count is 8754 out of 9640 initially.
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:45:35] [INFO ] Computed 937 place invariants in 212 ms
Interrupted random walk after 929197 steps, including 29748 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 0
Interrupted Best-First random walk after 995462 steps, including 3885 resets, run timeout after 5001 ms. (steps per millisecond=199 ) properties seen 0
[2022-05-18 03:46:10] [INFO ] Flow matrix only has 8754 transitions (discarded 886 similar events)
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:46:10] [INFO ] Computed 937 place invariants in 217 ms
[2022-05-18 03:46:11] [INFO ] [Real]Absence check using 49 positive place invariants in 83 ms returned sat
[2022-05-18 03:46:11] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 229 ms returned sat
[2022-05-18 03:46:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:46:14] [INFO ] [Real]Absence check using state equation in 3720 ms returned sat
[2022-05-18 03:46:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:46:15] [INFO ] [Nat]Absence check using 49 positive place invariants in 82 ms returned sat
[2022-05-18 03:46:15] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 219 ms returned sat
[2022-05-18 03:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:46:19] [INFO ] [Nat]Absence check using state equation in 3456 ms returned sat
[2022-05-18 03:46:19] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2022-05-18 03:46:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:46:22] [INFO ] [Nat]Added 5002 Read/Feed constraints in 3348 ms returned sat
[2022-05-18 03:46:27] [INFO ] Deduced a trap composed of 683 places in 4387 ms of which 5 ms to minimize.
[2022-05-18 03:46:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4999 ms
[2022-05-18 03:46:28] [INFO ] Computed and/alt/rep : 4610/6642/4610 causal constraints (skipped 4119 transitions) in 605 ms.
[2022-05-18 03:46:29] [INFO ] Added : 8 causal constraints over 2 iterations in 2121 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4147 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4147/4147 places, 9640/9640 transitions.
Applied a total of 0 rules in 509 ms. Remains 4147 /4147 variables (removed 0) and now considering 9640/9640 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4147/4147 places, 9640/9640 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4147/4147 places, 9640/9640 transitions.
Applied a total of 0 rules in 546 ms. Remains 4147 /4147 variables (removed 0) and now considering 9640/9640 (removed 0) transitions.
[2022-05-18 03:46:31] [INFO ] Flow matrix only has 8754 transitions (discarded 886 similar events)
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:46:31] [INFO ] Computed 937 place invariants in 204 ms
[2022-05-18 03:46:35] [INFO ] Implicit Places using invariants in 4213 ms returned []
[2022-05-18 03:46:35] [INFO ] Flow matrix only has 8754 transitions (discarded 886 similar events)
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:46:35] [INFO ] Computed 937 place invariants in 209 ms
[2022-05-18 03:46:39] [INFO ] Implicit Places using invariants and state equation in 4239 ms returned []
Implicit Place search using SMT with State Equation took 8456 ms to find 0 implicit places.
[2022-05-18 03:46:40] [INFO ] Redundant transitions in 949 ms returned []
[2022-05-18 03:46:40] [INFO ] Flow matrix only has 8754 transitions (discarded 886 similar events)
// Phase 1: matrix 8754 rows 4147 cols
[2022-05-18 03:46:41] [INFO ] Computed 937 place invariants in 220 ms
[2022-05-18 03:46:47] [INFO ] Dead Transitions using invariants and state equation in 7147 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4147/4147 places, 9640/9640 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-05 in 83799 ms.
[2022-05-18 03:46:48] [INFO ] Flatten gal took : 744 ms
[2022-05-18 03:46:49] [INFO ] Applying decomposition
[2022-05-18 03:46:49] [INFO ] Flatten gal took : 473 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4496443026327841863.txt' '-o' '/tmp/graph4496443026327841863.bin' '-w' '/tmp/graph4496443026327841863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4496443026327841863.bin' '-l' '-1' '-v' '-w' '/tmp/graph4496443026327841863.weights' '-q' '0' '-e' '0.001'
[2022-05-18 03:46:50] [INFO ] Decomposing Gal with order
[2022-05-18 03:46:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 03:46:54] [INFO ] Removed a total of 16946 redundant transitions.
[2022-05-18 03:46:55] [INFO ] Flatten gal took : 3542 ms
[2022-05-18 03:46:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 5510 labels/synchronizations in 787 ms.
[2022-05-18 03:46:56] [INFO ] Time to serialize gal into /tmp/UpperBounds6507945377170644161.gal : 149 ms
[2022-05-18 03:46:56] [INFO ] Time to serialize properties into /tmp/UpperBounds15938787968108334965.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6507945377170644161.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15938787968108334965.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds15938787968108334965.prop.
Detected timeout of ITS tools.
[2022-05-18 04:09:35] [INFO ] Flatten gal took : 2068 ms
[2022-05-18 04:09:37] [INFO ] Time to serialize gal into /tmp/UpperBounds9668677965080707477.gal : 1967 ms
[2022-05-18 04:09:37] [INFO ] Time to serialize properties into /tmp/UpperBounds9588492279328365280.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9668677965080707477.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9588492279328365280.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds9588492279328365280.prop.
Detected timeout of ITS tools.
[2022-05-18 04:32:09] [INFO ] Flatten gal took : 5272 ms
[2022-05-18 04:32:11] [INFO ] Input system was already deterministic with 9640 transitions.
[2022-05-18 04:32:11] [INFO ] Transformed 4147 places.
[2022-05-18 04:32:11] [INFO ] Transformed 9640 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 04:32:42] [INFO ] Time to serialize gal into /tmp/UpperBounds3479082589291364137.gal : 48 ms
[2022-05-18 04:32:42] [INFO ] Time to serialize properties into /tmp/UpperBounds8219247043338052357.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3479082589291364137.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8219247043338052357.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds8219247043338052357.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S24C05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S24C05, 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 r132-tall-165271821300733"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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