fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r359-smll-167891808600205
Last Updated
May 14, 2023

About the Execution of LoLa+red for SafeBus-COL-03

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
358.140 21354.00 31258.00 519.60 1 1 2 1 1 1 1 1 3 1 3 2 3 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r359-smll-167891808600205.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is SafeBus-COL-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891808600205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.8K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 42K Mar 5 18:23 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-03-UpperBounds-00
FORMULA_NAME SafeBus-COL-03-UpperBounds-01
FORMULA_NAME SafeBus-COL-03-UpperBounds-02
FORMULA_NAME SafeBus-COL-03-UpperBounds-03
FORMULA_NAME SafeBus-COL-03-UpperBounds-04
FORMULA_NAME SafeBus-COL-03-UpperBounds-05
FORMULA_NAME SafeBus-COL-03-UpperBounds-06
FORMULA_NAME SafeBus-COL-03-UpperBounds-07
FORMULA_NAME SafeBus-COL-03-UpperBounds-08
FORMULA_NAME SafeBus-COL-03-UpperBounds-09
FORMULA_NAME SafeBus-COL-03-UpperBounds-10
FORMULA_NAME SafeBus-COL-03-UpperBounds-11
FORMULA_NAME SafeBus-COL-03-UpperBounds-12
FORMULA_NAME SafeBus-COL-03-UpperBounds-13
FORMULA_NAME SafeBus-COL-03-UpperBounds-14
FORMULA_NAME SafeBus-COL-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679004307688

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 22:05:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-16 22:05:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 22:05:11] [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.
[2023-03-16 22:05:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 22:05:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 844 ms
[2023-03-16 22:05:12] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2023-03-16 22:05:12] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-16 22:05:12] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 5 ms.
[2023-03-16 22:05:12] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2023-03-16 22:05:12] [INFO ] Computed 7 place invariants in 4 ms
FORMULA SafeBus-COL-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-16 22:05:12] [INFO ] Invariant cache hit.
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-16 22:05:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:12] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 22:05:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-16 22:05:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-16 22:05:12] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 22:05:12] [INFO ] Added : 8 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 9 ms.
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-16 22:05:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:12] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-16 22:05:12] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 22:05:12] [INFO ] Added : 10 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 10 ms.
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-16 22:05:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:12] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2023-03-16 22:05:12] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 22:05:12] [INFO ] Added : 10 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 11 ms.
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-16 22:05:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-16 22:05:12] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 22:05:12] [INFO ] Added : 13 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 13 ms.
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-16 22:05:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-16 22:05:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-16 22:05:13] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-16 22:05:13] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-16 22:05:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-16 22:05:13] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 22:05:13] [INFO ] Added : 13 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 8 ms.
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 22:05:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-16 22:05:13] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-16 22:05:13] [INFO ] Added : 8 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 11 ms.
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-16 22:05:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-16 22:05:13] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 22:05:13] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 22:05:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-16 22:05:13] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 22:05:13] [INFO ] Added : 9 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [1, 3, 1, 1, 3, 3, 3, 1, 1]
Domain [It(3), It(3)] of place AMC breaks symmetries in sort It
[2023-03-16 22:05:13] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions 556 arcs in 22 ms.
[2023-03-16 22:05:13] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 6 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :13
FORMULA SafeBus-COL-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :5
[2023-03-16 22:05:13] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2023-03-16 22:05:13] [INFO ] Computed 17 place invariants in 11 ms
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:13] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-16 22:05:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 22:05:13] [INFO ] [Real]Added 13 Read/Feed constraints in 5 ms returned sat
[2023-03-16 22:05:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:13] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-16 22:05:13] [INFO ] [Nat]Added 13 Read/Feed constraints in 16 ms returned sat
[2023-03-16 22:05:13] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 16 ms.
[2023-03-16 22:05:14] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 8 ms to minimize.
[2023-03-16 22:05:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-16 22:05:14] [INFO ] Added : 15 causal constraints over 3 iterations in 197 ms. Result :sat
Minimization took 44 ms.
[2023-03-16 22:05:14] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-16 22:05:14] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 6 ms returned unsat
[2023-03-16 22:05:14] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-16 22:05:14] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-16 22:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:14] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-16 22:05:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-16 22:05:14] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 7 ms returned sat
[2023-03-16 22:05:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:14] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-16 22:05:14] [INFO ] [Nat]Added 13 Read/Feed constraints in 10 ms returned sat
[2023-03-16 22:05:14] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2023-03-16 22:05:14] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2023-03-16 22:05:14] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2023-03-16 22:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 250 ms
Current structural bounds on expressions (after SMT) : [3, 1, 2] Max seen :[2, 1, 2]
FORMULA SafeBus-COL-03-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 25 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 54/54 places, 91/91 transitions.
Normalized transition count is 68 out of 91 initially.
// Phase 1: matrix 68 rows 54 cols
[2023-03-16 22:05:14] [INFO ] Computed 17 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1943 ms. (steps per millisecond=514 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 723 ms. (steps per millisecond=1383 ) properties (out of 1) seen :2
[2023-03-16 22:05:17] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2023-03-16 22:05:17] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 22:05:17] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-16 22:05:17] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-16 22:05:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:17] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-16 22:05:17] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 22:05:17] [INFO ] [Real]Added 13 Read/Feed constraints in 4 ms returned sat
[2023-03-16 22:05:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-16 22:05:17] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-16 22:05:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:17] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-16 22:05:17] [INFO ] [Nat]Added 13 Read/Feed constraints in 9 ms returned sat
[2023-03-16 22:05:17] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 9 ms.
[2023-03-16 22:05:17] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2023-03-16 22:05:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-16 22:05:17] [INFO ] Added : 15 causal constraints over 3 iterations in 115 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 7 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-16 22:05:17] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2023-03-16 22:05:17] [INFO ] Invariant cache hit.
[2023-03-16 22:05:17] [INFO ] Implicit Places using invariants in 114 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 118 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/54 places, 91/91 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 94
Applied a total of 6 rules in 22 ms. Remains 48 /51 variables (removed 3) and now considering 94/91 (removed -3) transitions.
[2023-03-16 22:05:17] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-16 22:05:17] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-16 22:05:18] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-16 22:05:18] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-16 22:05:18] [INFO ] Invariant cache hit.
[2023-03-16 22:05:18] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 22:05:18] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 48/54 places, 94/91 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 401 ms. Remains : 48/54 places, 94/91 transitions.
Normalized transition count is 71 out of 94 initially.
// Phase 1: matrix 71 rows 48 cols
[2023-03-16 22:05:18] [INFO ] Computed 14 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1710 ms. (steps per millisecond=584 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 640 ms. (steps per millisecond=1562 ) properties (out of 1) seen :2
[2023-03-16 22:05:20] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-16 22:05:20] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-16 22:05:20] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:20] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-16 22:05:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:20] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-16 22:05:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-16 22:05:20] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-16 22:05:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:20] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-16 22:05:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 22:05:20] [INFO ] [Nat]Added 13 Read/Feed constraints in 18 ms returned sat
[2023-03-16 22:05:20] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 14 ms.
[2023-03-16 22:05:20] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2023-03-16 22:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-16 22:05:20] [INFO ] Added : 12 causal constraints over 3 iterations in 171 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 94/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 48/48 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 94/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-16 22:05:20] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-16 22:05:20] [INFO ] Invariant cache hit.
[2023-03-16 22:05:21] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-16 22:05:21] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-16 22:05:21] [INFO ] Invariant cache hit.
[2023-03-16 22:05:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 22:05:21] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-16 22:05:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 22:05:21] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-16 22:05:21] [INFO ] Invariant cache hit.
[2023-03-16 22:05:21] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 9 transitions.
Found 9 dead transitions using SMT.
Drop transitions removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 48/48 places, 85/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-16 22:05:21] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 398 ms. Remains : 48/48 places, 85/94 transitions.
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2023-03-16 22:05:21] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1320 ms. (steps per millisecond=757 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 611 ms. (steps per millisecond=1636 ) properties (out of 1) seen :2
[2023-03-16 22:05:23] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-16 22:05:23] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-16 22:05:23] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-16 22:05:23] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-16 22:05:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:23] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-16 22:05:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-16 22:05:23] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-16 22:05:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:23] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-16 22:05:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 22:05:23] [INFO ] [Nat]Added 13 Read/Feed constraints in 16 ms returned sat
[2023-03-16 22:05:23] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 9 ms.
[2023-03-16 22:05:23] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-16 22:05:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-16 22:05:23] [INFO ] Added : 27 causal constraints over 6 iterations in 162 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 48/48 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-16 22:05:23] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-16 22:05:23] [INFO ] Invariant cache hit.
[2023-03-16 22:05:23] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-16 22:05:23] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-16 22:05:23] [INFO ] Invariant cache hit.
[2023-03-16 22:05:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 22:05:24] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-16 22:05:24] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 22:05:24] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-16 22:05:24] [INFO ] Invariant cache hit.
[2023-03-16 22:05:24] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 470 ms. Remains : 48/48 places, 85/85 transitions.
Starting property specific reduction for SafeBus-COL-03-UpperBounds-02
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2023-03-16 22:05:24] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :2
[2023-03-16 22:05:24] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-16 22:05:24] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-16 22:05:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-16 22:05:24] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-16 22:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:24] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-16 22:05:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-16 22:05:24] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-16 22:05:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:24] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-16 22:05:24] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 22:05:24] [INFO ] [Nat]Added 13 Read/Feed constraints in 10 ms returned sat
[2023-03-16 22:05:24] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 12 ms.
[2023-03-16 22:05:24] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-16 22:05:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-16 22:05:24] [INFO ] Added : 27 causal constraints over 6 iterations in 163 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[2]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 7 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 48/48 places, 85/85 transitions.
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2023-03-16 22:05:24] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1662 ms. (steps per millisecond=601 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 612 ms. (steps per millisecond=1633 ) properties (out of 1) seen :2
[2023-03-16 22:05:27] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-16 22:05:27] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-16 22:05:27] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:27] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-16 22:05:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:27] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-16 22:05:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:05:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 22:05:27] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-16 22:05:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:05:27] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-16 22:05:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 22:05:27] [INFO ] [Nat]Added 13 Read/Feed constraints in 18 ms returned sat
[2023-03-16 22:05:27] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 13 ms.
[2023-03-16 22:05:27] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-16 22:05:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-16 22:05:27] [INFO ] Added : 27 causal constraints over 6 iterations in 178 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[2]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 48/48 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-16 22:05:27] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-16 22:05:27] [INFO ] Invariant cache hit.
[2023-03-16 22:05:27] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-16 22:05:27] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-16 22:05:27] [INFO ] Invariant cache hit.
[2023-03-16 22:05:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 22:05:27] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-16 22:05:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 22:05:27] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-16 22:05:27] [INFO ] Invariant cache hit.
[2023-03-16 22:05:27] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 48/48 places, 85/85 transitions.
Ending property specific reduction for SafeBus-COL-03-UpperBounds-02 in 3615 ms.
[2023-03-16 22:05:27] [INFO ] Flatten gal took : 61 ms
[2023-03-16 22:05:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-16 22:05:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 85 transitions and 502 arcs took 2 ms.
Total runtime 17022 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SafeBus-COL-03
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
Upper Bounds

FORMULA SafeBus-COL-03-UpperBounds-02 2 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679004329042

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 5 (type EXCL) for 0 SafeBus-COL-03-UpperBounds-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 SafeBus-COL-03-UpperBounds-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 SafeBus-COL-03-UpperBounds-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 3
sara: try reading problem file /home/mcc/execution/375/UpperBounds-4.sara.
sara: place or transition ordering is non-deterministic
lola: REPORT NUM
lola: FINISHED task # 5 (type EXCL) for SafeBus-COL-03-UpperBounds-02
lola: markings : 3444
lola: fired transitions : 8379
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for SafeBus-COL-03-UpperBounds-02 (obsolete)
lola: CANCELED task # 4 (type EQUN) for SafeBus-COL-03-UpperBounds-02 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SafeBus-COL-03-UpperBounds-02: BOUND 2 state space


Time elapsed: 1 secs. Pages in use: 1

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-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is SafeBus-COL-03, 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 r359-smll-167891808600205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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