Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r334-tall-171679080200381.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 itstools
Input is SafeBus-COL-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080200381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.0K Apr 12 15:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 15:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 15:29 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:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 12 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 16:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 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 42K 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 SafeBus-COL-15-UpperBounds-00
FORMULA_NAME SafeBus-COL-15-UpperBounds-01
FORMULA_NAME SafeBus-COL-15-UpperBounds-02
FORMULA_NAME SafeBus-COL-15-UpperBounds-03
FORMULA_NAME SafeBus-COL-15-UpperBounds-04
FORMULA_NAME SafeBus-COL-15-UpperBounds-05
FORMULA_NAME SafeBus-COL-15-UpperBounds-06
FORMULA_NAME SafeBus-COL-15-UpperBounds-07
FORMULA_NAME SafeBus-COL-15-UpperBounds-08
FORMULA_NAME SafeBus-COL-15-UpperBounds-09
FORMULA_NAME SafeBus-COL-15-UpperBounds-10
FORMULA_NAME SafeBus-COL-15-UpperBounds-11
FORMULA_NAME SafeBus-COL-15-UpperBounds-12
FORMULA_NAME SafeBus-COL-15-UpperBounds-13
FORMULA_NAME SafeBus-COL-15-UpperBounds-14
FORMULA_NAME SafeBus-COL-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716824196230

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-27 15:36:37] [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-27 15:36:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 15:36:37] [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-27 15:36:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 15:36:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 547 ms
[2024-05-27 15:36:37] [INFO ] Detected 1 constant HL places corresponding to 15 PT places.
[2024-05-27 15:36:37] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 636 PT places and 59206.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-27 15:36:38] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-05-27 15:36:38] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2024-05-27 15:36:38] [INFO ] Computed 7 invariants in 12 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 15, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0] Max Struct:[15, 15, 1, 1, 5, 1, 1, 15, 15, 1, 15, 1, 1, 3, 1, 1]
FORMULA SafeBus-COL-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-01 15 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 15:36:38] [INFO ] Invariant cache hit.
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-27 15:36:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-27 15:36:38] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 15:36:38] [INFO ] Added : 8 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 8 ms.
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 15:36:38] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-27 15:36:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:36:38] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:36:38] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:36:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:36:38] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:36:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 15:36:38] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-05-27 15:36:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:36:38] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:36:38] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:36:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:36:38] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:36:38] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2024-05-27 15:36:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:36:38] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:36:38] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 8 ms.
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-27 15:36:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-27 15:36:38] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:36:38] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 15:36:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:39] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-27 15:36:39] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:36:39] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:36:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:39] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:39] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-27 15:36:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:36:39] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:36:39] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 15:36:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:39] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:39] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-27 15:36:39] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:36:39] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:36:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:36:39] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:36:39] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-27 15:36:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:36:39] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:36:39] [INFO ] Added : 8 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[15, 1, 5, 1, 15, 15, 1, 15, 1, 3, 1]
Domain [It(15), It(15)] of place AMC breaks symmetries in sort It
[2024-05-27 15:36:39] [INFO ] Unfolded HLPN to a Petri net with 636 places and 4801 transitions 34264 arcs in 97 ms.
[2024-05-27 15:36:39] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 30 places and 30 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[15, 1, 5, 1, 15, 15, 1, 15, 1, 3, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[15, 1, 5, 1, 15, 15, 1, 15, 1, 3, 1]
[2024-05-27 15:36:39] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2024-05-27 15:36:39] [INFO ] Computed 65 invariants in 76 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[15, 1, 5, 1, 15, 15, 1, 15, 1, 3, 1]
RANDOM walk for 10000 steps (2 resets) in 346 ms. (28 steps per ms)
FORMULA SafeBus-COL-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-08 15 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-07 15 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 1, 14, 1] Max Struct:[15, 5, 15, 3]
[2024-05-27 15:36:39] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-05-27 15:36:39] [INFO ] Invariant cache hit.
[2024-05-27 15:36:40] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2024-05-27 15:36:40] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned sat
[2024-05-27 15:36:40] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-05-27 15:36:40] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 15:36:40] [INFO ] [Real]Added 241 Read/Feed constraints in 362 ms returned sat
[2024-05-27 15:36:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:41] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2024-05-27 15:36:41] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 13 ms returned sat
[2024-05-27 15:36:41] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2024-05-27 15:36:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 15:36:42] [INFO ] [Nat]Added 241 Read/Feed constraints in 1050 ms returned unknown
[2024-05-27 15:36:42] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2024-05-27 15:36:42] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned unsat
[2024-05-27 15:36:42] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2024-05-27 15:36:42] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned sat
[2024-05-27 15:36:43] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2024-05-27 15:36:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2024-05-27 15:36:43] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned sat
[2024-05-27 15:36:43] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2024-05-27 15:36:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 15:36:44] [INFO ] [Nat]Added 241 Read/Feed constraints in 1067 ms returned unknown
[2024-05-27 15:36:44] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2024-05-27 15:36:44] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[7, 1, 14, 1] Max Struct:[15, 1, 15, 1]
FORMULA SafeBus-COL-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 14] Max Struct:[15, 15]
Support contains 30 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1230 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1245 ms. Remains : 606/606 places, 4771/4771 transitions.
[2024-05-27 15:36:46] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-05-27 15:36:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7, 14] Max Struct:[15, 15]
RANDOM walk for 1000000 steps (2 resets) in 11879 ms. (84 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 4529 ms. (441 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13, 14] Max Struct:[15, 15]
[2024-05-27 15:37:02] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-05-27 15:37:02] [INFO ] Invariant cache hit.
[2024-05-27 15:37:02] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2024-05-27 15:37:02] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 16 ms returned sat
[2024-05-27 15:37:03] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2024-05-27 15:37:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:37:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2024-05-27 15:37:03] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned sat
[2024-05-27 15:37:03] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2024-05-27 15:37:03] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 15:37:04] [INFO ] [Nat]Added 241 Read/Feed constraints in 1014 ms returned sat
[2024-05-27 15:37:05] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 253 ms.
[2024-05-27 15:37:05] [INFO ] Added : 0 causal constraints over 0 iterations in 388 ms. Result :sat
Minimization took 2938 ms.
[2024-05-27 15:37:08] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2024-05-27 15:37:08] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 18 ms returned sat
[2024-05-27 15:37:08] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2024-05-27 15:37:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:37:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2024-05-27 15:37:08] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned sat
[2024-05-27 15:37:09] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2024-05-27 15:37:10] [INFO ] [Nat]Added 241 Read/Feed constraints in 1509 ms returned sat
[2024-05-27 15:37:11] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 198 ms.
[2024-05-27 15:37:11] [INFO ] Added : 0 causal constraints over 0 iterations in 306 ms. Result :sat
Minimization took 3554 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13, 14] Max Struct:[15, 15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13, 14] Max Struct:[15, 15]
Support contains 30 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 960 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 960 ms. Remains : 606/606 places, 4771/4771 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1082 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2024-05-27 15:37:17] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-05-27 15:37:17] [INFO ] Invariant cache hit.
[2024-05-27 15:37:19] [INFO ] Implicit Places using invariants in 1246 ms returned [496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1266 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 591/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1302 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3656 ms. Remains : 591/606 places, 4771/4771 transitions.
[2024-05-27 15:37:20] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2024-05-27 15:37:20] [INFO ] Computed 50 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[13, 14] Max Struct:[15, 15]
RANDOM walk for 1000000 steps (2 resets) in 11590 ms. (86 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 4394 ms. (455 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13, 14] Max Struct:[15, 15]
[2024-05-27 15:37:36] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-05-27 15:37:36] [INFO ] Invariant cache hit.
[2024-05-27 15:37:36] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-27 15:37:36] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned sat
[2024-05-27 15:37:36] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2024-05-27 15:37:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:37:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-27 15:37:36] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned sat
[2024-05-27 15:37:37] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2024-05-27 15:37:37] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 15:37:38] [INFO ] [Nat]Added 241 Read/Feed constraints in 1281 ms returned sat
[2024-05-27 15:37:38] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 154 ms.
[2024-05-27 15:37:39] [INFO ] Added : 0 causal constraints over 0 iterations in 264 ms. Result :sat
Minimization took 6466 ms.
[2024-05-27 15:37:45] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-27 15:37:45] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 23 ms returned sat
[2024-05-27 15:37:46] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2024-05-27 15:37:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:37:46] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-27 15:37:46] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned sat
[2024-05-27 15:37:46] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2024-05-27 15:37:50] [INFO ] [Nat]Added 241 Read/Feed constraints in 3388 ms returned sat
[2024-05-27 15:37:50] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 149 ms.
[2024-05-27 15:37:50] [INFO ] Added : 0 causal constraints over 0 iterations in 255 ms. Result :sat
Minimization took 6471 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13, 14] Max Struct:[15, 15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13, 14] Max Struct:[15, 15]
Support contains 30 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4771/4771 transitions.
Applied a total of 0 rules in 917 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 918 ms. Remains : 591/591 places, 4771/4771 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4771/4771 transitions.
Applied a total of 0 rules in 912 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2024-05-27 15:37:58] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-05-27 15:37:58] [INFO ] Invariant cache hit.
[2024-05-27 15:37:59] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2024-05-27 15:37:59] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-05-27 15:37:59] [INFO ] Invariant cache hit.
[2024-05-27 15:38:00] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 15:38:06] [INFO ] Implicit Places using invariants and state equation in 6402 ms returned []
Implicit Place search using SMT with State Equation took 7564 ms to find 0 implicit places.
[2024-05-27 15:38:06] [INFO ] Redundant transitions in 381 ms returned []
Running 4756 sub problems to find dead transitions.
[2024-05-27 15:38:06] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-05-27 15:38:06] [INFO ] Invariant cache hit.
[2024-05-27 15:38:06] [INFO ] State equation strengthened by 241 read => feed constraints.
Problem TDEAD211 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2911 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3361 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 19/19 constraints. Problems are: Problem set: 15 solved, 4741 unsolved
SMT process timed out in 58956ms, After SMT, problems are : Problem set: 15 solved, 4741 unsolved
Search for dead transitions found 15 dead transitions in 59022ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 591/591 places, 4756/4771 transitions.
Applied a total of 0 rules in 891 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-05-27 15:39:06] [INFO ] Redundant transitions in 302 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69127 ms. Remains : 591/591 places, 4756/4771 transitions.
[2024-05-27 15:39:06] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-05-27 15:39:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[13, 14] Max Struct:[15, 15]
RANDOM walk for 1000000 steps (2 resets) in 11594 ms. (86 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 4306 ms. (464 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13, 14] Max Struct:[15, 15]
[2024-05-27 15:39:22] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-05-27 15:39:22] [INFO ] Invariant cache hit.
[2024-05-27 15:39:22] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-27 15:39:22] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned sat
[2024-05-27 15:39:23] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2024-05-27 15:39:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:39:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-27 15:39:23] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned sat
[2024-05-27 15:39:23] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2024-05-27 15:39:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 15:39:24] [INFO ] [Nat]Added 241 Read/Feed constraints in 1047 ms returned sat
[2024-05-27 15:39:25] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 145 ms.
[2024-05-27 15:39:25] [INFO ] Added : 0 causal constraints over 0 iterations in 260 ms. Result :sat
Minimization took 6471 ms.
[2024-05-27 15:39:31] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-27 15:39:31] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned sat
[2024-05-27 15:39:32] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2024-05-27 15:39:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:39:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-27 15:39:32] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2024-05-27 15:39:32] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2024-05-27 15:39:35] [INFO ] [Nat]Added 241 Read/Feed constraints in 2342 ms returned sat
[2024-05-27 15:39:35] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 144 ms.
[2024-05-27 15:39:35] [INFO ] Added : 0 causal constraints over 0 iterations in 248 ms. Result :sat
Minimization took 6370 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13, 14] Max Struct:[15, 15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13, 14] Max Struct:[15, 15]
Support contains 30 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 904 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 907 ms. Remains : 591/591 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 897 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-05-27 15:39:43] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-05-27 15:39:43] [INFO ] Invariant cache hit.
[2024-05-27 15:39:44] [INFO ] Implicit Places using invariants in 1117 ms returned []
[2024-05-27 15:39:44] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-05-27 15:39:44] [INFO ] Invariant cache hit.
[2024-05-27 15:39:45] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 15:39:51] [INFO ] Implicit Places using invariants and state equation in 6884 ms returned []
Implicit Place search using SMT with State Equation took 8004 ms to find 0 implicit places.
[2024-05-27 15:39:52] [INFO ] Redundant transitions in 276 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-05-27 15:39:52] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-05-27 15:39:52] [INFO ] Invariant cache hit.
[2024-05-27 15:39:52] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 58333ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 58379ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67574 ms. Remains : 591/591 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 1603 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 289 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
[2024-05-27 15:40:51] [INFO ] Flatten gal took : 684 ms
[2024-05-27 15:40:51] [INFO ] Flatten gal took : 414 ms
[2024-05-27 15:40:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1080078281789431471.gal : 104 ms
[2024-05-27 15:40:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11566642595325070290.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1080078281789431471.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11566642595325070290.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11566642595325070290.prop.
Interrupted probabilistic random walk after 130590 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 4
Probabilistic random walk after 130590 steps, saw 76212 distinct states, run finished after 3004 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-27 15:40:54] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-05-27 15:40:54] [INFO ] Invariant cache hit.
[2024-05-27 15:40:54] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 499/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 15:40:54] [INFO ] Deduced a trap composed of 46 places in 414 ms of which 26 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
[2024-05-27 15:40:55] [INFO ] Deduced a trap composed of 61 places in 382 ms of which 4 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 12
[2024-05-27 15:40:55] [INFO ] Deduced a trap composed of 61 places in 371 ms of which 4 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :12 after 32
[2024-05-27 15:40:56] [INFO ] Deduced a trap composed of 61 places in 397 ms of which 20 ms to minimize.
[2024-05-27 15:40:56] [INFO ] Deduced a trap composed of 61 places in 335 ms of which 5 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :32 after 46
[2024-05-27 15:40:56] [INFO ] Deduced a trap composed of 61 places in 364 ms of which 4 ms to minimize.
[2024-05-27 15:40:57] [INFO ] Deduced a trap composed of 61 places in 330 ms of which 3 ms to minimize.
[2024-05-27 15:40:57] [INFO ] Deduced a trap composed of 61 places in 339 ms of which 3 ms to minimize.
[2024-05-27 15:40:57] [INFO ] Deduced a trap composed of 61 places in 341 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :46 after 152
[2024-05-27 15:40:58] [INFO ] Deduced a trap composed of 61 places in 344 ms of which 3 ms to minimize.
[2024-05-27 15:40:58] [INFO ] Deduced a trap composed of 359 places in 312 ms of which 3 ms to minimize.
[2024-05-27 15:40:58] [INFO ] Deduced a trap composed of 302 places in 308 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 12/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/530 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 58/588 variables, 31/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/589 variables, 1/61 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 5093ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 901 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 903 ms. Remains : 591/591 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 770 ms. (51 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :152 after 292
Interrupted probabilistic random walk after 119749 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 3
Probabilistic random walk after 119749 steps, saw 70119 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-27 15:41:03] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-05-27 15:41:03] [INFO ] Invariant cache hit.
[2024-05-27 15:41:03] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 499/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 15:41:04] [INFO ] Deduced a trap composed of 46 places in 350 ms of which 3 ms to minimize.
[2024-05-27 15:41:04] [INFO ] Deduced a trap composed of 61 places in 341 ms of which 4 ms to minimize.
[2024-05-27 15:41:04] [INFO ] Deduced a trap composed of 61 places in 337 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/530 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 58/588 variables, 31/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 15:41:05] [INFO ] Deduced a trap composed of 31 places in 545 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/589 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1411/2000 variables, 589/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2000 variables, 240/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2000 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/2003 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/2003 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2003 variables, 1/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2003 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/2003 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2003/2003 variables, and 886 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4293 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 499/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :292 after 1076
[2024-05-27 15:41:08] [INFO ] Deduced a trap composed of 46 places in 331 ms of which 3 ms to minimize.
[2024-05-27 15:41:08] [INFO ] Deduced a trap composed of 64 places in 348 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 15:41:09] [INFO ] Deduced a trap composed of 333 places in 290 ms of which 3 ms to minimize.
[2024-05-27 15:41:09] [INFO ] Deduced a trap composed of 358 places in 293 ms of which 3 ms to minimize.
[2024-05-27 15:41:09] [INFO ] Deduced a trap composed of 357 places in 293 ms of which 3 ms to minimize.
[2024-05-27 15:41:10] [INFO ] Deduced a trap composed of 329 places in 291 ms of which 3 ms to minimize.
[2024-05-27 15:41:10] [INFO ] Deduced a trap composed of 349 places in 295 ms of which 3 ms to minimize.
[2024-05-27 15:41:10] [INFO ] Deduced a trap composed of 354 places in 298 ms of which 3 ms to minimize.
[2024-05-27 15:41:11] [INFO ] Deduced a trap composed of 354 places in 297 ms of which 3 ms to minimize.
[2024-05-27 15:41:11] [INFO ] Deduced a trap composed of 358 places in 301 ms of which 3 ms to minimize.
[2024-05-27 15:41:11] [INFO ] Deduced a trap composed of 321 places in 296 ms of which 3 ms to minimize.
[2024-05-27 15:41:12] [INFO ] Deduced a trap composed of 329 places in 295 ms of which 3 ms to minimize.
[2024-05-27 15:41:12] [INFO ] Deduced a trap composed of 357 places in 298 ms of which 3 ms to minimize.
[2024-05-27 15:41:12] [INFO ] Deduced a trap composed of 349 places in 298 ms of which 3 ms to minimize.
[2024-05-27 15:41:12] [INFO ] Deduced a trap composed of 357 places in 292 ms of which 2 ms to minimize.
[2024-05-27 15:41:13] [INFO ] Deduced a trap composed of 357 places in 291 ms of which 3 ms to minimize.
[2024-05-27 15:41:13] [INFO ] Deduced a trap composed of 333 places in 292 ms of which 3 ms to minimize.
[2024-05-27 15:41:13] [INFO ] Deduced a trap composed of 357 places in 290 ms of which 4 ms to minimize.
[2024-05-27 15:41:14] [INFO ] Deduced a trap composed of 349 places in 298 ms of which 9 ms to minimize.
[2024-05-27 15:41:14] [INFO ] Deduced a trap composed of 358 places in 292 ms of which 3 ms to minimize.
[2024-05-27 15:41:14] [INFO ] Deduced a trap composed of 358 places in 296 ms of which 3 ms to minimize.
[2024-05-27 15:41:15] [INFO ] Deduced a trap composed of 349 places in 293 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 15:41:15] [INFO ] Deduced a trap composed of 46 places in 343 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/530 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 58/588 variables, 31/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/589 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1411/2000 variables, 589/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2000 variables, 240/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem MAX1 is UNSAT
Problem MIN1 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/2000 variables, 3/908 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2000 variables, 0/908 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/2003 variables, 2/910 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2003 variables, 1/911 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2003 variables, 1/912 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2003 variables, 0/912 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2003 variables, 0/912 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2003/2003 variables, and 912 constraints, problems are : Problem set: 2 solved, 1 unsolved in 9471 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 27/27 constraints]
After SMT, in 13858ms problems are : Problem set: 2 solved, 1 unsolved
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1076 after 4724
Parikh walk visited 0 properties in 3623 ms.
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 591 transition count 4741
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 576 transition count 4741
Applied a total of 30 rules in 901 ms. Remains 576 /591 variables (removed 15) and now considering 4741/4756 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 901 ms. Remains : 576/591 places, 4741/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 748 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 164156 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 1
Probabilistic random walk after 164156 steps, saw 104251 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
[2024-05-27 15:41:25] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2024-05-27 15:41:25] [INFO ] Computed 50 invariants in 24 ms
[2024-05-27 15:41:25] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 513/528 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/529 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/573 variables, 30/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 15:41:26] [INFO ] Deduced a trap composed of 105 places in 550 ms of which 3 ms to minimize.
[2024-05-27 15:41:26] [INFO ] Deduced a trap composed of 103 places in 555 ms of which 4 ms to minimize.
[2024-05-27 15:41:27] [INFO ] Deduced a trap composed of 104 places in 561 ms of which 3 ms to minimize.
[2024-05-27 15:41:27] [INFO ] Deduced a trap composed of 94 places in 551 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1396/1970 variables, 574/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1970 variables, 240/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1970 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1973 variables, 2/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1973 variables, 1/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1973 variables, 1/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1973 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1973 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1973/1973 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3214 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 513/528 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 15:41:29] [INFO ] Deduced a trap composed of 31 places in 344 ms of which 3 ms to minimize.
[2024-05-27 15:41:29] [INFO ] Deduced a trap composed of 46 places in 349 ms of which 3 ms to minimize.
[2024-05-27 15:41:29] [INFO ] Deduced a trap composed of 309 places in 312 ms of which 4 ms to minimize.
[2024-05-27 15:41:30] [INFO ] Deduced a trap composed of 308 places in 319 ms of which 4 ms to minimize.
[2024-05-27 15:41:30] [INFO ] Deduced a trap composed of 308 places in 322 ms of which 3 ms to minimize.
[2024-05-27 15:41:30] [INFO ] Deduced a trap composed of 310 places in 317 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/529 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 44/573 variables, 30/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/574 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1396/1970 variables, 574/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1970 variables, 240/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1970 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1970 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1973 variables, 2/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1973 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1973 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1973 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1973 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1973/1973 variables, and 878 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3534 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 6821ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 701 ms.
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 906 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 907 ms. Remains : 576/576 places, 4741/4741 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 898 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
[2024-05-27 15:41:34] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2024-05-27 15:41:34] [INFO ] Invariant cache hit.
[2024-05-27 15:41:35] [INFO ] Implicit Places using invariants in 1065 ms returned []
[2024-05-27 15:41:35] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2024-05-27 15:41:35] [INFO ] Invariant cache hit.
[2024-05-27 15:41:36] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 15:41:41] [INFO ] Implicit Places using invariants and state equation in 5580 ms returned []
Implicit Place search using SMT with State Equation took 6648 ms to find 0 implicit places.
[2024-05-27 15:41:41] [INFO ] Redundant transitions in 192 ms returned []
Running 4726 sub problems to find dead transitions.
[2024-05-27 15:41:41] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2024-05-27 15:41:41] [INFO ] Invariant cache hit.
[2024-05-27 15:41:41] [INFO ] State equation strengthened by 241 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-27 15:41:42] [INFO ] Flatten gal took : 226 ms
[2024-05-27 15:41:42] [INFO ] Applying decomposition
[2024-05-27 15:41:42] [INFO ] Flatten gal took : 202 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15073404239177578867.txt' '-o' '/tmp/graph15073404239177578867.bin' '-w' '/tmp/graph15073404239177578867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15073404239177578867.bin' '-l' '-1' '-v' '-w' '/tmp/graph15073404239177578867.weights' '-q' '0' '-e' '0.001'
[2024-05-27 15:41:43] [INFO ] Decomposing Gal with order
[2024-05-27 15:41:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:41:44] [INFO ] Removed a total of 887 redundant transitions.
[2024-05-27 15:41:44] [INFO ] Flatten gal took : 723 ms
[2024-05-27 15:41:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 821 labels/synchronizations in 357 ms.
[2024-05-27 15:41:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16911400182039132903.gal : 42 ms
[2024-05-27 15:41:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8757847914572392576.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16911400182039132903.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8757847914572392576.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8757847914572392576.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 228
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :228 after 236
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :236 after 246
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :246 after 264
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :264 after 300
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :300 after 356
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :356 after 624
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :624 after 980
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :980 after 1736

BK_STOP 1716824553377

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="SafeBus-COL-15"
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-5568"
echo " Executing tool itstools"
echo " Input is SafeBus-COL-15, 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 r334-tall-171679080200381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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