fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277016400269
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Philosophers-COL-050000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6559.960 3600000.00 3919022.00 8287.00 ? ? 50000 50000 ? 50000 ? 50000 ? ? 50000 ? ? ? ? ? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 7.5K Apr 29 11:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 11:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 11:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 11:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 2.3M May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652817039876

Running Version 202205111006
[2022-05-17 19:50:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 19:50:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 19:50:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 19:50:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 19:50:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1204 ms
[2022-05-17 19:50:42] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250000 PT places and 250000.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-17 19:50:42] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 6 ms.
[2022-05-17 19:50:42] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 19:50:42] [INFO ] Computed 2 place invariants in 4 ms
FORMULA Philosophers-COL-050000-UpperBounds-10 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-07 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-05 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-03 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-02 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 19:50:42] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-17 19:50:42] [INFO ] [Real]Absence check using 2 positive place invariants in 36 ms returned sat
[2022-05-17 19:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:42] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-17 19:50:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 19:50:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 19:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 19:50:42] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 19:50:42] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 19:50:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:42] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 19:50:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 19:50:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-17 19:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:42] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 19:50:42] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 19:50:42] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 19:50:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:42] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 19:50:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 19:50:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:42] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 19:50:42] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 19:50:42] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 19:50:42] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 19:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 19:50:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 19:50:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 19:50:42] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 19:50:42] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 19:50:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:42] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 19:50:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 19:50:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:43] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 19:50:43] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 19:50:43] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 19:50:43] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 19:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:43] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 19:50:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 19:50:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 19:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:43] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 19:50:43] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 19:50:43] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 19:50:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 19:50:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 19:50:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:43] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-17 19:50:43] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 19:50:43] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 19:50:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:43] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 19:50:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 19:50:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:43] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 19:50:43] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 19:50:43] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 19:50:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:43] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 19:50:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 19:50:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 19:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:43] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 19:50:43] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 19:50:43] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 19:50:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 19:50:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 19:50:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 19:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:43] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 19:50:43] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 19:50:43] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 19:50:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:43] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 19:50:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 19:50:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 19:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 19:50:43] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-17 19:50:43] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 19:50:43] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [50000, 25000, 50000, 25000, 25000, 25000, 50000, 50000, 50000, 25000, 25000]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 50000) 50000) 50000)]] contains successor/predecessor on variables of sort Philo
[2022-05-17 19:50:44] [INFO ] Unfolded HLPN to a Petri net with 250000 places and 250000 transitions 800000 arcs in 1499 ms.
[2022-05-17 19:50:44] [INFO ] Unfolded 11 HLPN properties in 29 ms.
Interrupted random walk after 664 steps, including 0 resets, run timeout after 30041 ms. (steps per millisecond=0 ) properties seen 1665
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7851 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7332 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7551 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7554 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7628 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7542 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7594 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7740 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7712 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7584 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7558 ms. (steps per millisecond=0 ) properties seen 1
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 19:52:41] [INFO ] Computed 100000 place invariants in 1077 ms
[2022-05-17 19:52:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2022-05-17 19:52:51] [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 1
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2022-05-17 19:52:56] [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 2
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2022-05-17 19:53:01] [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 3
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2022-05-17 19:53:06] [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 4
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2022-05-17 19:53:11] [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 5
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2022-05-17 19:53:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 6
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2022-05-17 19:53:22] [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 7
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2022-05-17 19:53:27] [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 8
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2022-05-17 19:53:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 9
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2022-05-17 19:53:37] [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 10
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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) : [50000, 25000, 50000, 25000, 25000, 25000, 50000, 50000, 50000, 25000, 25000] Max seen :[334, 0, 334, 0, 0, 0, 334, 329, 334, 0, 0]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 2130 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 19:53:41] [INFO ] Computed 100000 place invariants in 1225 ms
Finished random walk after 672 steps, including 0 resets, run visited all 11 properties in 30019 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7572 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7491 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7532 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7543 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7608 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7504 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7555 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7451 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7536 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7435 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7538 ms. (steps per millisecond=0 ) properties seen 1
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 19:55:35] [INFO ] Computed 100000 place invariants in 776 ms
Current structural bounds on expressions (after SMT) : [50000, 25000, 50000, 25000, 25000, 25000, 50000, 50000, 50000, 25000, 25000] Max seen :[351, 1, 351, 1, 1, 1, 351, 329, 351, 1, 1]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1678 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1941 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:03:55] [INFO ] Computed 100000 place invariants in 987 ms
[2022-05-17 20:04:13] [INFO ] Implicit Places using invariants in 18926 ms returned []
Implicit Place search using SMT only with invariants took 18928 ms to find 0 implicit places.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:04:14] [INFO ] Computed 100000 place invariants in 723 ms
[2022-05-17 20:04:32] [INFO ] Dead Transitions using invariants and state equation in 19118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:04:33] [INFO ] Computed 100000 place invariants in 754 ms
Finished random walk after 792 steps, including 0 resets, run visited all 11 properties in 30022 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7477 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7537 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7413 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7478 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7471 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7550 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7456 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7476 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7427 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7580 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7400 ms. (steps per millisecond=0 ) properties seen 1
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:06:27] [INFO ] Computed 100000 place invariants in 905 ms
Current structural bounds on expressions (after SMT) : [50000, 25000, 50000, 25000, 25000, 25000, 50000, 50000, 50000, 25000, 25000] Max seen :[412, 4, 412, 4, 4, 4, 412, 371, 412, 4, 4]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1429 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1333 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:14:46] [INFO ] Computed 100000 place invariants in 828 ms
[2022-05-17 20:15:05] [INFO ] Implicit Places using invariants in 19939 ms returned []
Implicit Place search using SMT only with invariants took 19940 ms to find 0 implicit places.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:15:06] [INFO ] Computed 100000 place invariants in 887 ms
[2022-05-17 20:15:24] [INFO ] Dead Transitions using invariants and state equation in 19106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:15:25] [INFO ] Computed 100000 place invariants in 820 ms
Finished random walk after 899 steps, including 0 resets, run visited all 11 properties in 30026 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7465 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7462 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7472 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7393 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7449 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7412 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7484 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7347 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7500 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7355 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7469 ms. (steps per millisecond=0 ) properties seen 1
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:17:18] [INFO ] Computed 100000 place invariants in 807 ms
Current structural bounds on expressions (after SMT) : [50000, 25000, 50000, 25000, 25000, 25000, 50000, 50000, 50000, 25000, 25000] Max seen :[444, 4, 444, 4, 4, 4, 444, 446, 444, 4, 4]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1336 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1469 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:25:38] [INFO ] Computed 100000 place invariants in 982 ms
[2022-05-17 20:25:55] [INFO ] Implicit Places using invariants in 18602 ms returned []
Implicit Place search using SMT only with invariants took 18603 ms to find 0 implicit places.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:25:56] [INFO ] Computed 100000 place invariants in 666 ms
[2022-05-17 20:26:14] [INFO ] Dead Transitions using invariants and state equation in 18383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:26:15] [INFO ] Computed 100000 place invariants in 816 ms
Finished random walk after 888 steps, including 0 resets, run visited all 11 properties in 30014 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7403 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7563 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7429 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7542 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7458 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7538 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7364 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7556 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7410 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7469 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7235 ms. (steps per millisecond=0 ) properties seen 1
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:28:08] [INFO ] Computed 100000 place invariants in 927 ms
Current structural bounds on expressions (after SMT) : [50000, 25000, 50000, 25000, 25000, 25000, 50000, 50000, 50000, 25000, 25000] Max seen :[444, 6, 444, 6, 6, 6, 444, 446, 444, 6, 6]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1434 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1931 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:36:28] [INFO ] Computed 100000 place invariants in 922 ms
[2022-05-17 20:36:46] [INFO ] Implicit Places using invariants in 19272 ms returned []
Implicit Place search using SMT only with invariants took 19277 ms to find 0 implicit places.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:36:47] [INFO ] Computed 100000 place invariants in 855 ms
[2022-05-17 20:37:05] [INFO ] Dead Transitions using invariants and state equation in 19117 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:37:06] [INFO ] Computed 100000 place invariants in 711 ms
Finished random walk after 882 steps, including 0 resets, run visited all 11 properties in 30010 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7454 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7311 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7371 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7293 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7365 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7439 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7348 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7320 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7383 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7216 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7428 ms. (steps per millisecond=0 ) properties seen 1
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:38:59] [INFO ] Computed 100000 place invariants in 790 ms
Current structural bounds on expressions (after SMT) : [50000, 25000, 50000, 25000, 25000, 25000, 50000, 50000, 50000, 25000, 25000] Max seen :[444, 6, 444, 6, 6, 6, 444, 465, 444, 6, 6]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1354 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1483 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:47:18] [INFO ] Computed 100000 place invariants in 895 ms
[2022-05-17 20:47:36] [INFO ] Implicit Places using invariants in 18927 ms returned []
Implicit Place search using SMT only with invariants took 18928 ms to find 0 implicit places.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:47:37] [INFO ] Computed 100000 place invariants in 767 ms
[2022-05-17 20:47:54] [INFO ] Dead Transitions using invariants and state equation in 18599 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:47:55] [INFO ] Computed 100000 place invariants in 658 ms
Finished random walk after 897 steps, including 0 resets, run visited all 11 properties in 30021 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7329 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7384 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7265 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7361 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7262 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7301 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7127 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7333 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7215 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7384 ms. (steps per millisecond=0 ) properties seen 1
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7252 ms. (steps per millisecond=0 ) properties seen 1
// Phase 1: matrix 250000 rows 250000 cols
[2022-05-17 20:49:47] [INFO ] Computed 100000 place invariants in 914 ms

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-050000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-050000, 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 r168-tall-165277016400269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-050000.tgz
mv Philosophers-COL-050000 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 ;