Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 33M
-rw-r--r-- 1 mcc users 17K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 19 18:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32M May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716665813122

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 19:36:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 19:36:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:36:55] [INFO ] Load time of PNML (sax parser for PT used): 1176 ms
[2024-05-25 19:36:56] [INFO ] Transformed 32088 places.
[2024-05-25 19:36:56] [INFO ] Transformed 48223 transitions.
[2024-05-25 19:36:56] [INFO ] Parsed PT model containing 32088 places and 48223 transitions and 181342 arcs in 1470 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Normalized transition count is 47167 out of 48223 initially.
// Phase 1: matrix 47167 rows 32088 cols
[2024-05-25 19:37:05] [INFO ] Computed 1893 invariants in 8887 ms
Incomplete random walk after 10000 steps, including 97 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
[2024-05-25 19:37:07] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32088 cols
[2024-05-25 19:37:20] [INFO ] Computed 1893 invariants in 12649 ms
[2024-05-25 19:37:25] [INFO ] [Real]Absence check using 90 positive place invariants in 217 ms returned unknown
[2024-05-25 19:37:30] [INFO ] [Real]Absence check using 90 positive place invariants in 669 ms returned unknown
[2024-05-25 19:37:35] [INFO ] [Real]Absence check using 90 positive place invariants in 486 ms returned unknown
[2024-05-25 19:37:40] [INFO ] [Real]Absence check using 90 positive place invariants in 660 ms returned unknown
[2024-05-25 19:37:45] [INFO ] [Real]Absence check using 90 positive place invariants in 618 ms returned unknown
[2024-05-25 19:37:50] [INFO ] [Real]Absence check using 90 positive place invariants in 669 ms returned unknown
[2024-05-25 19:37:55] [INFO ] [Real]Absence check using 90 positive place invariants in 734 ms returned unknown
[2024-05-25 19:38:00] [INFO ] [Real]Absence check using 90 positive place invariants in 701 ms returned unknown
[2024-05-25 19:38:05] [INFO ] [Real]Absence check using 90 positive place invariants in 796 ms returned unknown
[2024-05-25 19:38:10] [INFO ] [Real]Absence check using 90 positive place invariants in 714 ms returned unknown
[2024-05-25 19:38:15] [INFO ] [Real]Absence check using 90 positive place invariants in 751 ms returned unknown
[2024-05-25 19:38:20] [INFO ] [Real]Absence check using 90 positive place invariants in 916 ms returned unknown
[2024-05-25 19:38:25] [INFO ] [Real]Absence check using 90 positive place invariants in 793 ms returned unknown
[2024-05-25 19:38:30] [INFO ] [Real]Absence check using 90 positive place invariants in 812 ms returned unknown
[2024-05-25 19:38:35] [INFO ] [Real]Absence check using 90 positive place invariants in 768 ms returned unknown
[2024-05-25 19:38:40] [INFO ] [Real]Absence check using 90 positive place invariants in 765 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 33, 99, 99, 33, 99, 99, 1, 33, 99, 33, 33, 99, 1, 1, 99] Max seen :[0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0]
Support contains 16 out of 32088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32088/32088 places, 48223/48223 transitions.
Graph (complete) has 105773 edges and 32088 vertex of which 32032 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.63 ms
Discarding 56 places :
Also discarding 0 output transitions
Drop transitions removed 10548 transitions
Trivial Post-agglo rules discarded 10548 transitions
Performed 10548 trivial Post agglomeration. Transition count delta: 10548
Iterating post reduction 0 with 10548 rules applied. Total rules applied 10549 place count 32032 transition count 37675
Reduce places removed 10548 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 10555 rules applied. Total rules applied 21104 place count 21484 transition count 37668
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 21111 place count 21477 transition count 37668
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 660 Pre rules applied. Total rules applied 21111 place count 21477 transition count 37008
Deduced a syphon composed of 660 places in 57 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 3 with 1320 rules applied. Total rules applied 22431 place count 20817 transition count 37008
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 51 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 22497 place count 20784 transition count 36975
Free-agglomeration rule (complex) applied 1576 times.
Iterating global reduction 3 with 1576 rules applied. Total rules applied 24073 place count 20784 transition count 35399
Reduce places removed 1576 places and 0 transitions.
Iterating post reduction 3 with 1576 rules applied. Total rules applied 25649 place count 19208 transition count 35399
Partial Free-agglomeration rule applied 5268 times.
Drop transitions removed 5268 transitions
Iterating global reduction 4 with 5268 rules applied. Total rules applied 30917 place count 19208 transition count 35399
Applied a total of 30917 rules in 12085 ms. Remains 19208 /32088 variables (removed 12880) and now considering 35399/48223 (removed 12824) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12097 ms. Remains : 19208/32088 places, 35399/48223 transitions.
Normalized transition count is 33833 out of 35399 initially.
// Phase 1: matrix 33833 rows 19208 cols
[2024-05-25 19:39:04] [INFO ] Computed 1837 invariants in 11275 ms
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 304042 steps, including 4949 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 6
Interrupted Best-First random walk after 460884 steps, including 741 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 2
Interrupted Best-First random walk after 453741 steps, including 730 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 2
Interrupted Best-First random walk after 448146 steps, including 721 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 3
Interrupted Best-First random walk after 459056 steps, including 738 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen 2
Interrupted Best-First random walk after 462256 steps, including 743 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 3
Interrupted Best-First random walk after 451848 steps, including 727 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 2
Interrupted Best-First random walk after 450042 steps, including 724 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 4
Interrupted Best-First random walk after 453783 steps, including 730 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 4
Interrupted Best-First random walk after 453457 steps, including 729 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 3
Interrupted Best-First random walk after 453293 steps, including 729 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 1
Interrupted Best-First random walk after 453185 steps, including 729 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 1
Interrupted Best-First random walk after 453620 steps, including 729 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 3
Interrupted Best-First random walk after 466016 steps, including 749 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 3
[2024-05-25 19:40:39] [INFO ] Flow matrix only has 33833 transitions (discarded 1566 similar events)
// Phase 1: matrix 33833 rows 19208 cols
[2024-05-25 19:40:50] [INFO ] Computed 1837 invariants in 10765 ms
[2024-05-25 19:40:52] [INFO ] [Real]Absence check using 65 positive place invariants in 700 ms returned sat
[2024-05-25 19:40:53] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1070 ms returned sat
[2024-05-25 19:40:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:41:35] [INFO ] [Real]Absence check using state equation in 41284 ms returned unknown
[2024-05-25 19:41:37] [INFO ] [Real]Absence check using 65 positive place invariants in 695 ms returned sat
[2024-05-25 19:41:38] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1022 ms returned sat
[2024-05-25 19:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:42:20] [INFO ] [Real]Absence check using state equation in 41406 ms returned unknown
[2024-05-25 19:42:22] [INFO ] [Real]Absence check using 65 positive place invariants in 687 ms returned sat
[2024-05-25 19:42:23] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 208 ms returned unsat
[2024-05-25 19:42:25] [INFO ] [Real]Absence check using 65 positive place invariants in 689 ms returned sat
[2024-05-25 19:42:26] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 304 ms returned unsat
[2024-05-25 19:42:28] [INFO ] [Real]Absence check using 65 positive place invariants in 661 ms returned sat
[2024-05-25 19:42:29] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1047 ms returned sat
[2024-05-25 19:42:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:43:11] [INFO ] [Real]Absence check using state equation in 41426 ms returned unknown
[2024-05-25 19:43:13] [INFO ] [Real]Absence check using 65 positive place invariants in 664 ms returned sat
[2024-05-25 19:43:14] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 802 ms returned unsat
[2024-05-25 19:43:16] [INFO ] [Real]Absence check using 65 positive place invariants in 677 ms returned sat
[2024-05-25 19:43:17] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 703 ms returned unsat
[2024-05-25 19:43:20] [INFO ] [Real]Absence check using 65 positive place invariants in 660 ms returned sat
[2024-05-25 19:43:21] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1014 ms returned sat
[2024-05-25 19:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:44:02] [INFO ] [Real]Absence check using state equation in 41442 ms returned unknown
[2024-05-25 19:44:05] [INFO ] [Real]Absence check using 65 positive place invariants in 667 ms returned sat
[2024-05-25 19:44:06] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 851 ms returned unsat
[2024-05-25 19:44:08] [INFO ] [Real]Absence check using 65 positive place invariants in 679 ms returned sat
[2024-05-25 19:44:09] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1055 ms returned unsat
[2024-05-25 19:44:12] [INFO ] [Real]Absence check using 65 positive place invariants in 687 ms returned sat
[2024-05-25 19:44:13] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1077 ms returned sat
[2024-05-25 19:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:44:54] [INFO ] [Real]Absence check using state equation in 41305 ms returned unknown
[2024-05-25 19:44:57] [INFO ] [Real]Absence check using 65 positive place invariants in 648 ms returned sat
[2024-05-25 19:44:58] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1030 ms returned sat
[2024-05-25 19:44:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:45:39] [INFO ] [Real]Absence check using state equation in 41459 ms returned unknown
[2024-05-25 19:45:42] [INFO ] [Real]Absence check using 65 positive place invariants in 697 ms returned sat
[2024-05-25 19:45:43] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1031 ms returned sat
[2024-05-25 19:45:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:46:24] [INFO ] [Real]Absence check using state equation in 41386 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2] Max seen :[0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 19208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19208/19208 places, 35399/35399 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 19208 transition count 35396
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 19205 transition count 35396
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 13 place count 19205 transition count 35389
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 20 place count 19198 transition count 35389
Applied a total of 20 rules in 2774 ms. Remains 19198 /19208 variables (removed 10) and now considering 35389/35399 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2774 ms. Remains : 19198/19208 places, 35389/35399 transitions.
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 19:46:38] [INFO ] Computed 1837 invariants in 10699 ms
Interrupted random walk after 300156 steps, including 4886 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 447648 steps, including 720 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 449336 steps, including 723 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 450758 steps, including 725 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
Interrupted Best-First random walk after 448570 steps, including 721 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 448357 steps, including 721 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 447760 steps, including 720 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 447501 steps, including 720 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
[2024-05-25 19:47:43] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 19:47:54] [INFO ] Computed 1837 invariants in 10913 ms
[2024-05-25 19:47:56] [INFO ] [Real]Absence check using 65 positive place invariants in 658 ms returned sat
[2024-05-25 19:47:57] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1010 ms returned sat
[2024-05-25 19:47:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:48:39] [INFO ] [Real]Absence check using state equation in 41409 ms returned unknown
[2024-05-25 19:48:41] [INFO ] [Real]Absence check using 65 positive place invariants in 675 ms returned sat
[2024-05-25 19:48:42] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1086 ms returned sat
[2024-05-25 19:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:49:24] [INFO ] [Real]Absence check using state equation in 41301 ms returned unknown
[2024-05-25 19:49:26] [INFO ] [Real]Absence check using 65 positive place invariants in 643 ms returned sat
[2024-05-25 19:49:27] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1038 ms returned sat
[2024-05-25 19:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:50:09] [INFO ] [Real]Absence check using state equation in 41426 ms returned unknown
[2024-05-25 19:50:11] [INFO ] [Real]Absence check using 65 positive place invariants in 672 ms returned sat
[2024-05-25 19:50:12] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1011 ms returned sat
[2024-05-25 19:50:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:50:54] [INFO ] [Real]Absence check using state equation in 41412 ms returned unknown
[2024-05-25 19:50:56] [INFO ] [Real]Absence check using 65 positive place invariants in 657 ms returned sat
[2024-05-25 19:50:57] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1039 ms returned sat
[2024-05-25 19:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:51:39] [INFO ] [Real]Absence check using state equation in 41434 ms returned unknown
[2024-05-25 19:51:41] [INFO ] [Real]Absence check using 65 positive place invariants in 665 ms returned sat
[2024-05-25 19:51:42] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1161 ms returned sat
[2024-05-25 19:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:52:24] [INFO ] [Real]Absence check using state equation in 41354 ms returned unknown
[2024-05-25 19:52:26] [INFO ] [Real]Absence check using 65 positive place invariants in 681 ms returned sat
[2024-05-25 19:52:28] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1075 ms returned sat
[2024-05-25 19:52:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:53:09] [INFO ] [Real]Absence check using state equation in 41288 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 2] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 19198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19198/19198 places, 35389/35389 transitions.
Applied a total of 0 rules in 1358 ms. Remains 19198 /19198 variables (removed 0) and now considering 35389/35389 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1358 ms. Remains : 19198/19198 places, 35389/35389 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19198/19198 places, 35389/35389 transitions.
Applied a total of 0 rules in 1342 ms. Remains 19198 /19198 variables (removed 0) and now considering 35389/35389 (removed 0) transitions.
[2024-05-25 19:53:12] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
[2024-05-25 19:53:12] [INFO ] Invariant cache hit.
[2024-05-25 19:53:13] [INFO ] Implicit Places using invariants in 1519 ms returned []
Implicit Place search using SMT only with invariants took 1520 ms to find 0 implicit places.
[2024-05-25 19:53:13] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
[2024-05-25 19:53:13] [INFO ] Invariant cache hit.
[2024-05-25 19:53:15] [INFO ] Dead Transitions using invariants and state equation in 1518 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4391 ms. Remains : 19198/19198 places, 35389/35389 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 19:53:26] [INFO ] Computed 1837 invariants in 11462 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1055 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
[2024-05-25 19:53:27] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 19:53:39] [INFO ] Computed 1837 invariants in 11314 ms
[2024-05-25 19:53:41] [INFO ] [Real]Absence check using 65 positive place invariants in 686 ms returned sat
[2024-05-25 19:53:43] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1206 ms returned sat
[2024-05-25 19:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:53:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19198/19198 places, 35389/35389 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 19198 transition count 35387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19196 transition count 35387
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 19196 transition count 35384
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 19193 transition count 35384
Applied a total of 10 rules in 2832 ms. Remains 19193 /19198 variables (removed 5) and now considering 35384/35389 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2834 ms. Remains : 19193/19198 places, 35384/35389 transitions.
Normalized transition count is 33818 out of 35384 initially.
// Phase 1: matrix 33818 rows 19193 cols
[2024-05-25 19:53:58] [INFO ] Computed 1837 invariants in 11316 ms
Interrupted random walk after 295027 steps, including 4803 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 446329 steps, including 718 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
[2024-05-25 19:54:33] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2024-05-25 19:54:44] [INFO ] Computed 1837 invariants in 10992 ms
[2024-05-25 19:54:47] [INFO ] [Real]Absence check using 65 positive place invariants in 697 ms returned sat
[2024-05-25 19:54:48] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1337 ms returned sat
[2024-05-25 19:54:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:55:29] [INFO ] [Real]Absence check using state equation in 40988 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1281 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1281 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1293 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
[2024-05-25 19:55:31] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2024-05-25 19:55:32] [INFO ] Invariant cache hit.
[2024-05-25 19:55:33] [INFO ] Implicit Places using invariants in 1531 ms returned []
Implicit Place search using SMT only with invariants took 1532 ms to find 0 implicit places.
[2024-05-25 19:55:33] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2024-05-25 19:55:33] [INFO ] Invariant cache hit.
[2024-05-25 19:55:35] [INFO ] Dead Transitions using invariants and state equation in 1582 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4413 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00 in 140006 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 19:55:46] [INFO ] Computed 1837 invariants in 10978 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1009 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
[2024-05-25 19:55:47] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 19:55:58] [INFO ] Computed 1837 invariants in 10713 ms
[2024-05-25 19:56:00] [INFO ] [Real]Absence check using 65 positive place invariants in 679 ms returned sat
[2024-05-25 19:56:01] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1065 ms returned sat
[2024-05-25 19:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:56:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19198/19198 places, 35389/35389 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 19198 transition count 35388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19197 transition count 35388
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 19197 transition count 35386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 19195 transition count 35386
Applied a total of 6 rules in 2716 ms. Remains 19195 /19198 variables (removed 3) and now considering 35386/35389 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2719 ms. Remains : 19195/19198 places, 35386/35389 transitions.
Normalized transition count is 33820 out of 35386 initially.
// Phase 1: matrix 33820 rows 19195 cols
[2024-05-25 19:56:16] [INFO ] Computed 1837 invariants in 10617 ms
Interrupted random walk after 294770 steps, including 4799 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 439695 steps, including 707 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 0
[2024-05-25 19:56:51] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2024-05-25 19:57:02] [INFO ] Computed 1837 invariants in 10970 ms
[2024-05-25 19:57:04] [INFO ] [Real]Absence check using 65 positive place invariants in 595 ms returned sat
[2024-05-25 19:57:05] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1002 ms returned sat
[2024-05-25 19:57:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:57:47] [INFO ] [Real]Absence check using state equation in 41512 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1252 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1252 ms. Remains : 19195/19195 places, 35386/35386 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1267 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
[2024-05-25 19:57:49] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
[2024-05-25 19:57:49] [INFO ] Invariant cache hit.
[2024-05-25 19:57:51] [INFO ] Implicit Places using invariants in 1516 ms returned []
Implicit Place search using SMT only with invariants took 1517 ms to find 0 implicit places.
[2024-05-25 19:57:51] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
[2024-05-25 19:57:51] [INFO ] Invariant cache hit.
[2024-05-25 19:57:52] [INFO ] Dead Transitions using invariants and state equation in 1505 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4295 ms. Remains : 19195/19195 places, 35386/35386 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01 in 137883 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 19:58:04] [INFO ] Computed 1837 invariants in 11527 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1018 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
[2024-05-25 19:58:05] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 19:58:18] [INFO ] Computed 1837 invariants in 12851 ms
[2024-05-25 19:58:21] [INFO ] [Real]Absence check using 65 positive place invariants in 696 ms returned sat
[2024-05-25 19:58:22] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1185 ms returned sat
[2024-05-25 19:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 19:58: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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19198/19198 places, 35389/35389 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 19198 transition count 35388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19197 transition count 35388
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 19197 transition count 35386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 19195 transition count 35386
Applied a total of 6 rules in 2823 ms. Remains 19195 /19198 variables (removed 3) and now considering 35386/35389 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2828 ms. Remains : 19195/19198 places, 35386/35389 transitions.
Normalized transition count is 33820 out of 35386 initially.
// Phase 1: matrix 33820 rows 19195 cols
[2024-05-25 19:58:39] [INFO ] Computed 1837 invariants in 12800 ms
Interrupted random walk after 298421 steps, including 4858 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 450931 steps, including 725 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
[2024-05-25 19:59:14] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2024-05-25 19:59:25] [INFO ] Computed 1837 invariants in 11007 ms
[2024-05-25 19:59:27] [INFO ] [Real]Absence check using 65 positive place invariants in 623 ms returned sat
[2024-05-25 19:59:28] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1126 ms returned sat
[2024-05-25 19:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:00:10] [INFO ] [Real]Absence check using state equation in 41352 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1279 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1279 ms. Remains : 19195/19195 places, 35386/35386 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1282 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
[2024-05-25 20:00:12] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
[2024-05-25 20:00:12] [INFO ] Invariant cache hit.
[2024-05-25 20:00:14] [INFO ] Implicit Places using invariants in 1508 ms returned []
Implicit Place search using SMT only with invariants took 1509 ms to find 0 implicit places.
[2024-05-25 20:00:14] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
[2024-05-25 20:00:14] [INFO ] Invariant cache hit.
[2024-05-25 20:00:15] [INFO ] Dead Transitions using invariants and state equation in 1454 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4258 ms. Remains : 19195/19195 places, 35386/35386 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04 in 142884 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 20:00:27] [INFO ] Computed 1837 invariants in 11526 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1022 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
[2024-05-25 20:00:28] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 20:00:39] [INFO ] Computed 1837 invariants in 10911 ms
[2024-05-25 20:00:42] [INFO ] [Real]Absence check using 65 positive place invariants in 694 ms returned sat
[2024-05-25 20:00:43] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1284 ms returned sat
[2024-05-25 20:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:00:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19198/19198 places, 35389/35389 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 19198 transition count 35387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19196 transition count 35387
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 19196 transition count 35384
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 19193 transition count 35384
Applied a total of 10 rules in 2811 ms. Remains 19193 /19198 variables (removed 5) and now considering 35384/35389 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2811 ms. Remains : 19193/19198 places, 35384/35389 transitions.
Normalized transition count is 33818 out of 35384 initially.
// Phase 1: matrix 33818 rows 19193 cols
[2024-05-25 20:00:58] [INFO ] Computed 1837 invariants in 11520 ms
Interrupted random walk after 300190 steps, including 4888 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 449938 steps, including 723 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
[2024-05-25 20:01:33] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2024-05-25 20:01:44] [INFO ] Computed 1837 invariants in 10632 ms
[2024-05-25 20:01:47] [INFO ] [Real]Absence check using 65 positive place invariants in 675 ms returned sat
[2024-05-25 20:01:48] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1120 ms returned sat
[2024-05-25 20:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:02:29] [INFO ] [Real]Absence check using state equation in 41231 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1267 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1267 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1268 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
[2024-05-25 20:02:32] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2024-05-25 20:02:32] [INFO ] Invariant cache hit.
[2024-05-25 20:02:33] [INFO ] Implicit Places using invariants in 1502 ms returned []
Implicit Place search using SMT only with invariants took 1503 ms to find 0 implicit places.
[2024-05-25 20:02:33] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2024-05-25 20:02:33] [INFO ] Invariant cache hit.
[2024-05-25 20:02:35] [INFO ] Dead Transitions using invariants and state equation in 1504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4283 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07 in 139293 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 20:02:45] [INFO ] Computed 1837 invariants in 10614 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1011 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
[2024-05-25 20:02:46] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 20:02:57] [INFO ] Computed 1837 invariants in 10506 ms
[2024-05-25 20:03:00] [INFO ] [Real]Absence check using 65 positive place invariants in 692 ms returned sat
[2024-05-25 20:03:01] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1042 ms returned sat
[2024-05-25 20:03:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:03:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19198/19198 places, 35389/35389 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 19198 transition count 35387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19196 transition count 35387
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 19196 transition count 35384
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 19193 transition count 35384
Applied a total of 10 rules in 2781 ms. Remains 19193 /19198 variables (removed 5) and now considering 35384/35389 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2782 ms. Remains : 19193/19198 places, 35384/35389 transitions.
Normalized transition count is 33818 out of 35384 initially.
// Phase 1: matrix 33818 rows 19193 cols
[2024-05-25 20:03:15] [INFO ] Computed 1837 invariants in 10643 ms
Interrupted random walk after 301634 steps, including 4911 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 454848 steps, including 731 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
[2024-05-25 20:03:51] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2024-05-25 20:04:01] [INFO ] Computed 1837 invariants in 10702 ms
[2024-05-25 20:04:04] [INFO ] [Real]Absence check using 65 positive place invariants in 668 ms returned sat
[2024-05-25 20:04:05] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1174 ms returned sat
[2024-05-25 20:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:04:46] [INFO ] [Real]Absence check using state equation in 41233 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1283 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1283 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1302 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
[2024-05-25 20:04:49] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2024-05-25 20:04:49] [INFO ] Invariant cache hit.
[2024-05-25 20:04:50] [INFO ] Implicit Places using invariants in 1476 ms returned []
Implicit Place search using SMT only with invariants took 1477 ms to find 0 implicit places.
[2024-05-25 20:04:50] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2024-05-25 20:04:50] [INFO ] Invariant cache hit.
[2024-05-25 20:04:52] [INFO ] Dead Transitions using invariants and state equation in 1474 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4258 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13 in 137123 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-14
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 20:05:03] [INFO ] Computed 1837 invariants in 10782 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1020 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
[2024-05-25 20:05:04] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 20:05:15] [INFO ] Computed 1837 invariants in 10707 ms
[2024-05-25 20:05:17] [INFO ] [Real]Absence check using 65 positive place invariants in 695 ms returned sat
[2024-05-25 20:05:18] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1075 ms returned sat
[2024-05-25 20:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:05:20] [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: Stream closed... 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: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19198/19198 places, 35389/35389 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 19198 transition count 35387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19196 transition count 35387
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 19196 transition count 35384
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 19193 transition count 35384
Applied a total of 10 rules in 2752 ms. Remains 19193 /19198 variables (removed 5) and now considering 35384/35389 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2753 ms. Remains : 19193/19198 places, 35384/35389 transitions.
Normalized transition count is 33818 out of 35384 initially.
// Phase 1: matrix 33818 rows 19193 cols
[2024-05-25 20:05:33] [INFO ] Computed 1837 invariants in 10657 ms
Interrupted random walk after 298327 steps, including 4857 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 431095 steps, including 693 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen 0
[2024-05-25 20:06:08] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2024-05-25 20:06:21] [INFO ] Computed 1837 invariants in 13069 ms
[2024-05-25 20:06:24] [INFO ] [Real]Absence check using 65 positive place invariants in 672 ms returned sat
[2024-05-25 20:06:25] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1286 ms returned sat
[2024-05-25 20:06:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:07:06] [INFO ] [Real]Absence check using state equation in 41127 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1246 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1246 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1280 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
[2024-05-25 20:07:09] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2024-05-25 20:07:09] [INFO ] Invariant cache hit.
[2024-05-25 20:07:10] [INFO ] Implicit Places using invariants in 1510 ms returned []
Implicit Place search using SMT only with invariants took 1511 ms to find 0 implicit places.
[2024-05-25 20:07:10] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2024-05-25 20:07:10] [INFO ] Invariant cache hit.
[2024-05-25 20:07:12] [INFO ] Dead Transitions using invariants and state equation in 1501 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4299 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-14 in 139859 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-15
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 20:07:23] [INFO ] Computed 1837 invariants in 10891 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1029 ms. (steps per millisecond=9 ) properties (out of 1) 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 1) seen :0
[2024-05-25 20:07:24] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2024-05-25 20:07:35] [INFO ] Computed 1837 invariants in 11677 ms
[2024-05-25 20:07:38] [INFO ] [Real]Absence check using 65 positive place invariants in 705 ms returned sat
[2024-05-25 20:07:39] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1303 ms returned sat
[2024-05-25 20:07:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:07:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 19198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19198/19198 places, 35389/35389 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 19198 transition count 35387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19196 transition count 35387
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 19196 transition count 35385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 19194 transition count 35385
Applied a total of 8 rules in 2767 ms. Remains 19194 /19198 variables (removed 4) and now considering 35385/35389 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2768 ms. Remains : 19194/19198 places, 35385/35389 transitions.
Normalized transition count is 33819 out of 35385 initially.
// Phase 1: matrix 33819 rows 19194 cols
[2024-05-25 20:07:54] [INFO ] Computed 1837 invariants in 10741 ms
Interrupted random walk after 293690 steps, including 4782 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 442223 steps, including 711 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
[2024-05-25 20:08:29] [INFO ] Flow matrix only has 33819 transitions (discarded 1566 similar events)
// Phase 1: matrix 33819 rows 19194 cols
[2024-05-25 20:08:40] [INFO ] Computed 1837 invariants in 10887 ms
[2024-05-25 20:08:43] [INFO ] [Real]Absence check using 65 positive place invariants in 655 ms returned sat
[2024-05-25 20:08:44] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1065 ms returned sat
[2024-05-25 20:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:09:25] [INFO ] [Real]Absence check using state equation in 41327 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 19194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19194/19194 places, 35385/35385 transitions.
Applied a total of 0 rules in 1301 ms. Remains 19194 /19194 variables (removed 0) and now considering 35385/35385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1301 ms. Remains : 19194/19194 places, 35385/35385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19194/19194 places, 35385/35385 transitions.
Applied a total of 0 rules in 1301 ms. Remains 19194 /19194 variables (removed 0) and now considering 35385/35385 (removed 0) transitions.
[2024-05-25 20:09:28] [INFO ] Flow matrix only has 33819 transitions (discarded 1566 similar events)
[2024-05-25 20:09:28] [INFO ] Invariant cache hit.
[2024-05-25 20:09:29] [INFO ] Implicit Places using invariants in 1488 ms returned []
Implicit Place search using SMT only with invariants took 1490 ms to find 0 implicit places.
[2024-05-25 20:09:29] [INFO ] Flow matrix only has 33819 transitions (discarded 1566 similar events)
[2024-05-25 20:09:29] [INFO ] Invariant cache hit.
[2024-05-25 20:09:31] [INFO ] Dead Transitions using invariants and state equation in 1499 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4302 ms. Remains : 19194/19194 places, 35385/35385 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-15 in 138909 ms.
[2024-05-25 20:09:33] [INFO ] Flatten gal took : 1923 ms
[2024-05-25 20:09:34] [INFO ] Applying decomposition
[2024-05-25 20:09:36] [INFO ] Flatten gal took : 1590 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4623769895270628386.txt' '-o' '/tmp/graph4623769895270628386.bin' '-w' '/tmp/graph4623769895270628386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4623769895270628386.bin' '-l' '-1' '-v' '-w' '/tmp/graph4623769895270628386.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:09:39] [INFO ] Decomposing Gal with order
[2024-05-25 20:09:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:10:16] [INFO ] Removed a total of 58560 redundant transitions.
[2024-05-25 20:10:21] [INFO ] Flatten gal took : 33784 ms
[2024-05-25 20:10:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 30234 labels/synchronizations in 9227 ms.
[2024-05-25 20:10:42] [INFO ] Time to serialize gal into /tmp/UpperBounds14114363878629187739.gal : 372 ms
[2024-05-25 20:10:42] [INFO ] Time to serialize properties into /tmp/UpperBounds2813833072043571221.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14114363878629187739.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2813833072043571221.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds2813833072043571221.prop.
ITS-tools command line returned an error code 137
[2024-05-25 20:24:27] [INFO ] Flatten gal took : 1858 ms
[2024-05-25 20:24:27] [INFO ] Time to serialize gal into /tmp/UpperBounds15689827856444079313.gal : 262 ms
[2024-05-25 20:24:27] [INFO ] Time to serialize properties into /tmp/UpperBounds9612045722304223645.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15689827856444079313.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9612045722304223645.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds9612045722304223645.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12155752 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16258936 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-S32C10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S32C10, 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 r263-tall-171654372100131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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