About the Execution of 2023-gold for QuasiCertifProtocol-COL-32
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r329-tall-171662361400031.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is QuasiCertifProtocol-COL-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361400031
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.5K Apr 13 04:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 04:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 03:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 13 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 131K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1716766105646
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-26 23:28:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 23:28:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 23:28:27] [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.
[2024-05-26 23:28:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 23:28:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 513 ms
[2024-05-26 23:28:27] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-05-26 23:28:27] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-05-26 23:28:27] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2024-05-26 23:28:27] [INFO ] Computed 5 invariants in 6 ms
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-15 33 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-26 23:28:27] [INFO ] Invariant cache hit.
[2024-05-26 23:28:27] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-26 23:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-26 23:28:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-26 23:28:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 23:28:28] [INFO ] Added : 6 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-26 23:28:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-26 23:28:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 23:28:28] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-26 23:28:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-26 23:28:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 23:28:28] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 5 ms.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 23:28:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-26 23:28:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 23:28:28] [INFO ] Added : 5 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 12 ms.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 23:28:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-26 23:28:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-26 23:28:28] [INFO ] Added : 10 causal constraints over 2 iterations in 38 ms. Result :sat
Minimization took 10 ms.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-26 23:28:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-26 23:28:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 23:28:28] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-26 23:28:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-26 23:28:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-26 23:28:28] [INFO ] Added : 13 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 7 ms.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-26 23:28:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-26 23:28:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 23:28:28] [INFO ] Added : 13 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 23:28:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-26 23:28:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 23:28:29] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 23:28:29] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 23:28:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-26 23:28:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 23:28:29] [INFO ] Added : 12 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 23:28:29] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 23:28:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-26 23:28:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 23:28:29] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 4 ms.
[2024-05-26 23:28:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-26 23:28:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-26 23:28:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 23:28:29] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 23:28:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-26 23:28:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-26 23:28:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 23:28:29] [INFO ] Added : 13 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2024-05-26 23:28:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-26 23:28:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:29] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-26 23:28:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 23:28:29] [INFO ] Added : 13 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, -1, 33, 1, 33, 33, 33, 33, 19, 33, 1089, -1]
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2024-05-26 23:28:29] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 33 ms.
[2024-05-26 23:28:29] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 14) seen :20
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-11 19 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
// Phase 1: matrix 506 rows 3806 cols
[2024-05-26 23:28:30] [INFO ] Computed 3301 invariants in 169 ms
[2024-05-26 23:28:30] [INFO ] [Real]Absence check using 37 positive place invariants in 70 ms returned sat
[2024-05-26 23:28:31] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 721 ms returned sat
[2024-05-26 23:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:34] [INFO ] [Real]Absence check using state equation in 2998 ms returned sat
[2024-05-26 23:28:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 73 ms returned sat
[2024-05-26 23:28:35] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 826 ms returned sat
[2024-05-26 23:28:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:38] [INFO ] [Nat]Absence check using state equation in 2377 ms returned sat
[2024-05-26 23:28:38] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 39 ms.
[2024-05-26 23:28:42] [INFO ] Deduced a trap composed of 6 places in 2820 ms of which 8 ms to minimize.
[2024-05-26 23:28: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 23:28:42] [INFO ] [Real]Absence check using 37 positive place invariants in 70 ms returned sat
[2024-05-26 23:28:43] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 681 ms returned sat
[2024-05-26 23:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:45] [INFO ] [Real]Absence check using state equation in 2294 ms returned sat
[2024-05-26 23:28:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:28:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 65 ms returned sat
[2024-05-26 23:28:46] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 609 ms returned sat
[2024-05-26 23:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:50] [INFO ] [Nat]Absence check using state equation in 3903 ms returned sat
[2024-05-26 23:28:50] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 38 ms.
[2024-05-26 23:28:53] [INFO ] Deduced a trap composed of 6 places in 2717 ms of which 5 ms to minimize.
[2024-05-26 23:28: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 23:28:54] [INFO ] [Real]Absence check using 37 positive place invariants in 63 ms returned sat
[2024-05-26 23:28:54] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 691 ms returned sat
[2024-05-26 23:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:57] [INFO ] [Real]Absence check using state equation in 2254 ms returned sat
[2024-05-26 23:28:57] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 45 ms.
[2024-05-26 23:29:01] [INFO ] Deduced a trap composed of 6 places in 2642 ms of which 5 ms to minimize.
[2024-05-26 23:29:01] [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 2
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 23:29:01] [INFO ] [Real]Absence check using 37 positive place invariants in 68 ms returned sat
[2024-05-26 23:29:02] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 747 ms returned sat
[2024-05-26 23:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:29:06] [INFO ] [Real]Absence check using state equation in 3942 ms returned unknown
[2024-05-26 23:29:06] [INFO ] [Real]Absence check using 37 positive place invariants in 75 ms returned sat
[2024-05-26 23:29:07] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 765 ms returned sat
[2024-05-26 23:29:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:29:09] [INFO ] [Real]Absence check using state equation in 1464 ms returned sat
[2024-05-26 23:29:09] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 42 ms.
[2024-05-26 23:29:13] [INFO ] Deduced a trap composed of 6 places in 2491 ms of which 4 ms to minimize.
[2024-05-26 23:29:13] [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 4
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 23:29:14] [INFO ] [Real]Absence check using 37 positive place invariants in 63 ms returned sat
[2024-05-26 23:29:14] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 658 ms returned sat
[2024-05-26 23:29:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:29:17] [INFO ] [Real]Absence check using state equation in 2366 ms returned sat
[2024-05-26 23:29:17] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 36 ms.
[2024-05-26 23:29:21] [INFO ] Deduced a trap composed of 6 places in 2702 ms of which 5 ms to minimize.
[2024-05-26 23:29: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 5
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 23:29:22] [INFO ] [Real]Absence check using 37 positive place invariants in 69 ms returned sat
[2024-05-26 23:29:22] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 756 ms returned sat
[2024-05-26 23:29:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:29:24] [INFO ] [Real]Absence check using state equation in 1485 ms returned sat
[2024-05-26 23:29:24] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 35 ms.
[2024-05-26 23:29:29] [INFO ] Deduced a trap composed of 6 places in 2702 ms of which 3 ms to minimize.
[2024-05-26 23:29: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 23:29:29] [INFO ] [Real]Absence check using 37 positive place invariants in 63 ms returned sat
[2024-05-26 23:29:30] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 768 ms returned sat
[2024-05-26 23:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:29:34] [INFO ] [Real]Absence check using state equation in 3882 ms returned unknown
[2024-05-26 23:29:34] [INFO ] [Real]Absence check using 37 positive place invariants in 62 ms returned sat
[2024-05-26 23:29:35] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 777 ms returned sat
[2024-05-26 23:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:29:38] [INFO ] [Real]Absence check using state equation in 2952 ms returned sat
[2024-05-26 23:29:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:29:38] [INFO ] [Nat]Absence check using 37 positive place invariants in 63 ms returned sat
[2024-05-26 23:29:39] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 783 ms returned sat
[2024-05-26 23:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:29:43] [INFO ] [Nat]Absence check using state equation in 3874 ms returned unknown
[2024-05-26 23:29:43] [INFO ] [Real]Absence check using 37 positive place invariants in 61 ms returned sat
[2024-05-26 23:29:44] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 776 ms returned sat
[2024-05-26 23:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:29:48] [INFO ] [Real]Absence check using state equation in 3446 ms returned sat
[2024-05-26 23:29:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:29:48] [INFO ] [Nat]Absence check using 37 positive place invariants in 65 ms returned sat
[2024-05-26 23:29:49] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 789 ms returned sat
[2024-05-26 23:29:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:29:53] [INFO ] [Nat]Absence check using state equation in 3861 ms returned unknown
[2024-05-26 23:29:53] [INFO ] [Real]Absence check using 37 positive place invariants in 66 ms returned sat
[2024-05-26 23:29:54] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 685 ms returned sat
[2024-05-26 23:29:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:29:58] [INFO ] [Real]Absence check using state equation in 3959 ms returned unknown
[2024-05-26 23:29:58] [INFO ] [Real]Absence check using 37 positive place invariants in 67 ms returned sat
[2024-05-26 23:29:59] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 775 ms returned sat
[2024-05-26 23:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:30:01] [INFO ] [Real]Absence check using state equation in 1651 ms returned sat
[2024-05-26 23:30:01] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 38 ms.
[2024-05-26 23:30:06] [INFO ] Deduced a trap composed of 6 places in 2728 ms of which 4 ms to minimize.
[2024-05-26 23:30:06] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [2147483647, 1, 1, 2147483647, 33, 33, 33, 33, 33, 33, 1089, 2147483647] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 1388 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3769 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.23 ms
Discarding 37 places :
Also discarding 0 output transitions
Drop transitions removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 3736 transition count 437
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 103 place count 3736 transition count 403
Deduced a syphon composed of 34 places in 1 ms
Ensure Unique test removed 65 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 1 with 133 rules applied. Total rules applied 236 place count 3637 transition count 403
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 236 place count 3637 transition count 402
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 239 place count 3635 transition count 402
Applied a total of 239 rules in 424 ms. Remains 3635 /3806 variables (removed 171) and now considering 402/506 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 3635/3806 places, 402/506 transitions.
Successfully produced net in file /tmp/petri1000_1234627385925986115.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 401 rows 3635 cols
[2024-05-26 23:30:06] [INFO ] Computed 3234 invariants in 43 ms
Incomplete random walk after 1000000 steps, including 18025 resets, run finished after 21731 ms. (steps per millisecond=46 ) properties (out of 12) seen :131
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 596 resets, run finished after 2438 ms. (steps per millisecond=410 ) properties (out of 10) seen :99
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-12 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 904 resets, run finished after 2651 ms. (steps per millisecond=377 ) properties (out of 9) seen :66
Incomplete Best-First random walk after 1000000 steps, including 734 resets, run finished after 2525 ms. (steps per millisecond=396 ) properties (out of 9) seen :95
Incomplete Best-First random walk after 1000001 steps, including 733 resets, run finished after 2537 ms. (steps per millisecond=394 ) properties (out of 9) seen :104
Incomplete Best-First random walk after 1000001 steps, including 735 resets, run finished after 2451 ms. (steps per millisecond=407 ) properties (out of 9) seen :102
Incomplete Best-First random walk after 1000001 steps, including 732 resets, run finished after 2511 ms. (steps per millisecond=398 ) properties (out of 9) seen :108
Incomplete Best-First random walk after 1000001 steps, including 734 resets, run finished after 2504 ms. (steps per millisecond=399 ) properties (out of 9) seen :103
Interrupted Best-First random walk after 308982 steps, including 226 resets, run timeout after 5001 ms. (steps per millisecond=61 ) properties seen 101
Incomplete Best-First random walk after 1000001 steps, including 733 resets, run finished after 2486 ms. (steps per millisecond=402 ) properties (out of 9) seen :108
[2024-05-26 23:30:53] [INFO ] Invariant cache hit.
[2024-05-26 23:30:53] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-26 23:30:54] [INFO ] [Real]Absence check using 33 positive and 3201 generalized place invariants in 645 ms returned unsat
[2024-05-26 23:30:54] [INFO ] [Real]Absence check using 33 positive place invariants in 44 ms returned sat
[2024-05-26 23:30:55] [INFO ] [Real]Absence check using 33 positive and 3201 generalized place invariants in 657 ms returned unsat
[2024-05-26 23:30:55] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2024-05-26 23:30:56] [INFO ] [Real]Absence check using 33 positive and 3201 generalized place invariants in 663 ms returned sat
[2024-05-26 23:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:30:57] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2024-05-26 23:30:57] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 100 transitions) in 35 ms.
[2024-05-26 23:31:00] [INFO ] Added : 120 causal constraints over 24 iterations in 2217 ms. Result :sat
Minimization took 279 ms.
[2024-05-26 23:31:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:31:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-26 23:31:01] [INFO ] [Nat]Absence check using 33 positive and 3201 generalized place invariants in 700 ms returned sat
[2024-05-26 23:31:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:31:02] [INFO ] [Nat]Absence check using state equation in 1233 ms returned sat
[2024-05-26 23:31:02] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 100 transitions) in 31 ms.
[2024-05-26 23:31:04] [INFO ] Added : 120 causal constraints over 24 iterations in 2009 ms. Result :sat
Minimization took 1025 ms.
[2024-05-26 23:31:06] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-26 23:31:06] [INFO ] [Real]Absence check using 33 positive and 3201 generalized place invariants in 704 ms returned sat
[2024-05-26 23:31:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:31:09] [INFO ] [Real]Absence check using state equation in 2973 ms returned sat
[2024-05-26 23:31:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:31:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-26 23:31:11] [INFO ] [Nat]Absence check using 33 positive and 3201 generalized place invariants in 660 ms returned sat
[2024-05-26 23:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:31:14] [INFO ] [Nat]Absence check using state equation in 3664 ms returned sat
[2024-05-26 23:31:14] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 100 transitions) in 28 ms.
[2024-05-26 23:31:17] [INFO ] Added : 146 causal constraints over 30 iterations in 2474 ms. Result :sat
Minimization took 481 ms.
[2024-05-26 23:31:18] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-26 23:31:18] [INFO ] [Real]Absence check using 33 positive and 3201 generalized place invariants in 678 ms returned sat
[2024-05-26 23:31:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:31:20] [INFO ] [Real]Absence check using state equation in 1741 ms returned sat
[2024-05-26 23:31:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:31:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-26 23:31:21] [INFO ] [Nat]Absence check using 33 positive and 3201 generalized place invariants in 666 ms returned sat
[2024-05-26 23:31:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:31:23] [INFO ] [Nat]Absence check using state equation in 1437 ms returned sat
[2024-05-26 23:31:23] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 100 transitions) in 28 ms.
[2024-05-26 23:31:24] [INFO ] Added : 119 causal constraints over 24 iterations in 1883 ms. Result :sat
Minimization took 234 ms.
[2024-05-26 23:31:25] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2024-05-26 23:31:26] [INFO ] [Real]Absence check using 33 positive and 3201 generalized place invariants in 627 ms returned sat
[2024-05-26 23:31:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:31:27] [INFO ] [Real]Absence check using state equation in 1403 ms returned sat
[2024-05-26 23:31:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:31:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-26 23:31:28] [INFO ] [Nat]Absence check using 33 positive and 3201 generalized place invariants in 679 ms returned sat
[2024-05-26 23:31:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:31:30] [INFO ] [Nat]Absence check using state equation in 1532 ms returned sat
[2024-05-26 23:31:30] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 100 transitions) in 28 ms.
[2024-05-26 23:31:31] [INFO ] Added : 67 causal constraints over 14 iterations in 1169 ms. Result :sat
Minimization took 418 ms.
[2024-05-26 23:31:32] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2024-05-26 23:31:32] [INFO ] [Real]Absence check using 33 positive and 3201 generalized place invariants in 664 ms returned sat
[2024-05-26 23:31:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:31:35] [INFO ] [Real]Absence check using state equation in 2958 ms returned sat
[2024-05-26 23:31:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:31:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-26 23:31:36] [INFO ] [Nat]Absence check using 33 positive and 3201 generalized place invariants in 665 ms returned sat
[2024-05-26 23:31:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:31:41] [INFO ] [Nat]Absence check using state equation in 4871 ms returned sat
[2024-05-26 23:31:41] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 100 transitions) in 30 ms.
[2024-05-26 23:31:43] [INFO ] Added : 113 causal constraints over 23 iterations in 1834 ms. Result :sat
Minimization took 465 ms.
[2024-05-26 23:31:44] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-26 23:31:45] [INFO ] [Real]Absence check using 33 positive and 3201 generalized place invariants in 837 ms returned sat
[2024-05-26 23:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:31:49] [INFO ] [Real]Absence check using state equation in 4249 ms returned sat
[2024-05-26 23:31:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:31:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-26 23:31:50] [INFO ] [Nat]Absence check using 33 positive and 3201 generalized place invariants in 854 ms returned sat
[2024-05-26 23:31:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:31:56] [INFO ] [Nat]Absence check using state equation in 5550 ms returned sat
[2024-05-26 23:31:56] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 100 transitions) in 32 ms.
[2024-05-26 23:31:58] [INFO ] Added : 135 causal constraints over 27 iterations in 2281 ms. Result :sat
Minimization took 411 ms.
[2024-05-26 23:31:59] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-26 23:32:00] [INFO ] [Real]Absence check using 33 positive and 3201 generalized place invariants in 641 ms returned sat
[2024-05-26 23:32:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:32:01] [INFO ] [Real]Absence check using state equation in 1130 ms returned sat
[2024-05-26 23:32:01] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 100 transitions) in 30 ms.
[2024-05-26 23:32:03] [INFO ] Added : 120 causal constraints over 24 iterations in 2143 ms. Result :sat
Minimization took 314 ms.
[2024-05-26 23:32:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:32:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-26 23:32:05] [INFO ] [Nat]Absence check using 33 positive and 3201 generalized place invariants in 671 ms returned sat
[2024-05-26 23:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:32:06] [INFO ] [Nat]Absence check using state equation in 1168 ms returned sat
[2024-05-26 23:32:06] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 100 transitions) in 27 ms.
[2024-05-26 23:32:08] [INFO ] Added : 120 causal constraints over 24 iterations in 1929 ms. Result :sat
Minimization took 698 ms.
Current structural bounds on expressions (after SMT) : [33, 33, 33, 33, 33, 33, 33, 1089, 33] Max seen :[33, 33, 14, 0, 0, 14, 0, 0, 14]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-03 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-00 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-14 33 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-13 1089 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-08 33 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-07 33 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-04 33 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-10 33 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-09 33 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 223576 ms.
BK_STOP 1716766331809
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is 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 r329-tall-171662361400031"
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 '
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 ;