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.r351-tall-171679102000246.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 SafeBus-COL-50, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102000246
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.6K Apr 12 14:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 12 14:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 14:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 14:44 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:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 14:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:50 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 43K 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-50-UpperBounds-00
FORMULA_NAME SafeBus-COL-50-UpperBounds-01
FORMULA_NAME SafeBus-COL-50-UpperBounds-02
FORMULA_NAME SafeBus-COL-50-UpperBounds-03
FORMULA_NAME SafeBus-COL-50-UpperBounds-04
FORMULA_NAME SafeBus-COL-50-UpperBounds-05
FORMULA_NAME SafeBus-COL-50-UpperBounds-06
FORMULA_NAME SafeBus-COL-50-UpperBounds-07
FORMULA_NAME SafeBus-COL-50-UpperBounds-08
FORMULA_NAME SafeBus-COL-50-UpperBounds-09
FORMULA_NAME SafeBus-COL-50-UpperBounds-10
FORMULA_NAME SafeBus-COL-50-UpperBounds-11
FORMULA_NAME SafeBus-COL-50-UpperBounds-12
FORMULA_NAME SafeBus-COL-50-UpperBounds-13
FORMULA_NAME SafeBus-COL-50-UpperBounds-14
FORMULA_NAME SafeBus-COL-50-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716865891682

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=SafeBus-COL-50
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-28 03:11:33] [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-28 03:11:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:11:33] [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-28 03:11:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 03:11:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 465 ms
[2024-05-28 03:11:33] [INFO ] Detected 1 constant HL places corresponding to 50 PT places.
[2024-05-28 03:11:33] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 5606 PT places and 6520101.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-28 03:11:33] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-05-28 03:11:33] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2024-05-28 03:11:33] [INFO ] Computed 7 invariants in 7 ms
FORMULA SafeBus-COL-50-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 03:11:33] [INFO ] Invariant cache hit.
[2024-05-28 03:11:33] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-28 03:11:33] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 03:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:33] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 03:11:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:11:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 03:11:33] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:33] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-28 03:11:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-28 03:11:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-28 03:11:33] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 03:11:33] [INFO ] Added : 10 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 10 ms.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-28 03:11:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-28 03:11:34] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 03:11:34] [INFO ] Added : 10 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 5 ms.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 11 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-28 03:11:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 03:11:34] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-28 03:11:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 03:11:34] [INFO ] Added : 13 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 6 ms.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 03:11:34] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-28 03:11:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 03:11:34] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 03:11:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 03:11:34] [INFO ] Added : 8 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-28 03:11:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 03:11:34] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-28 03:11:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 03:11:34] [INFO ] Added : 13 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 8 ms.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-28 03:11:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-28 03:11:34] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 03:11:34] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-28 03:11:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-28 03:11:34] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 03:11:34] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 5 ms.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-28 03:11:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-28 03:11:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-28 03:11:34] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 03:11:34] [INFO ] Added : 9 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [50, 1, 1, 1, 1, 50, 1, 5, 3, 50, 50, 1]
Domain [It(50), It(50)] of place AMC breaks symmetries in sort It
[2024-05-28 03:11:35] [INFO ] Unfolded HLPN to a Petri net with 5606 places and 140251 transitions 1078454 arcs in 848 ms.
[2024-05-28 03:11:35] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Deduced a syphon composed of 50 places in 250 ms
Reduce places removed 100 places and 100 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5918 ms. (steps per millisecond=1 ) properties (out of 12) seen :155
FORMULA SafeBus-COL-50-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-50-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-50-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-50-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-50-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-50-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 6) seen :150
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 945 ms. (steps per millisecond=10 ) properties (out of 6) seen :152
FORMULA SafeBus-COL-50-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 824 ms. (steps per millisecond=12 ) properties (out of 4) seen :55
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :32
[2024-05-28 03:11:45] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:11:46] [INFO ] Computed 205 invariants in 1385 ms
[2024-05-28 03:11:47] [INFO ] [Real]Absence check using 101 positive place invariants in 105 ms returned sat
[2024-05-28 03:11:47] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 223 ms returned sat
[2024-05-28 03:11:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:51] [INFO ] [Real]Absence check using state equation in 4195 ms returned unknown
[2024-05-28 03:11:52] [INFO ] [Real]Absence check using 101 positive place invariants in 102 ms returned sat
[2024-05-28 03:11:52] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 177 ms returned unsat
[2024-05-28 03:11:53] [INFO ] [Real]Absence check using 101 positive place invariants in 117 ms returned sat
[2024-05-28 03:11:53] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 101 ms returned unsat
[2024-05-28 03:11:53] [INFO ] [Real]Absence check using 101 positive place invariants in 111 ms returned sat
[2024-05-28 03:11:54] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 280 ms returned sat
[2024-05-28 03:11:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:11:58] [INFO ] [Real]Absence check using state equation in 4173 ms returned unknown
Current structural bounds on expressions (after SMT) : [50, 1, 1, 50] Max seen :[49, 1, 1, 30]
FORMULA SafeBus-COL-50-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-50-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 100 out of 5506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 25734 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25749 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Normalized transition count is 15202 out of 140151 initially.
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:12:25] [INFO ] Computed 205 invariants in 1220 ms
Finished random walk after 55921 steps, including 0 resets, run visited all 2 properties in 30002 ms. (steps per millisecond=1 )
Finished Best-First random walk after 64549 steps, including 0 resets, run visited all 2 properties in 5003 ms. (steps per millisecond=12 )
Finished Best-First random walk after 137676 steps, including 0 resets, run visited all 2 properties in 5004 ms. (steps per millisecond=27 )
[2024-05-28 03:13:05] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:13:06] [INFO ] Computed 205 invariants in 1208 ms
[2024-05-28 03:13:07] [INFO ] [Real]Absence check using 101 positive place invariants in 111 ms returned sat
[2024-05-28 03:13:07] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 207 ms returned sat
[2024-05-28 03:13:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:13:48] [INFO ] [Real]Absence check using state equation in 40670 ms returned sat
[2024-05-28 03:13:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:13:49] [INFO ] [Nat]Absence check using 101 positive place invariants in 101 ms returned sat
[2024-05-28 03:13:49] [INFO ] [Nat]Absence check using 101 positive and 104 generalized place invariants in 169 ms returned sat
[2024-05-28 03:13:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:14:10] [INFO ] [Nat]Absence check using state equation in 20993 ms returned unknown
[2024-05-28 03:14:10] [INFO ] [Real]Absence check using 101 positive place invariants in 108 ms returned sat
[2024-05-28 03:14:11] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 312 ms returned sat
[2024-05-28 03:14:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:14:39] [INFO ] [Real]Absence check using state equation in 28365 ms returned sat
[2024-05-28 03:14:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:14:40] [INFO ] [Nat]Absence check using 101 positive place invariants in 103 ms returned sat
[2024-05-28 03:14:40] [INFO ] [Nat]Absence check using 101 positive and 104 generalized place invariants in 318 ms returned sat
[2024-05-28 03:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:15:07] [INFO ] [Nat]Absence check using state equation in 26237 ms returned unknown
Current structural bounds on expressions (after SMT) : [50, 50] Max seen :[49, 49]
Support contains 100 out of 5506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 24289 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24290 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 18800 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
[2024-05-28 03:15:50] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-28 03:15:50] [INFO ] Invariant cache hit.
[2024-05-28 03:16:07] [INFO ] Implicit Places using invariants in 17594 ms returned []
Implicit Place search using SMT only with invariants took 17595 ms to find 0 implicit places.
[2024-05-28 03:16:07] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-28 03:16:07] [INFO ] Invariant cache hit.
[2024-05-28 03:16:38] [INFO ] Performed 57114/140151 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-28 03:17:07] [INFO ] Dead Transitions using invariants and state equation in 60039 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96453 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Normalized transition count is 15202 out of 140151 initially.
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:17:09] [INFO ] Computed 205 invariants in 1149 ms
Finished random walk after 61575 steps, including 0 resets, run visited all 2 properties in 30004 ms. (steps per millisecond=2 )
Finished Best-First random walk after 72493 steps, including 0 resets, run visited all 2 properties in 5005 ms. (steps per millisecond=14 )
Finished Best-First random walk after 144039 steps, including 0 resets, run visited all 2 properties in 5005 ms. (steps per millisecond=28 )
[2024-05-28 03:17:49] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:17:50] [INFO ] Computed 205 invariants in 1161 ms
[2024-05-28 03:17:51] [INFO ] [Real]Absence check using 101 positive place invariants in 102 ms returned sat
[2024-05-28 03:17:51] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 211 ms returned sat
[2024-05-28 03:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:18:31] [INFO ] [Real]Absence check using state equation in 40286 ms returned sat
[2024-05-28 03:18:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:18:32] [INFO ] [Nat]Absence check using 101 positive place invariants in 96 ms returned sat
[2024-05-28 03:18:32] [INFO ] [Nat]Absence check using 101 positive and 104 generalized place invariants in 155 ms returned sat
[2024-05-28 03:18:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:18:53] [INFO ] [Nat]Absence check using state equation in 20575 ms returned unknown
[2024-05-28 03:18:53] [INFO ] [Real]Absence check using 101 positive place invariants in 99 ms returned sat
[2024-05-28 03:18:54] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 307 ms returned sat
[2024-05-28 03:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:19:22] [INFO ] [Real]Absence check using state equation in 27992 ms returned sat
[2024-05-28 03:19:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:19:22] [INFO ] [Nat]Absence check using 101 positive place invariants in 98 ms returned sat
[2024-05-28 03:19:23] [INFO ] [Nat]Absence check using 101 positive and 104 generalized place invariants in 288 ms returned sat
[2024-05-28 03:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:19:49] [INFO ] [Nat]Absence check using state equation in 25803 ms returned unknown
Current structural bounds on expressions (after SMT) : [50, 50] Max seen :[49, 49]
Support contains 100 out of 5506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 18736 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18738 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 18461 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
[2024-05-28 03:20:26] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-28 03:20:26] [INFO ] Invariant cache hit.
[2024-05-28 03:20:43] [INFO ] Implicit Places using invariants in 17540 ms returned []
Implicit Place search using SMT only with invariants took 17541 ms to find 0 implicit places.
[2024-05-28 03:20:43] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-28 03:20:43] [INFO ] Invariant cache hit.
[2024-05-28 03:21:14] [INFO ] Performed 56737/140151 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-28 03:21:43] [INFO ] Dead Transitions using invariants and state equation in 60041 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96065 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Starting property specific reduction for SafeBus-COL-50-UpperBounds-00
Normalized transition count is 15202 out of 140151 initially.
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:21:45] [INFO ] Computed 205 invariants in 1214 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4700 ms. (steps per millisecond=2 ) properties (out of 1) seen :49
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 1) seen :49
[2024-05-28 03:21:50] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:21:51] [INFO ] Computed 205 invariants in 1141 ms
[2024-05-28 03:21:52] [INFO ] [Real]Absence check using 101 positive place invariants in 95 ms returned sat
[2024-05-28 03:21:52] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 204 ms returned sat
[2024-05-28 03:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:21:56] [INFO ] [Real]Absence check using state equation in 4271 ms returned unknown
Current structural bounds on expressions (after SMT) : [2451] Max seen :[49]
Support contains 50 out of 5506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 18008 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18018 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Normalized transition count is 15202 out of 140151 initially.
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:22:15] [INFO ] Computed 205 invariants in 1158 ms
Finished random walk after 55593 steps, including 0 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=1 )
Finished Best-First random walk after 66527 steps, including 0 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=13 )
[2024-05-28 03:22:51] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:22:52] [INFO ] Computed 205 invariants in 1131 ms
[2024-05-28 03:22:52] [INFO ] [Real]Absence check using 101 positive place invariants in 99 ms returned sat
[2024-05-28 03:22:52] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 208 ms returned sat
[2024-05-28 03:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:23:34] [INFO ] [Real]Absence check using state equation in 41245 ms returned sat
[2024-05-28 03:23:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:23:35] [INFO ] [Nat]Absence check using 101 positive place invariants in 103 ms returned sat
[2024-05-28 03:23:35] [INFO ] [Nat]Absence check using 101 positive and 104 generalized place invariants in 167 ms returned sat
[2024-05-28 03:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:23:55] [INFO ] [Nat]Absence check using state equation in 20148 ms returned unknown
Current structural bounds on expressions (after SMT) : [2451] Max seen :[49]
Support contains 50 out of 5506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 18380 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18380 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 18593 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
[2024-05-28 03:24:32] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-28 03:24:32] [INFO ] Invariant cache hit.
[2024-05-28 03:24:49] [INFO ] Implicit Places using invariants in 17376 ms returned []
Implicit Place search using SMT only with invariants took 17379 ms to find 0 implicit places.
[2024-05-28 03:24:49] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-28 03:24:49] [INFO ] Invariant cache hit.
[2024-05-28 03:25:20] [INFO ] Performed 55551/140151 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-28 03:25:49] [INFO ] Dead Transitions using invariants and state equation in 60045 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96031 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Ending property specific reduction for SafeBus-COL-50-UpperBounds-00 in 246047 ms.
Starting property specific reduction for SafeBus-COL-50-UpperBounds-14
Normalized transition count is 15202 out of 140151 initially.
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:25:51] [INFO ] Computed 205 invariants in 1164 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4933 ms. (steps per millisecond=2 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :27
[2024-05-28 03:25:56] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:25:57] [INFO ] Computed 205 invariants in 1135 ms
[2024-05-28 03:25:58] [INFO ] [Real]Absence check using 101 positive place invariants in 100 ms returned sat
[2024-05-28 03:25:58] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 269 ms returned sat
[2024-05-28 03:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:26:02] [INFO ] [Real]Absence check using state equation in 4199 ms returned unknown
Current structural bounds on expressions (after SMT) : [2451] Max seen :[27]
Support contains 50 out of 5506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 18443 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18447 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Normalized transition count is 15202 out of 140151 initially.
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:26:22] [INFO ] Computed 205 invariants in 1150 ms
Finished random walk after 59152 steps, including 0 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=1 )
Finished Best-First random walk after 145822 steps, including 0 resets, run visited all 1 properties in 5004 ms. (steps per millisecond=29 )
[2024-05-28 03:26:57] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:26:58] [INFO ] Computed 205 invariants in 1159 ms
[2024-05-28 03:26:59] [INFO ] [Real]Absence check using 101 positive place invariants in 101 ms returned sat
[2024-05-28 03:26:59] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 308 ms returned sat
[2024-05-28 03:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:27:27] [INFO ] [Real]Absence check using state equation in 28102 ms returned sat
[2024-05-28 03:27:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:27:28] [INFO ] [Nat]Absence check using 101 positive place invariants in 96 ms returned sat
[2024-05-28 03:27:28] [INFO ] [Nat]Absence check using 101 positive and 104 generalized place invariants in 293 ms returned sat
[2024-05-28 03:27:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:27:55] [INFO ] [Nat]Absence check using state equation in 26375 ms returned unknown
Current structural bounds on expressions (after SMT) : [2451] Max seen :[49]
Support contains 50 out of 5506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 18303 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18303 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 18295 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
[2024-05-28 03:28:31] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-28 03:28:31] [INFO ] Invariant cache hit.
[2024-05-28 03:28:49] [INFO ] Implicit Places using invariants in 17476 ms returned []
Implicit Place search using SMT only with invariants took 17479 ms to find 0 implicit places.
[2024-05-28 03:28:49] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-28 03:28:49] [INFO ] Invariant cache hit.
[2024-05-28 03:29:19] [INFO ] Performed 54166/140151 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-28 03:29:49] [INFO ] Dead Transitions using invariants and state equation in 60038 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95831 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Normalized transition count is 15202 out of 140151 initially.
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:29:50] [INFO ] Computed 205 invariants in 1192 ms
Finished random walk after 60153 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 143904 steps, including 0 resets, run visited all 1 properties in 5003 ms. (steps per millisecond=28 )
[2024-05-28 03:30:25] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-28 03:30:26] [INFO ] Computed 205 invariants in 1118 ms
[2024-05-28 03:30:27] [INFO ] [Real]Absence check using 101 positive place invariants in 98 ms returned sat
[2024-05-28 03:30:27] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 314 ms returned sat
[2024-05-28 03:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 03:30:55] [INFO ] [Real]Absence check using state equation in 27687 ms returned sat
[2024-05-28 03:30:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:30:56] [INFO ] [Nat]Absence check using 101 positive place invariants in 101 ms returned sat
[2024-05-28 03:30:56] [INFO ] [Nat]Absence check using 101 positive and 104 generalized place invariants in 297 ms returned sat
[2024-05-28 03:30:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 03:31:21] [INFO ] [Nat]Absence check using state equation in 25522 ms returned unknown
Current structural bounds on expressions (after SMT) : [2451] Max seen :[49]
Support contains 50 out of 5506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 17999 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17999 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 18564 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
[2024-05-28 03:31:58] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-28 03:31:58] [INFO ] Invariant cache hit.
[2024-05-28 03:32:15] [INFO ] Implicit Places using invariants in 17235 ms returned []
Implicit Place search using SMT only with invariants took 17236 ms to find 0 implicit places.
[2024-05-28 03:32:15] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-28 03:32:15] [INFO ] Invariant cache hit.
[2024-05-28 03:32:46] [INFO ] Performed 54737/140151 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-28 03:33:15] [INFO ] Dead Transitions using invariants and state equation in 60040 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95868 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Ending property specific reduction for SafeBus-COL-50-UpperBounds-14 in 445911 ms.
[2024-05-28 03:33:22] [INFO ] Flatten gal took : 5532 ms
[2024-05-28 03:33:26] [INFO ] Applying decomposition
[2024-05-28 03:33:31] [INFO ] Flatten gal took : 5257 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6944174328033160193.txt' '-o' '/tmp/graph6944174328033160193.bin' '-w' '/tmp/graph6944174328033160193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6944174328033160193.bin' '-l' '-1' '-v' '-w' '/tmp/graph6944174328033160193.weights' '-q' '0' '-e' '0.001'
[2024-05-28 03:33:44] [INFO ] Decomposing Gal with order
[2024-05-28 03:33:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 03:34:41] [INFO ] Removed a total of 482235 redundant transitions.
[2024-05-28 03:34:44] [INFO ] Flatten gal took : 56481 ms
[2024-05-28 03:35:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 17215 labels/synchronizations in 30377 ms.
[2024-05-28 03:35:27] [INFO ] Time to serialize gal into /tmp/UpperBounds18221661386158907517.gal : 3866 ms
[2024-05-28 03:35:27] [INFO ] Time to serialize properties into /tmp/UpperBounds17107323463407956370.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18221661386158907517.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17107323463407956370.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds17107323463407956370.prop.
Detected timeout of ITS tools.
[2024-05-28 04:02:46] [INFO ] Applying decomposition
[2024-05-28 04:02:52] [INFO ] Flatten gal took : 6170 ms
[2024-05-28 04:02:55] [INFO ] Decomposing Gal with order
[2024-05-28 04:02:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 04:03:35] [INFO ] Removed a total of 783641 redundant transitions.
[2024-05-28 04:03:37] [INFO ] Flatten gal took : 14181 ms
[2024-05-28 04:03:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 3653 ms.
[2024-05-28 04:03:45] [INFO ] Time to serialize gal into /tmp/UpperBounds18384542080742315776.gal : 1593 ms
[2024-05-28 04:03:45] [INFO ] Time to serialize properties into /tmp/UpperBounds14390297737924664434.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18384542080742315776.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14390297737924664434.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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="SafeBus-COL-50"
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 SafeBus-COL-50, 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 r351-tall-171679102000246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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