fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r178-tajo-162089415200059
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for QuasiCertifProtocol-COL-32

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
590.960 194030.00 217944.00 141.20 1 1 33 33 33 33 1 1089 33 33 1 1 33 33 1089 33 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415200059.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-COL-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415200059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 155K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 118K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 27 10:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 10:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 131K May 5 16:51 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 QuasiCertifProtocol-COL-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621232800337

Running Version 0
[2021-05-17 06:26: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]
[2021-05-17 06:26:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:26: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.
[2021-05-17 06:26:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 06:26:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 588 ms
[2021-05-17 06:26:42] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2021-05-17 06:26:42] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions in 3 ms.
[2021-05-17 06:26:42] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_577002706587210981.dot
// Phase 1: matrix 26 rows 30 cols
[2021-05-17 06:26:42] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-17 06:26:42] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions in 30 ms.
[2021-05-17 06:26:42] [INFO ] Unfolded HLPN properties in 1 ms.
// Phase 1: matrix 26 rows 30 cols
[2021-05-17 06:26:42] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-17 06:26:42] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-17 06:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:42] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-17 06:26:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-17 06:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:42] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-17 06:26:42] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 06:26:42] [INFO ] Added : 12 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 4 ms.
[2021-05-17 06:26:42] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 06:26:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-17 06:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:42] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 06:26:42] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 06:26:42] [INFO ] Added : 6 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 4 ms.
[2021-05-17 06:26:42] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:42] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-17 06:26:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:42] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-17 06:26:42] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 06:26:43] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 06:26:43] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2021-05-17 06:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:26:43] [INFO ] Added : 3 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 3 ms.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-17 06:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 06:26:43] [INFO ] Added : 12 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-17 06:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 06:26:43] [INFO ] Added : 13 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-17 06:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 06:26:43] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-17 06:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 06:26:43] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-17 06:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 06:26:43] [INFO ] Added : 13 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-17 06:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 06:26:43] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-17 06:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 06:26:43] [INFO ] Added : 12 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-17 06:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 06:26:43] [INFO ] Added : 12 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-17 06:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 06:26:43] [INFO ] Added : 8 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-17 06:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 06:26:43] [INFO ] Added : 10 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-17 06:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 06:26:43] [INFO ] Added : 10 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 06:26:43] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2021-05-17 06:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2021-05-17 06:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-17 06:26:43] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 06:26:43] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [1, 1, -1, -1, 33, 33, 1, -1, 33, -1, 1, 1, -1, 33, -1, -1]
[2021-05-17 06:26:43] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions in 11 ms.
[2021-05-17 06:26:43] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_645387939344389252.dot
Incomplete random walk after 10000 steps, including 268 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 16) seen :46
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :36
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :32
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :34
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :56
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 16) seen :38
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :36
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :40
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 16) seen :38
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :38
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :44
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :44
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :36
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :46
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :42
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 16) seen :40
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 16) seen :52
// Phase 1: matrix 506 rows 3806 cols
[2021-05-17 06:26:45] [INFO ] Computed 3301 place invariants in 262 ms
[2021-05-17 06:26:46] [INFO ] [Real]Absence check using 37 positive place invariants in 140 ms returned sat
[2021-05-17 06:26:47] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 853 ms returned sat
[2021-05-17 06:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:49] [INFO ] [Real]Absence check using state equation in 1987 ms returned sat
[2021-05-17 06:26:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:49] [INFO ] [Nat]Absence check using 37 positive place invariants in 71 ms returned sat
[2021-05-17 06:26:50] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 599 ms returned sat
[2021-05-17 06:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:52] [INFO ] [Nat]Absence check using state equation in 1667 ms returned sat
[2021-05-17 06:26:52] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 63 ms.
[2021-05-17 06:26:54] [INFO ] Added : 80 causal constraints over 16 iterations in 2129 ms. Result :unknown
[2021-05-17 06:26:54] [INFO ] [Real]Absence check using 37 positive place invariants in 94 ms returned sat
[2021-05-17 06:26:55] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 774 ms returned sat
[2021-05-17 06:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:26:57] [INFO ] [Real]Absence check using state equation in 1924 ms returned sat
[2021-05-17 06:26:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:26:58] [INFO ] [Nat]Absence check using 37 positive place invariants in 61 ms returned sat
[2021-05-17 06:26:58] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 738 ms returned sat
[2021-05-17 06:26:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:27:02] [INFO ] [Nat]Absence check using state equation in 3820 ms returned sat
[2021-05-17 06:27:04] [INFO ] Deduced a trap composed of 6 places in 2158 ms of which 4 ms to minimize.
[2021-05-17 06:27:04] [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 1
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 06:27:05] [INFO ] [Real]Absence check using 37 positive place invariants in 55 ms returned sat
[2021-05-17 06:27:05] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 610 ms returned sat
[2021-05-17 06:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:27:09] [INFO ] [Real]Absence check using state equation in 3787 ms returned sat
[2021-05-17 06:27:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:27:10] [INFO ] [Nat]Absence check using 37 positive place invariants in 85 ms returned sat
[2021-05-17 06:27:10] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 696 ms returned sat
[2021-05-17 06:27:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:27:14] [INFO ] [Nat]Absence check using state equation in 3874 ms returned unknown
[2021-05-17 06:27:15] [INFO ] [Real]Absence check using 37 positive place invariants in 70 ms returned sat
[2021-05-17 06:27:16] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 824 ms returned sat
[2021-05-17 06:27:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:27:19] [INFO ] [Real]Absence check using state equation in 3763 ms returned unknown
[2021-05-17 06:27:20] [INFO ] [Real]Absence check using 37 positive place invariants in 58 ms returned sat
[2021-05-17 06:27:21] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 781 ms returned sat
[2021-05-17 06:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:27:23] [INFO ] [Real]Absence check using state equation in 2631 ms returned sat
[2021-05-17 06:27:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:27:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 83 ms returned sat
[2021-05-17 06:27:25] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 761 ms returned sat
[2021-05-17 06:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:27:28] [INFO ] [Nat]Absence check using state equation in 3754 ms returned unknown
[2021-05-17 06:27:29] [INFO ] [Real]Absence check using 37 positive place invariants in 79 ms returned sat
[2021-05-17 06:27:30] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 925 ms returned sat
[2021-05-17 06:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:27:33] [INFO ] [Real]Absence check using state equation in 3629 ms returned unknown
[2021-05-17 06:27:34] [INFO ] [Real]Absence check using 37 positive place invariants in 82 ms returned sat
[2021-05-17 06:27:35] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 635 ms returned sat
[2021-05-17 06:27:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:27:36] [INFO ] [Real]Absence check using state equation in 1871 ms returned sat
[2021-05-17 06:27:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:27:37] [INFO ] [Nat]Absence check using 37 positive place invariants in 58 ms returned sat
[2021-05-17 06:27:38] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 699 ms returned sat
[2021-05-17 06:27:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:27:41] [INFO ] [Nat]Absence check using state equation in 3671 ms returned sat
[2021-05-17 06:27:41] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 54 ms.
[2021-05-17 06:27:42] [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 6
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 06:27:42] [INFO ] [Real]Absence check using 37 positive place invariants in 120 ms returned sat
[2021-05-17 06:27:43] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 909 ms returned sat
[2021-05-17 06:27:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:27:45] [INFO ] [Real]Absence check using state equation in 2215 ms returned sat
[2021-05-17 06:27:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:27:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 110 ms returned sat
[2021-05-17 06:27:47] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 928 ms returned sat
[2021-05-17 06:27:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:27:49] [INFO ] [Nat]Absence check using state equation in 2287 ms returned sat
[2021-05-17 06:27:49] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 58 ms.
[2021-05-17 06:27:53] [INFO ] Deduced a trap composed of 6 places in 2541 ms of which 3 ms to minimize.
[2021-05-17 06:27:53] [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 7
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 06:27:53] [INFO ] [Real]Absence check using 37 positive place invariants in 54 ms returned sat
[2021-05-17 06:27:54] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 534 ms returned sat
[2021-05-17 06:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:27:56] [INFO ] [Real]Absence check using state equation in 1937 ms returned sat
[2021-05-17 06:27:56] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 58 ms.
[2021-05-17 06:28:00] [INFO ] Deduced a trap composed of 6 places in 2547 ms of which 3 ms to minimize.
[2021-05-17 06:28:00] [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 8
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 06:28:01] [INFO ] [Real]Absence check using 37 positive place invariants in 53 ms returned sat
[2021-05-17 06:28:01] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 776 ms returned sat
[2021-05-17 06:28:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:28:05] [INFO ] [Real]Absence check using state equation in 3835 ms returned sat
[2021-05-17 06:28:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:28:06] [INFO ] [Nat]Absence check using 37 positive place invariants in 82 ms returned sat
[2021-05-17 06:28:07] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 745 ms returned sat
[2021-05-17 06:28:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:28:10] [INFO ] [Nat]Absence check using state equation in 3763 ms returned unknown
[2021-05-17 06:28:11] [INFO ] [Real]Absence check using 37 positive place invariants in 82 ms returned sat
[2021-05-17 06:28:12] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 676 ms returned sat
[2021-05-17 06:28:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:28:14] [INFO ] [Real]Absence check using state equation in 1982 ms returned sat
[2021-05-17 06:28:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:28:14] [INFO ] [Nat]Absence check using 37 positive place invariants in 57 ms returned sat
[2021-05-17 06:28:15] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 777 ms returned sat
[2021-05-17 06:28:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:28:17] [INFO ] [Nat]Absence check using state equation in 1580 ms returned sat
[2021-05-17 06:28:17] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 66 ms.
[2021-05-17 06:28:21] [INFO ] Deduced a trap composed of 6 places in 2468 ms of which 3 ms to minimize.
[2021-05-17 06:28:21] [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 10
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 06:28:22] [INFO ] [Real]Absence check using 37 positive place invariants in 80 ms returned sat
[2021-05-17 06:28:22] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 654 ms returned sat
[2021-05-17 06:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:28:24] [INFO ] [Real]Absence check using state equation in 1810 ms returned sat
[2021-05-17 06:28:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:28:25] [INFO ] [Nat]Absence check using 37 positive place invariants in 81 ms returned sat
[2021-05-17 06:28:26] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 823 ms returned sat
[2021-05-17 06:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:28:27] [INFO ] [Nat]Absence check using state equation in 1520 ms returned sat
[2021-05-17 06:28:27] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 43 ms.
[2021-05-17 06:28:29] [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 11
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 06:28:30] [INFO ] [Real]Absence check using 37 positive place invariants in 83 ms returned sat
[2021-05-17 06:28:31] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 906 ms returned sat
[2021-05-17 06:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:28:34] [INFO ] [Real]Absence check using state equation in 2893 ms returned sat
[2021-05-17 06:28:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:28:34] [INFO ] [Nat]Absence check using 37 positive place invariants in 61 ms returned sat
[2021-05-17 06:28:35] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 763 ms returned sat
[2021-05-17 06:28:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:28:38] [INFO ] [Nat]Absence check using state equation in 3180 ms returned sat
[2021-05-17 06:28:38] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 58 ms.
[2021-05-17 06:28:41] [INFO ] Deduced a trap composed of 6 places in 2523 ms of which 3 ms to minimize.
[2021-05-17 06:28:41] [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 12
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 06:28:42] [INFO ] [Real]Absence check using 37 positive place invariants in 59 ms returned sat
[2021-05-17 06:28:43] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 671 ms returned sat
[2021-05-17 06:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:28:44] [INFO ] [Real]Absence check using state equation in 1201 ms returned sat
[2021-05-17 06:28:44] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 45 ms.
[2021-05-17 06:28:49] [INFO ] Deduced a trap composed of 6 places in 2526 ms of which 2 ms to minimize.
[2021-05-17 06:28:49] [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 13
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 06:28:49] [INFO ] [Real]Absence check using 37 positive place invariants in 90 ms returned sat
[2021-05-17 06:28:50] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 906 ms returned sat
[2021-05-17 06:28:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:28:53] [INFO ] [Real]Absence check using state equation in 2770 ms returned sat
[2021-05-17 06:28:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:28:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 83 ms returned sat
[2021-05-17 06:28:55] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 923 ms returned sat
[2021-05-17 06:28:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:28:57] [INFO ] [Nat]Absence check using state equation in 2381 ms returned sat
[2021-05-17 06:28:57] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 49 ms.
[2021-05-17 06:28:58] [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 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 06:28:59] [INFO ] [Real]Absence check using 37 positive place invariants in 82 ms returned sat
[2021-05-17 06:28:59] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 749 ms returned sat
[2021-05-17 06:28:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:29:03] [INFO ] [Real]Absence check using state equation in 3737 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 2147483647, 2147483647, 33, 33, 1, 2147483647, 33, 2147483647, 1, 1, 2147483647, 33, 2147483647, 2147483647] Max seen :[0, 0, 0, 28, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 28]
Incomplete Parikh walk after 23100 steps, including 156 resets, run finished after 1956 ms. (steps per millisecond=11 ) properties (out of 16) seen :2420 could not realise parikh vector
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-13 33 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2376 out of 3806 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3768 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.19 ms
Discarding 38 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 268 rules applied. Total rules applied 269 place count 3702 transition count 302
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 269 place count 3702 transition count 301
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 271 place count 3701 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 272 place count 3700 transition count 300
Ensure Unique test removed 33 places
Iterating post reduction 1 with 33 rules applied. Total rules applied 305 place count 3667 transition count 300
Applied a total of 305 rules in 513 ms. Remains 3667 /3806 variables (removed 139) and now considering 300/506 (removed 206) transitions.
Finished structural reductions, in 1 iterations. Remains : 3667/3806 places, 300/506 transitions.
// Phase 1: matrix 300 rows 3667 cols
[2021-05-17 06:29:06] [INFO ] Computed 3367 place invariants in 36 ms
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-15 33 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-14 1089 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-12 33 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-09 33 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-03 33 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-02 33 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 679284 steps, including 2890 resets, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen :{0=20, 2=1089, 3=26}
Interrupted Best-First random walk after 679358 steps, including 112 resets, run timeout after 5001 ms. (steps per millisecond=135 ) properties seen :{0=33, 2=1089, 3=23}
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-04 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 142251 steps, including 31 resets, run timeout after 5001 ms. (steps per millisecond=28 ) properties seen :{1=1089, 2=21}
Interrupted Best-First random walk after 528077 steps, including 104 resets, run timeout after 5001 ms. (steps per millisecond=105 ) properties seen :{0=33, 1=1089, 2=33}
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-08 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-05 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 300 rows 3667 cols
[2021-05-17 06:29:51] [INFO ] Computed 3367 place invariants in 20 ms
[2021-05-17 06:29:51] [INFO ] [Real]Absence check using 33 positive place invariants in 40 ms returned sat
[2021-05-17 06:29:52] [INFO ] [Real]Absence check using 33 positive and 3334 generalized place invariants in 714 ms returned sat
[2021-05-17 06:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:29:54] [INFO ] [Real]Absence check using state equation in 1710 ms returned unsat
Current structural bounds on expressions (after SMT) : [1089] Max seen :[1089]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-07 1089 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621232994367

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-32"
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 QuasiCertifProtocol-COL-32, 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 r178-tajo-162089415200059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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