fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124157000771
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S32C09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16245.775 3600000.00 3646249.00 33112.30 ? 1 1 1 1 1 1 ? ? ? 1 ? 1 ? ? ? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 60M
-rw-r--r-- 1 mcc users 67K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 232K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 12 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 12 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.8K May 11 19:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 11 19:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 11 16:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 16:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 12 04:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 12 04:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 59M May 12 08:13 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 gen-UpperBounds-00
FORMULA_NAME gen-UpperBounds-01
FORMULA_NAME gen-UpperBounds-02
FORMULA_NAME gen-UpperBounds-03
FORMULA_NAME gen-UpperBounds-04
FORMULA_NAME gen-UpperBounds-05
FORMULA_NAME gen-UpperBounds-06
FORMULA_NAME gen-UpperBounds-07
FORMULA_NAME gen-UpperBounds-08
FORMULA_NAME gen-UpperBounds-09
FORMULA_NAME gen-UpperBounds-10
FORMULA_NAME gen-UpperBounds-11
FORMULA_NAME gen-UpperBounds-12
FORMULA_NAME gen-UpperBounds-13
FORMULA_NAME gen-UpperBounds-14
FORMULA_NAME gen-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621402441652

Running Version 0
[2021-05-19 05:34:03] [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]
[2021-05-19 05:34:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 05:34:04] [INFO ] Load time of PNML (sax parser for PT used): 1405 ms
[2021-05-19 05:34:04] [INFO ] Transformed 29770 places.
[2021-05-19 05:34:05] [INFO ] Transformed 44921 transitions.
[2021-05-19 05:34:05] [INFO ] Parsed PT model containing 29770 places and 44921 transitions in 1656 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Normalized transition count is 43865 out of 44921 initially.
// Phase 1: matrix 43865 rows 29770 cols
[2021-05-19 05:34:17] [INFO ] Computed 1823 place invariants in 11847 ms
Incomplete random walk after 10000 steps, including 108 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 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 16 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 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 16 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
[2021-05-19 05:34:19] [INFO ] Flow matrix only has 43865 transitions (discarded 1056 similar events)
// Phase 1: matrix 43865 rows 29770 cols
[2021-05-19 05:34:30] [INFO ] Computed 1823 place invariants in 11001 ms
[2021-05-19 05:34:35] [INFO ] [Real]Absence check using 88 positive place invariants in 216 ms returned unknown
[2021-05-19 05:34:40] [INFO ] [Real]Absence check using 88 positive place invariants in 546 ms returned unknown
[2021-05-19 05:34:45] [INFO ] [Real]Absence check using 88 positive place invariants in 525 ms returned unknown
[2021-05-19 05:34:50] [INFO ] [Real]Absence check using 88 positive place invariants in 346 ms returned unknown
[2021-05-19 05:34:55] [INFO ] [Real]Absence check using 88 positive place invariants in 664 ms returned unknown
[2021-05-19 05:35:00] [INFO ] [Real]Absence check using 88 positive place invariants in 608 ms returned unknown
[2021-05-19 05:35:05] [INFO ] [Real]Absence check using 88 positive place invariants in 340 ms returned unknown
[2021-05-19 05:35:10] [INFO ] [Real]Absence check using 88 positive place invariants in 886 ms returned unknown
[2021-05-19 05:35:15] [INFO ] [Real]Absence check using 88 positive place invariants in 608 ms returned unknown
[2021-05-19 05:35:20] [INFO ] [Real]Absence check using 88 positive place invariants in 501 ms returned unknown
[2021-05-19 05:35:25] [INFO ] [Real]Absence check using 88 positive place invariants in 592 ms returned unknown
[2021-05-19 05:35:30] [INFO ] [Real]Absence check using 88 positive place invariants in 693 ms returned unknown
[2021-05-19 05:35:35] [INFO ] [Real]Absence check using 88 positive place invariants in 923 ms returned unknown
[2021-05-19 05:35:40] [INFO ] [Real]Absence check using 88 positive place invariants in 610 ms returned unknown
[2021-05-19 05:35:45] [INFO ] [Real]Absence check using 88 positive place invariants in 932 ms returned unknown
[2021-05-19 05:35:50] [INFO ] [Real]Absence check using 88 positive place invariants in 915 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 33, 99, 99, 33, 99, 99, 33, 1, 99, 33, 1, 99, 1, 1, 1] Max seen :[0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 29770 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29770/29770 places, 44921/44921 transitions.
Graph (complete) has 99155 edges and 29770 vertex of which 29716 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.84 ms
Discarding 54 places :
Also discarding 0 output transitions
Drop transitions removed 9495 transitions
Trivial Post-agglo rules discarded 9495 transitions
Performed 9495 trivial Post agglomeration. Transition count delta: 9495
Iterating post reduction 0 with 9495 rules applied. Total rules applied 9496 place count 29716 transition count 35426
Reduce places removed 9495 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 9501 rules applied. Total rules applied 18997 place count 20221 transition count 35420
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 19003 place count 20215 transition count 35420
Performed 594 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 594 Pre rules applied. Total rules applied 19003 place count 20215 transition count 34826
Deduced a syphon composed of 594 places in 51 ms
Reduce places removed 594 places and 0 transitions.
Iterating global reduction 3 with 1188 rules applied. Total rules applied 20191 place count 19621 transition count 34826
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 76 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 20257 place count 19588 transition count 34793
Free-agglomeration rule (complex) applied 1576 times.
Iterating global reduction 3 with 1576 rules applied. Total rules applied 21833 place count 19588 transition count 33217
Reduce places removed 1576 places and 0 transitions.
Iterating post reduction 3 with 1576 rules applied. Total rules applied 23409 place count 18012 transition count 33217
Partial Free-agglomeration rule applied 4215 times.
Drop transitions removed 4215 transitions
Iterating global reduction 4 with 4215 rules applied. Total rules applied 27624 place count 18012 transition count 33217
Applied a total of 27624 rules in 12324 ms. Remains 18012 /29770 variables (removed 11758) and now considering 33217/44921 (removed 11704) transitions.
Finished structural reductions, in 1 iterations. Remains : 18012/29770 places, 33217/44921 transitions.
Normalized transition count is 31651 out of 33217 initially.
// Phase 1: matrix 31651 rows 18012 cols
[2021-05-19 05:36:16] [INFO ] Computed 1769 place invariants in 12952 ms
FORMULA gen-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 278915 steps, including 5037 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1, 11=1}
FORMULA gen-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 414525 steps, including 729 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen :{}
Interrupted Best-First random walk after 406775 steps, including 715 resets, run timeout after 5001 ms. (steps per millisecond=81 ) properties seen :{1=1, 2=1, 3=1, 4=1, 10=1}
Interrupted Best-First random walk after 423273 steps, including 744 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen :{1=1, 2=1, 3=1, 4=1, 10=1}
Interrupted Best-First random walk after 426093 steps, including 749 resets, run timeout after 5001 ms. (steps per millisecond=85 ) properties seen :{1=1, 2=1, 3=1, 4=1, 8=1, 10=1}
FORMULA gen-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 421756 steps, including 742 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen :{2=1, 3=1, 4=1, 9=1}
Interrupted Best-First random walk after 424857 steps, including 747 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen :{1=1, 2=1, 3=1, 9=1}
Interrupted Best-First random walk after 424500 steps, including 746 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen :{1=1, 2=1, 3=1, 4=1, 9=1}
Interrupted Best-First random walk after 419328 steps, including 737 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :{1=1, 2=1, 3=1, 4=1, 9=1}
Interrupted Best-First random walk after 420999 steps, including 740 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen :{2=1, 3=1, 4=1, 9=1}
Interrupted Best-First random walk after 425070 steps, including 747 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen :{1=1, 2=1}
Interrupted Best-First random walk after 420454 steps, including 739 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen :{4=1, 9=1}
Interrupted Best-First random walk after 421111 steps, including 740 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen :{3=1, 4=1, 9=1}
Interrupted Best-First random walk after 425414 steps, including 748 resets, run timeout after 5001 ms. (steps per millisecond=85 ) properties seen :{1=1, 2=1, 4=1}
[2021-05-19 05:37:51] [INFO ] Flow matrix only has 31651 transitions (discarded 1566 similar events)
// Phase 1: matrix 31651 rows 18012 cols
[2021-05-19 05:38:05] [INFO ] Computed 1769 place invariants in 13810 ms
[2021-05-19 05:38:07] [INFO ] [Real]Absence check using 65 positive place invariants in 589 ms returned sat
[2021-05-19 05:38:08] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1021 ms returned sat
[2021-05-19 05:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:38:50] [INFO ] [Real]Absence check using state equation in 41276 ms returned unknown
[2021-05-19 05:38:52] [INFO ] [Real]Absence check using 65 positive place invariants in 620 ms returned sat
[2021-05-19 05:38:53] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 446 ms returned unsat
[2021-05-19 05:38:55] [INFO ] [Real]Absence check using 65 positive place invariants in 592 ms returned sat
[2021-05-19 05:38:56] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 456 ms returned unsat
[2021-05-19 05:38:59] [INFO ] [Real]Absence check using 65 positive place invariants in 592 ms returned sat
[2021-05-19 05:38:59] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 782 ms returned unsat
[2021-05-19 05:39:02] [INFO ] [Real]Absence check using 65 positive place invariants in 600 ms returned sat
[2021-05-19 05:39:03] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 670 ms returned unsat
[2021-05-19 05:39:06] [INFO ] [Real]Absence check using 65 positive place invariants in 595 ms returned sat
[2021-05-19 05:39:07] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1202 ms returned sat
[2021-05-19 05:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:39:48] [INFO ] [Real]Absence check using state equation in 41124 ms returned unknown
[2021-05-19 05:39:51] [INFO ] [Real]Absence check using 65 positive place invariants in 577 ms returned sat
[2021-05-19 05:39:52] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1053 ms returned sat
[2021-05-19 05:39:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:40:33] [INFO ] [Real]Absence check using state equation in 41255 ms returned unknown
[2021-05-19 05:40:36] [INFO ] [Real]Absence check using 65 positive place invariants in 591 ms returned sat
[2021-05-19 05:40:37] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 988 ms returned sat
[2021-05-19 05:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:41:18] [INFO ] [Real]Absence check using state equation in 41439 ms returned unknown
[2021-05-19 05:41:21] [INFO ] [Real]Absence check using 65 positive place invariants in 585 ms returned sat
[2021-05-19 05:41:22] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 901 ms returned sat
[2021-05-19 05:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:42:03] [INFO ] [Real]Absence check using state equation in 41502 ms returned unknown
[2021-05-19 05:42:06] [INFO ] [Real]Absence check using 65 positive place invariants in 559 ms returned sat
[2021-05-19 05:42:07] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 908 ms returned unsat
[2021-05-19 05:42:09] [INFO ] [Real]Absence check using 65 positive place invariants in 572 ms returned sat
[2021-05-19 05:42:10] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 964 ms returned sat
[2021-05-19 05:42:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:42:52] [INFO ] [Real]Absence check using state equation in 41138 ms returned unknown
[2021-05-19 05:42:54] [INFO ] [Real]Absence check using 65 positive place invariants in 596 ms returned sat
[2021-05-19 05:42:55] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 880 ms returned sat
[2021-05-19 05:42:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:43:37] [INFO ] [Real]Absence check using state equation in 41369 ms returned unknown
[2021-05-19 05:43:39] [INFO ] [Real]Absence check using 65 positive place invariants in 591 ms returned sat
[2021-05-19 05:43:40] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1050 ms returned sat
[2021-05-19 05:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:44:22] [INFO ] [Real]Absence check using state equation in 41264 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1] Max seen :[0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA gen-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 18012 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18012/18012 places, 33217/33217 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 18012 transition count 33215
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 18010 transition count 33215
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 18010 transition count 33209
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 16 place count 18004 transition count 33209
Applied a total of 16 rules in 2947 ms. Remains 18004 /18012 variables (removed 8) and now considering 33209/33217 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 18004/18012 places, 33209/33217 transitions.
Normalized transition count is 31643 out of 33209 initially.
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 05:44:39] [INFO ] Computed 1769 place invariants in 14361 ms
Interrupted random walk after 284404 steps, including 5135 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen :{}
Interrupted Best-First random walk after 414302 steps, including 728 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen :{}
Interrupted Best-First random walk after 416442 steps, including 732 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :{}
Interrupted Best-First random walk after 414622 steps, including 729 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen :{}
Interrupted Best-First random walk after 414135 steps, including 728 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen :{}
Interrupted Best-First random walk after 415327 steps, including 730 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :{}
Interrupted Best-First random walk after 412523 steps, including 725 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen :{}
Interrupted Best-First random walk after 414472 steps, including 729 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen :{}
Interrupted Best-First random walk after 431067 steps, including 758 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen :{}
[2021-05-19 05:45:49] [INFO ] Flow matrix only has 31643 transitions (discarded 1566 similar events)
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 05:46:03] [INFO ] Computed 1769 place invariants in 13550 ms
[2021-05-19 05:46:05] [INFO ] [Real]Absence check using 65 positive place invariants in 604 ms returned sat
[2021-05-19 05:46:06] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 911 ms returned sat
[2021-05-19 05:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:46:48] [INFO ] [Real]Absence check using state equation in 41336 ms returned unknown
[2021-05-19 05:46:50] [INFO ] [Real]Absence check using 65 positive place invariants in 603 ms returned sat
[2021-05-19 05:46:51] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1018 ms returned sat
[2021-05-19 05:46:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:47:33] [INFO ] [Real]Absence check using state equation in 41417 ms returned unknown
[2021-05-19 05:47:35] [INFO ] [Real]Absence check using 65 positive place invariants in 604 ms returned sat
[2021-05-19 05:47:36] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 946 ms returned sat
[2021-05-19 05:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:48:18] [INFO ] [Real]Absence check using state equation in 41392 ms returned unknown
[2021-05-19 05:48:20] [INFO ] [Real]Absence check using 65 positive place invariants in 603 ms returned sat
[2021-05-19 05:48:21] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 935 ms returned sat
[2021-05-19 05:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:49:03] [INFO ] [Real]Absence check using state equation in 41221 ms returned unknown
[2021-05-19 05:49:05] [INFO ] [Real]Absence check using 65 positive place invariants in 617 ms returned sat
[2021-05-19 05:49:06] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 936 ms returned sat
[2021-05-19 05:49:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:49:48] [INFO ] [Real]Absence check using state equation in 41236 ms returned unknown
[2021-05-19 05:49:50] [INFO ] [Real]Absence check using 65 positive place invariants in 604 ms returned sat
[2021-05-19 05:49:51] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 885 ms returned sat
[2021-05-19 05:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:50:33] [INFO ] [Real]Absence check using state equation in 41403 ms returned unknown
[2021-05-19 05:50:35] [INFO ] [Real]Absence check using 65 positive place invariants in 611 ms returned sat
[2021-05-19 05:50:36] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 927 ms returned sat
[2021-05-19 05:50:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:51:18] [INFO ] [Real]Absence check using state equation in 41405 ms returned unknown
[2021-05-19 05:51:20] [INFO ] [Real]Absence check using 65 positive place invariants in 617 ms returned sat
[2021-05-19 05:51:21] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 882 ms returned sat
[2021-05-19 05:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:52:03] [INFO ] [Real]Absence check using state equation in 41331 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 2, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 18004 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18004/18004 places, 33209/33209 transitions.
Applied a total of 0 rules in 1363 ms. Remains 18004 /18004 variables (removed 0) and now considering 33209/33209 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18004/18004 places, 33209/33209 transitions.
Starting structural reductions, iteration 0 : 18004/18004 places, 33209/33209 transitions.
Applied a total of 0 rules in 1343 ms. Remains 18004 /18004 variables (removed 0) and now considering 33209/33209 (removed 0) transitions.
[2021-05-19 05:52:05] [INFO ] Flow matrix only has 31643 transitions (discarded 1566 similar events)
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 05:52:19] [INFO ] Computed 1769 place invariants in 13304 ms
[2021-05-19 05:52:20] [INFO ] Implicit Places using invariants in 14947 ms returned []
Implicit Place search using SMT only with invariants took 14956 ms to find 0 implicit places.
[2021-05-19 05:52:20] [INFO ] Flow matrix only has 31643 transitions (discarded 1566 similar events)
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 05:52:40] [INFO ] Computed 1769 place invariants in 19945 ms
[2021-05-19 05:52:42] [INFO ] Dead Transitions using invariants and state equation in 21717 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18004/18004 places, 33209/33209 transitions.
Starting property specific reduction for gen-UpperBounds-00
Normalized transition count is 31643 out of 33209 initially.
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 05:52:58] [INFO ] Computed 1769 place invariants in 13646 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 1085 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
[2021-05-19 05:53:00] [INFO ] Flow matrix only has 31643 transitions (discarded 1566 similar events)
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 05:53:14] [INFO ] Computed 1769 place invariants in 14234 ms
[2021-05-19 05:53:16] [INFO ] [Real]Absence check using 65 positive place invariants in 618 ms returned sat
[2021-05-19 05:53:18] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1177 ms returned sat
[2021-05-19 05:53:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:53:19] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18004 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18004/18004 places, 33209/33209 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 18004 transition count 33208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18003 transition count 33208
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 18003 transition count 33206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 18001 transition count 33206
Applied a total of 6 rules in 2945 ms. Remains 18001 /18004 variables (removed 3) and now considering 33206/33209 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 18001/18004 places, 33206/33209 transitions.
Normalized transition count is 31640 out of 33206 initially.
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 05:53:38] [INFO ] Computed 1769 place invariants in 15876 ms
Interrupted random walk after 285416 steps, including 5155 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen :{}
Interrupted Best-First random walk after 418879 steps, including 736 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :{}
[2021-05-19 05:54:13] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 05:54:28] [INFO ] Computed 1769 place invariants in 14777 ms
[2021-05-19 05:54:30] [INFO ] [Real]Absence check using 65 positive place invariants in 597 ms returned sat
[2021-05-19 05:54:31] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 885 ms returned sat
[2021-05-19 05:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:55:13] [INFO ] [Real]Absence check using state equation in 41493 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18001 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1313 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18001/18001 places, 33206/33206 transitions.
Starting structural reductions, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1321 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
[2021-05-19 05:55:15] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 05:55:29] [INFO ] Computed 1769 place invariants in 13341 ms
[2021-05-19 05:55:30] [INFO ] Implicit Places using invariants in 15035 ms returned []
Implicit Place search using SMT only with invariants took 15035 ms to find 0 implicit places.
[2021-05-19 05:55:30] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 05:55:44] [INFO ] Computed 1769 place invariants in 13297 ms
[2021-05-19 05:55:45] [INFO ] Dead Transitions using invariants and state equation in 14933 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18001/18001 places, 33206/33206 transitions.
Ending property specific reduction for gen-UpperBounds-00 in 183079 ms.
Starting property specific reduction for gen-UpperBounds-07
Normalized transition count is 31643 out of 33209 initially.
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 05:55:59] [INFO ] Computed 1769 place invariants in 13475 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 1097 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
[2021-05-19 05:56:00] [INFO ] Flow matrix only has 31643 transitions (discarded 1566 similar events)
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 05:56:13] [INFO ] Computed 1769 place invariants in 13495 ms
[2021-05-19 05:56:16] [INFO ] [Real]Absence check using 65 positive place invariants in 606 ms returned sat
[2021-05-19 05:56:17] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 930 ms returned sat
[2021-05-19 05:56:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:56:18] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18004 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18004/18004 places, 33209/33209 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 18004 transition count 33208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 18003 transition count 33208
Applied a total of 2 rules in 2781 ms. Remains 18003 /18004 variables (removed 1) and now considering 33208/33209 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 18003/18004 places, 33208/33209 transitions.
Normalized transition count is 31642 out of 33208 initially.
// Phase 1: matrix 31642 rows 18003 cols
[2021-05-19 05:56:36] [INFO ] Computed 1769 place invariants in 14590 ms
Interrupted random walk after 277606 steps, including 5013 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen :{}
Interrupted Best-First random walk after 426557 steps, including 750 resets, run timeout after 5001 ms. (steps per millisecond=85 ) properties seen :{}
[2021-05-19 05:57:11] [INFO ] Flow matrix only has 31642 transitions (discarded 1566 similar events)
// Phase 1: matrix 31642 rows 18003 cols
[2021-05-19 05:57:25] [INFO ] Computed 1769 place invariants in 13623 ms
[2021-05-19 05:57:27] [INFO ] [Real]Absence check using 65 positive place invariants in 592 ms returned sat
[2021-05-19 05:57:28] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 852 ms returned sat
[2021-05-19 05:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:58:10] [INFO ] [Real]Absence check using state equation in 41528 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Applied a total of 0 rules in 1299 ms. Remains 18003 /18003 variables (removed 0) and now considering 33208/33208 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18003/18003 places, 33208/33208 transitions.
Starting structural reductions, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Applied a total of 0 rules in 1282 ms. Remains 18003 /18003 variables (removed 0) and now considering 33208/33208 (removed 0) transitions.
[2021-05-19 05:58:12] [INFO ] Flow matrix only has 31642 transitions (discarded 1566 similar events)
// Phase 1: matrix 31642 rows 18003 cols
[2021-05-19 05:58:26] [INFO ] Computed 1769 place invariants in 13901 ms
[2021-05-19 05:58:28] [INFO ] Implicit Places using invariants in 15618 ms returned []
Implicit Place search using SMT only with invariants took 15619 ms to find 0 implicit places.
[2021-05-19 05:58:28] [INFO ] Flow matrix only has 31642 transitions (discarded 1566 similar events)
// Phase 1: matrix 31642 rows 18003 cols
[2021-05-19 05:58:45] [INFO ] Computed 1769 place invariants in 17050 ms
[2021-05-19 05:58:46] [INFO ] Dead Transitions using invariants and state equation in 18673 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18003/18003 places, 33208/33208 transitions.
Ending property specific reduction for gen-UpperBounds-07 in 181284 ms.
Starting property specific reduction for gen-UpperBounds-08
Normalized transition count is 31643 out of 33209 initially.
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 05:59:02] [INFO ] Computed 1769 place invariants in 15018 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 1121 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
[2021-05-19 05:59:03] [INFO ] Flow matrix only has 31643 transitions (discarded 1566 similar events)
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 05:59:18] [INFO ] Computed 1769 place invariants in 14709 ms
[2021-05-19 05:59:20] [INFO ] [Real]Absence check using 65 positive place invariants in 603 ms returned sat
[2021-05-19 05:59:21] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 977 ms returned sat
[2021-05-19 05:59:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 05:59:23] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18004 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18004/18004 places, 33209/33209 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 18004 transition count 33208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18003 transition count 33208
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 18003 transition count 33206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 18001 transition count 33206
Applied a total of 6 rules in 2866 ms. Remains 18001 /18004 variables (removed 3) and now considering 33206/33209 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 18001/18004 places, 33206/33209 transitions.
Normalized transition count is 31640 out of 33206 initially.
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 05:59:40] [INFO ] Computed 1769 place invariants in 14235 ms
Interrupted random walk after 281689 steps, including 5086 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen :{}
Interrupted Best-First random walk after 429499 steps, including 755 resets, run timeout after 5001 ms. (steps per millisecond=85 ) properties seen :{}
[2021-05-19 06:00:15] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:00:28] [INFO ] Computed 1769 place invariants in 13317 ms
[2021-05-19 06:00:31] [INFO ] [Real]Absence check using 65 positive place invariants in 618 ms returned sat
[2021-05-19 06:00:32] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 997 ms returned sat
[2021-05-19 06:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:01:13] [INFO ] [Real]Absence check using state equation in 41334 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18001 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1357 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18001/18001 places, 33206/33206 transitions.
Starting structural reductions, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1364 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
[2021-05-19 06:01:16] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:01:30] [INFO ] Computed 1769 place invariants in 13958 ms
[2021-05-19 06:01:32] [INFO ] Implicit Places using invariants in 15767 ms returned []
Implicit Place search using SMT only with invariants took 15768 ms to find 0 implicit places.
[2021-05-19 06:01:32] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:01:45] [INFO ] Computed 1769 place invariants in 13319 ms
[2021-05-19 06:01:47] [INFO ] Dead Transitions using invariants and state equation in 14975 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18001/18001 places, 33206/33206 transitions.
Ending property specific reduction for gen-UpperBounds-08 in 180100 ms.
Starting property specific reduction for gen-UpperBounds-09
Normalized transition count is 31643 out of 33209 initially.
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 06:02:00] [INFO ] Computed 1769 place invariants in 13905 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 1090 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
[2021-05-19 06:02:02] [INFO ] Flow matrix only has 31643 transitions (discarded 1566 similar events)
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 06:02:20] [INFO ] Computed 1769 place invariants in 18381 ms
[2021-05-19 06:02:23] [INFO ] [Real]Absence check using 65 positive place invariants in 621 ms returned sat
[2021-05-19 06:02:24] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1029 ms returned sat
[2021-05-19 06:02:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:02:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 18004 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18004/18004 places, 33209/33209 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 18004 transition count 33208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18003 transition count 33208
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 18003 transition count 33207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 18002 transition count 33207
Applied a total of 4 rules in 2797 ms. Remains 18002 /18004 variables (removed 2) and now considering 33207/33209 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 18002/18004 places, 33207/33209 transitions.
Normalized transition count is 31641 out of 33207 initially.
// Phase 1: matrix 31641 rows 18002 cols
[2021-05-19 06:02:42] [INFO ] Computed 1769 place invariants in 14246 ms
Interrupted random walk after 288723 steps, including 5215 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen :{}
Interrupted Best-First random walk after 418524 steps, including 736 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :{}
[2021-05-19 06:03:17] [INFO ] Flow matrix only has 31641 transitions (discarded 1566 similar events)
// Phase 1: matrix 31641 rows 18002 cols
[2021-05-19 06:03:31] [INFO ] Computed 1769 place invariants in 14173 ms
[2021-05-19 06:03:34] [INFO ] [Real]Absence check using 65 positive place invariants in 601 ms returned sat
[2021-05-19 06:03:35] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1053 ms returned sat
[2021-05-19 06:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:04:16] [INFO ] [Real]Absence check using state equation in 41357 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 18002 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18002/18002 places, 33207/33207 transitions.
Applied a total of 0 rules in 1399 ms. Remains 18002 /18002 variables (removed 0) and now considering 33207/33207 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18002/18002 places, 33207/33207 transitions.
Starting structural reductions, iteration 0 : 18002/18002 places, 33207/33207 transitions.
Applied a total of 0 rules in 1350 ms. Remains 18002 /18002 variables (removed 0) and now considering 33207/33207 (removed 0) transitions.
[2021-05-19 06:04:19] [INFO ] Flow matrix only has 31641 transitions (discarded 1566 similar events)
// Phase 1: matrix 31641 rows 18002 cols
[2021-05-19 06:04:36] [INFO ] Computed 1769 place invariants in 16908 ms
[2021-05-19 06:04:38] [INFO ] Implicit Places using invariants in 18602 ms returned []
Implicit Place search using SMT only with invariants took 18606 ms to find 0 implicit places.
[2021-05-19 06:04:38] [INFO ] Flow matrix only has 31641 transitions (discarded 1566 similar events)
// Phase 1: matrix 31641 rows 18002 cols
[2021-05-19 06:04:54] [INFO ] Computed 1769 place invariants in 16255 ms
[2021-05-19 06:04:56] [INFO ] Dead Transitions using invariants and state equation in 17940 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18002/18002 places, 33207/33207 transitions.
Ending property specific reduction for gen-UpperBounds-09 in 189241 ms.
Starting property specific reduction for gen-UpperBounds-11
Normalized transition count is 31643 out of 33209 initially.
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 06:05:10] [INFO ] Computed 1769 place invariants in 14488 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 1082 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
[2021-05-19 06:05:12] [INFO ] Flow matrix only has 31643 transitions (discarded 1566 similar events)
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 06:05:25] [INFO ] Computed 1769 place invariants in 13375 ms
[2021-05-19 06:05:27] [INFO ] [Real]Absence check using 65 positive place invariants in 589 ms returned sat
[2021-05-19 06:05:28] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 925 ms returned sat
[2021-05-19 06:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:05:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18004 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18004/18004 places, 33209/33209 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 18004 transition count 33208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18003 transition count 33208
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 18003 transition count 33206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 18001 transition count 33206
Applied a total of 6 rules in 2900 ms. Remains 18001 /18004 variables (removed 3) and now considering 33206/33209 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 18001/18004 places, 33206/33209 transitions.
Normalized transition count is 31640 out of 33206 initially.
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:05:49] [INFO ] Computed 1769 place invariants in 15582 ms
Interrupted random walk after 279794 steps, including 5053 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen :{}
Interrupted Best-First random walk after 419619 steps, including 738 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :{}
[2021-05-19 06:06:24] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:06:37] [INFO ] Computed 1769 place invariants in 13608 ms
[2021-05-19 06:06:40] [INFO ] [Real]Absence check using 65 positive place invariants in 621 ms returned sat
[2021-05-19 06:06:41] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 922 ms returned sat
[2021-05-19 06:06:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:07:22] [INFO ] [Real]Absence check using state equation in 41640 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18001 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1296 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18001/18001 places, 33206/33206 transitions.
Starting structural reductions, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1318 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
[2021-05-19 06:07:25] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:07:40] [INFO ] Computed 1769 place invariants in 15239 ms
[2021-05-19 06:07:42] [INFO ] Implicit Places using invariants in 16884 ms returned []
Implicit Place search using SMT only with invariants took 16893 ms to find 0 implicit places.
[2021-05-19 06:07:42] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:07:56] [INFO ] Computed 1769 place invariants in 14224 ms
[2021-05-19 06:07:58] [INFO ] Dead Transitions using invariants and state equation in 15862 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18001/18001 places, 33206/33206 transitions.
Ending property specific reduction for gen-UpperBounds-11 in 181787 ms.
Starting property specific reduction for gen-UpperBounds-13
Normalized transition count is 31643 out of 33209 initially.
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 06:08:12] [INFO ] Computed 1769 place invariants in 14222 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 1102 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
[2021-05-19 06:08:13] [INFO ] Flow matrix only has 31643 transitions (discarded 1566 similar events)
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 06:08:27] [INFO ] Computed 1769 place invariants in 13952 ms
[2021-05-19 06:08:30] [INFO ] [Real]Absence check using 65 positive place invariants in 616 ms returned sat
[2021-05-19 06:08:31] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 986 ms returned sat
[2021-05-19 06:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:08:32] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18004 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18004/18004 places, 33209/33209 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 18004 transition count 33208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18003 transition count 33208
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 18003 transition count 33206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 18001 transition count 33206
Applied a total of 6 rules in 2962 ms. Remains 18001 /18004 variables (removed 3) and now considering 33206/33209 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 18001/18004 places, 33206/33209 transitions.
Normalized transition count is 31640 out of 33206 initially.
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:08:52] [INFO ] Computed 1769 place invariants in 16748 ms
Interrupted random walk after 278994 steps, including 5040 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen :{}
Interrupted Best-First random walk after 416253 steps, including 732 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :{}
[2021-05-19 06:09:27] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:09:40] [INFO ] Computed 1769 place invariants in 13477 ms
[2021-05-19 06:09:43] [INFO ] [Real]Absence check using 65 positive place invariants in 618 ms returned sat
[2021-05-19 06:09:44] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1147 ms returned sat
[2021-05-19 06:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:10:25] [INFO ] [Real]Absence check using state equation in 41268 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18001 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1364 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18001/18001 places, 33206/33206 transitions.
Starting structural reductions, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1376 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
[2021-05-19 06:10:28] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:10:42] [INFO ] Computed 1769 place invariants in 14064 ms
[2021-05-19 06:10:44] [INFO ] Implicit Places using invariants in 15722 ms returned []
Implicit Place search using SMT only with invariants took 15731 ms to find 0 implicit places.
[2021-05-19 06:10:44] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:10:57] [INFO ] Computed 1769 place invariants in 13560 ms
[2021-05-19 06:10:59] [INFO ] Dead Transitions using invariants and state equation in 15192 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18001/18001 places, 33206/33206 transitions.
Ending property specific reduction for gen-UpperBounds-13 in 181506 ms.
Starting property specific reduction for gen-UpperBounds-14
Normalized transition count is 31643 out of 33209 initially.
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 06:11:13] [INFO ] Computed 1769 place invariants in 13562 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 1036 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
[2021-05-19 06:11:14] [INFO ] Flow matrix only has 31643 transitions (discarded 1566 similar events)
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 06:11:28] [INFO ] Computed 1769 place invariants in 13949 ms
[2021-05-19 06:11:31] [INFO ] [Real]Absence check using 65 positive place invariants in 624 ms returned sat
[2021-05-19 06:11:32] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1025 ms returned sat
[2021-05-19 06:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:11:33] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18004 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18004/18004 places, 33209/33209 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 18004 transition count 33208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18003 transition count 33208
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 18003 transition count 33206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 18001 transition count 33206
Applied a total of 6 rules in 2815 ms. Remains 18001 /18004 variables (removed 3) and now considering 33206/33209 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 18001/18004 places, 33206/33209 transitions.
Normalized transition count is 31640 out of 33206 initially.
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:11:50] [INFO ] Computed 1769 place invariants in 13809 ms
Interrupted random walk after 286856 steps, including 5180 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen :{}
Interrupted Best-First random walk after 425277 steps, including 748 resets, run timeout after 5001 ms. (steps per millisecond=85 ) properties seen :{}
[2021-05-19 06:12:25] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:12:39] [INFO ] Computed 1769 place invariants in 14707 ms
[2021-05-19 06:12:42] [INFO ] [Real]Absence check using 65 positive place invariants in 633 ms returned sat
[2021-05-19 06:12:43] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1180 ms returned sat
[2021-05-19 06:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:13:24] [INFO ] [Real]Absence check using state equation in 40971 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18001 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1335 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18001/18001 places, 33206/33206 transitions.
Starting structural reductions, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1359 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
[2021-05-19 06:13:27] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:13:41] [INFO ] Computed 1769 place invariants in 13781 ms
[2021-05-19 06:13:42] [INFO ] Implicit Places using invariants in 15433 ms returned []
Implicit Place search using SMT only with invariants took 15435 ms to find 0 implicit places.
[2021-05-19 06:13:42] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:13:56] [INFO ] Computed 1769 place invariants in 13640 ms
[2021-05-19 06:13:58] [INFO ] Dead Transitions using invariants and state equation in 15313 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18001/18001 places, 33206/33206 transitions.
Ending property specific reduction for gen-UpperBounds-14 in 178645 ms.
Starting property specific reduction for gen-UpperBounds-15
Normalized transition count is 31643 out of 33209 initially.
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 06:14:13] [INFO ] Computed 1769 place invariants in 15430 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 1090 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
[2021-05-19 06:14:14] [INFO ] Flow matrix only has 31643 transitions (discarded 1566 similar events)
// Phase 1: matrix 31643 rows 18004 cols
[2021-05-19 06:14:28] [INFO ] Computed 1769 place invariants in 14061 ms
[2021-05-19 06:14:31] [INFO ] [Real]Absence check using 65 positive place invariants in 627 ms returned sat
[2021-05-19 06:14:32] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 969 ms returned sat
[2021-05-19 06:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:14:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18004 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18004/18004 places, 33209/33209 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 18004 transition count 33208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18003 transition count 33208
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 18003 transition count 33206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 18001 transition count 33206
Applied a total of 6 rules in 2857 ms. Remains 18001 /18004 variables (removed 3) and now considering 33206/33209 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 18001/18004 places, 33206/33209 transitions.
Normalized transition count is 31640 out of 33206 initially.
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:14:51] [INFO ] Computed 1769 place invariants in 14076 ms
Interrupted random walk after 288338 steps, including 5207 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen :{}
Interrupted Best-First random walk after 414839 steps, including 729 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen :{}
[2021-05-19 06:15:26] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:15:41] [INFO ] Computed 1769 place invariants in 15660 ms
[2021-05-19 06:15:44] [INFO ] [Real]Absence check using 65 positive place invariants in 615 ms returned sat
[2021-05-19 06:15:45] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1032 ms returned sat
[2021-05-19 06:15:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:16:26] [INFO ] [Real]Absence check using state equation in 41383 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18001 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1374 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18001/18001 places, 33206/33206 transitions.
Starting structural reductions, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1388 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
[2021-05-19 06:16:29] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:16:45] [INFO ] Computed 1769 place invariants in 15833 ms
[2021-05-19 06:16:46] [INFO ] Implicit Places using invariants in 17426 ms returned []
Implicit Place search using SMT only with invariants took 17435 ms to find 0 implicit places.
[2021-05-19 06:16:46] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2021-05-19 06:17:02] [INFO ] Computed 1769 place invariants in 15075 ms
[2021-05-19 06:17:03] [INFO ] Dead Transitions using invariants and state equation in 16684 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18001/18001 places, 33206/33206 transitions.
Ending property specific reduction for gen-UpperBounds-15 in 185419 ms.
[2021-05-19 06:17:06] [INFO ] Flatten gal took : 2088 ms
[2021-05-19 06:17:07] [INFO ] Applying decomposition
[2021-05-19 06:17:09] [INFO ] Flatten gal took : 1836 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2976657647711742057.txt, -o, /tmp/graph2976657647711742057.bin, -w, /tmp/graph2976657647711742057.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2976657647711742057.bin, -l, -1, -v, -w, /tmp/graph2976657647711742057.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 06:17:13] [INFO ] Decomposing Gal with order
[2021-05-19 06:17:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 06:17:49] [INFO ] Removed a total of 56792 redundant transitions.
[2021-05-19 06:17:54] [INFO ] Flatten gal took : 34198 ms
[2021-05-19 06:18:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 29983 labels/synchronizations in 11646 ms.
[2021-05-19 06:18:15] [INFO ] Time to serialize gal into /tmp/UpperBounds12017140066360045131.gal : 388 ms
[2021-05-19 06:18:15] [INFO ] Time to serialize properties into /tmp/UpperBounds8003185213164662517.prop : 13 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds12017140066360045131.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8003185213164662517.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds12017140066360045131.gal -t CGAL -reachable-file /tmp/UpperBounds8003185213164662517.prop --nowitness
Loading property file /tmp/UpperBounds8003185213164662517.prop.
ITS-tools command line returned an error code 137
[2021-05-19 06:32:38] [INFO ] Flatten gal took : 2114 ms
[2021-05-19 06:32:38] [INFO ] Time to serialize gal into /tmp/UpperBounds9739523467247528322.gal : 187 ms
[2021-05-19 06:32:38] [INFO ] Time to serialize properties into /tmp/UpperBounds15484958943614535798.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds9739523467247528322.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15484958943614535798.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds9739523467247528322.gal -t CGAL -reachable-file /tmp/UpperBounds15484958943614535798.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds15484958943614535798.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S32C09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="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-S32C09, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124157000771"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C09.tgz
mv MultiCrashLeafsetExtension-PT-S32C09 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;