About the Execution of Marcie+red for SafeBus-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7787.079 | 3600000.00 | 3656507.00 | 10358.30 | 1 10 1 1 ? 1 ? 1 1 1 1 9 1 1 10 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.r362-smll-167891812400221.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 marciexred
Input is SafeBus-COL-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812400221
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 01:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 01:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 01:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K 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 18K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 01:51 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-10-UpperBounds-00
FORMULA_NAME SafeBus-COL-10-UpperBounds-01
FORMULA_NAME SafeBus-COL-10-UpperBounds-02
FORMULA_NAME SafeBus-COL-10-UpperBounds-03
FORMULA_NAME SafeBus-COL-10-UpperBounds-04
FORMULA_NAME SafeBus-COL-10-UpperBounds-05
FORMULA_NAME SafeBus-COL-10-UpperBounds-06
FORMULA_NAME SafeBus-COL-10-UpperBounds-07
FORMULA_NAME SafeBus-COL-10-UpperBounds-08
FORMULA_NAME SafeBus-COL-10-UpperBounds-09
FORMULA_NAME SafeBus-COL-10-UpperBounds-10
FORMULA_NAME SafeBus-COL-10-UpperBounds-11
FORMULA_NAME SafeBus-COL-10-UpperBounds-12
FORMULA_NAME SafeBus-COL-10-UpperBounds-13
FORMULA_NAME SafeBus-COL-10-UpperBounds-14
FORMULA_NAME SafeBus-COL-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679022214296
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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 03:03:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-17 03:03:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 03:03:37] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-17 03:03:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 03:03:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 852 ms
[2023-03-17 03:03:38] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2023-03-17 03:03:38] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-17 03:03:38] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 6 ms.
[2023-03-17 03:03:38] [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-17 03:03:38] [INFO ] Computed 7 place invariants in 5 ms
FORMULA SafeBus-COL-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-17 03:03:38] [INFO ] Invariant cache hit.
[2023-03-17 03:03:38] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2023-03-17 03:03:38] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-17 03:03:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-17 03:03:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-17 03:03:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2023-03-17 03:03:39] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-17 03:03:39] [INFO ] Added : 10 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 22 ms.
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-17 03:03:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 03:03:39] [INFO ] Added : 9 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 14 ms.
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-17 03:03:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 03:03:39] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-17 03:03:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-17 03:03:39] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-17 03:03:39] [INFO ] Added : 10 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 17 ms.
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 03:03:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-17 03:03:39] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 03:03:39] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 10 ms.
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Added 3 Read/Feed constraints in 9 ms returned sat
[2023-03-17 03:03:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:39] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 03:03:39] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 8 ms.
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:39] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-17 03:03:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Added 3 Read/Feed constraints in 11 ms returned sat
[2023-03-17 03:03:40] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 03:03:40] [INFO ] Added : 9 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 10 ms.
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-17 03:03:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-17 03:03:40] [INFO ] Added : 13 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 13 ms.
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-17 03:03:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 03:03:40] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 14 ms.
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-17 03:03:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 03:03:40] [INFO ] Added : 8 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 11 ms.
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2023-03-17 03:03:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 03:03:40] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 03:03:40] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-17 03:03:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:40] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-17 03:03:40] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 03:03:40] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 03:03:40] [INFO ] Added : 13 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 10, 10, 5, 1, 1, 3, 10, 1, 10, 1]
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2023-03-17 03:03:40] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 150 ms.
[2023-03-17 03:03:40] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 20 places and 20 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 12) seen :31
FORMULA SafeBus-COL-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :32
FORMULA SafeBus-COL-10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :13
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :22
[2023-03-17 03:03:41] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 03:03:41] [INFO ] Computed 45 place invariants in 41 ms
[2023-03-17 03:03:41] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2023-03-17 03:03:41] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 21 ms returned sat
[2023-03-17 03:03:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:42] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2023-03-17 03:03:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-03-17 03:03:42] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-17 03:03:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:42] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2023-03-17 03:03:42] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 03:03:43] [INFO ] [Nat]Added 111 Read/Feed constraints in 821 ms returned sat
[2023-03-17 03:03:43] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 258 ms.
[2023-03-17 03:03:44] [INFO ] Added : 1 causal constraints over 1 iterations in 440 ms. Result :sat
Minimization took 393 ms.
[2023-03-17 03:03:44] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2023-03-17 03:03:44] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-17 03:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:44] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-17 03:03:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-03-17 03:03:45] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-17 03:03:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:45] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2023-03-17 03:03:46] [INFO ] [Nat]Added 111 Read/Feed constraints in 805 ms returned sat
[2023-03-17 03:03:46] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 121 ms.
[2023-03-17 03:03:46] [INFO ] Added : 0 causal constraints over 0 iterations in 204 ms. Result :sat
Minimization took 1906 ms.
[2023-03-17 03:03:48] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-03-17 03:03:48] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 12 ms returned unsat
[2023-03-17 03:03:48] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-03-17 03:03:48] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 11 ms returned unsat
[2023-03-17 03:03:48] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-03-17 03:03:48] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-17 03:03:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:48] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-17 03:03:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:03:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-03-17 03:03:49] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-17 03:03:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:03:49] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-17 03:03:49] [INFO ] [Nat]Added 111 Read/Feed constraints in 435 ms returned sat
[2023-03-17 03:03:49] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 85 ms.
[2023-03-17 03:03:50] [INFO ] Added : 1 causal constraints over 1 iterations in 300 ms. Result :sat
Minimization took 669 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 1, 1, 10] Max seen :[9, 9, 1, 1, 7]
FORMULA SafeBus-COL-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 30 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 362 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 306/306 places, 1631/1631 transitions.
Normalized transition count is 642 out of 1631 initially.
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 03:03:52] [INFO ] Computed 45 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7628 ms. (steps per millisecond=131 ) properties (out of 3) seen :17
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1979 ms. (steps per millisecond=505 ) properties (out of 3) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2980 ms. (steps per millisecond=335 ) properties (out of 3) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1874 ms. (steps per millisecond=533 ) properties (out of 3) seen :21
[2023-03-17 03:04:06] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 03:04:06] [INFO ] Computed 45 place invariants in 17 ms
[2023-03-17 03:04:06] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-17 03:04:06] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-17 03:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:07] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2023-03-17 03:04:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:04:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2023-03-17 03:04:07] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 21 ms returned sat
[2023-03-17 03:04:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:07] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2023-03-17 03:04:07] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 03:04:08] [INFO ] [Nat]Added 111 Read/Feed constraints in 705 ms returned sat
[2023-03-17 03:04:08] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 120 ms.
[2023-03-17 03:04:08] [INFO ] Added : 1 causal constraints over 1 iterations in 268 ms. Result :sat
Minimization took 413 ms.
[2023-03-17 03:04:09] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2023-03-17 03:04:09] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 21 ms returned sat
[2023-03-17 03:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:09] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-17 03:04:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:04:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2023-03-17 03:04:09] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-17 03:04:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:10] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2023-03-17 03:04:11] [INFO ] [Nat]Added 111 Read/Feed constraints in 979 ms returned sat
[2023-03-17 03:04:11] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 77 ms.
[2023-03-17 03:04:11] [INFO ] Added : 0 causal constraints over 0 iterations in 138 ms. Result :sat
Minimization took 1717 ms.
[2023-03-17 03:04:13] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2023-03-17 03:04:13] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-17 03:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:13] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2023-03-17 03:04:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:04:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2023-03-17 03:04:13] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-17 03:04:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:13] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2023-03-17 03:04:14] [INFO ] [Nat]Added 111 Read/Feed constraints in 527 ms returned sat
[2023-03-17 03:04:14] [INFO ] Deduced a trap composed of 57 places in 476 ms of which 9 ms to minimize.
[2023-03-17 03:04:15] [INFO ] Deduced a trap composed of 84 places in 484 ms of which 2 ms to minimize.
[2023-03-17 03:04:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1041 ms
Current structural bounds on expressions (after SMT) : [10, 10, 9] Max seen :[9, 9, 9]
FORMULA SafeBus-COL-10-UpperBounds-11 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 158 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 306/306 places, 1631/1631 transitions.
Normalized transition count is 642 out of 1631 initially.
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 03:04:16] [INFO ] Computed 45 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7519 ms. (steps per millisecond=132 ) properties (out of 2) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1701 ms. (steps per millisecond=587 ) properties (out of 2) seen :18
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2362 ms. (steps per millisecond=423 ) properties (out of 2) seen :10
[2023-03-17 03:04:27] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 03:04:27] [INFO ] Computed 45 place invariants in 9 ms
[2023-03-17 03:04:28] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2023-03-17 03:04:28] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-17 03:04:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:28] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2023-03-17 03:04:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:04:28] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-17 03:04:28] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-17 03:04:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:28] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2023-03-17 03:04:28] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 03:04:29] [INFO ] [Nat]Added 111 Read/Feed constraints in 627 ms returned sat
[2023-03-17 03:04:29] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 105 ms.
[2023-03-17 03:04:29] [INFO ] Added : 1 causal constraints over 1 iterations in 251 ms. Result :sat
Minimization took 383 ms.
[2023-03-17 03:04:30] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-03-17 03:04:30] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-17 03:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:30] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2023-03-17 03:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:04:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-17 03:04:30] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-17 03:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:30] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2023-03-17 03:04:31] [INFO ] [Nat]Added 111 Read/Feed constraints in 840 ms returned sat
[2023-03-17 03:04:31] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 80 ms.
[2023-03-17 03:04:31] [INFO ] Added : 0 causal constraints over 0 iterations in 140 ms. Result :sat
Minimization took 2124 ms.
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[9, 9]
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 181 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 138 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2023-03-17 03:04:35] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 03:04:35] [INFO ] Invariant cache hit.
[2023-03-17 03:04:36] [INFO ] Implicit Places using invariants in 1054 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1065 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 385 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1590 ms. Remains : 296/306 places, 1631/1631 transitions.
Normalized transition count is 642 out of 1631 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 03:04:36] [INFO ] Computed 35 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7005 ms. (steps per millisecond=142 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1520 ms. (steps per millisecond=657 ) properties (out of 2) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2454 ms. (steps per millisecond=407 ) properties (out of 2) seen :10
[2023-03-17 03:04:47] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 03:04:47] [INFO ] Computed 35 place invariants in 5 ms
[2023-03-17 03:04:47] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 03:04:47] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 03:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:47] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-03-17 03:04:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:04:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-17 03:04:48] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 03:04:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:48] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2023-03-17 03:04:48] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 03:04:49] [INFO ] [Nat]Added 111 Read/Feed constraints in 780 ms returned sat
[2023-03-17 03:04:49] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 71 ms.
[2023-03-17 03:04:49] [INFO ] Added : 1 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 284 ms.
[2023-03-17 03:04:49] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-17 03:04:49] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 17 ms returned sat
[2023-03-17 03:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:50] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2023-03-17 03:04:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:04:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-17 03:04:50] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-17 03:04:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:04:50] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2023-03-17 03:04:50] [INFO ] [Nat]Added 111 Read/Feed constraints in 550 ms returned sat
[2023-03-17 03:04:51] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 96 ms.
[2023-03-17 03:04:51] [INFO ] Added : 0 causal constraints over 0 iterations in 167 ms. Result :sat
Minimization took 920 ms.
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[9, 9]
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 191 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 296/296 places, 1631/1631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 224 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2023-03-17 03:04:52] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 03:04:52] [INFO ] Invariant cache hit.
[2023-03-17 03:04:53] [INFO ] Implicit Places using invariants in 870 ms returned []
[2023-03-17 03:04:53] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 03:04:53] [INFO ] Invariant cache hit.
[2023-03-17 03:04:54] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 03:04:57] [INFO ] Implicit Places using invariants and state equation in 3645 ms returned []
Implicit Place search using SMT with State Equation took 4519 ms to find 0 implicit places.
[2023-03-17 03:04:57] [INFO ] Redundant transitions in 314 ms returned []
[2023-03-17 03:04:57] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 03:04:57] [INFO ] Invariant cache hit.
[2023-03-17 03:05:00] [INFO ] Dead Transitions using invariants and state equation in 2617 ms found 100 transitions.
Found 100 dead transitions using SMT.
Drop transitions removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/296 places, 1531/1631 transitions.
Applied a total of 0 rules in 186 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 03:05:00] [INFO ] Redundant transitions in 85 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7977 ms. Remains : 296/296 places, 1531/1631 transitions.
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 03:05:00] [INFO ] Computed 35 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7047 ms. (steps per millisecond=141 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1541 ms. (steps per millisecond=648 ) properties (out of 2) seen :18
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2280 ms. (steps per millisecond=438 ) properties (out of 2) seen :10
[2023-03-17 03:05:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 03:05:11] [INFO ] Computed 35 place invariants in 9 ms
[2023-03-17 03:05:11] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-17 03:05:11] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 16 ms returned sat
[2023-03-17 03:05:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:05:11] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2023-03-17 03:05:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:05:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-17 03:05:12] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 12 ms returned sat
[2023-03-17 03:05:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:05:12] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-03-17 03:05:12] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 03:05:12] [INFO ] [Nat]Added 111 Read/Feed constraints in 391 ms returned sat
[2023-03-17 03:05:12] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 99 ms.
[2023-03-17 03:05:12] [INFO ] Added : 1 causal constraints over 1 iterations in 211 ms. Result :sat
Minimization took 593 ms.
[2023-03-17 03:05:13] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-17 03:05:13] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-17 03:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:05:13] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-17 03:05:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:05:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-17 03:05:13] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-17 03:05:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:05:14] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2023-03-17 03:05:14] [INFO ] [Nat]Added 111 Read/Feed constraints in 439 ms returned sat
[2023-03-17 03:05:15] [INFO ] Deduced a trap composed of 30 places in 522 ms of which 2 ms to minimize.
[2023-03-17 03:05:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 581 ms
[2023-03-17 03:05:15] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 99 ms.
[2023-03-17 03:05:15] [INFO ] Added : 0 causal constraints over 0 iterations in 171 ms. Result :sat
Minimization took 1107 ms.
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[9, 9]
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 186 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 183 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 03:05:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 03:05:17] [INFO ] Invariant cache hit.
[2023-03-17 03:05:17] [INFO ] Implicit Places using invariants in 696 ms returned []
[2023-03-17 03:05:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 03:05:17] [INFO ] Invariant cache hit.
[2023-03-17 03:05:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 03:05:20] [INFO ] Implicit Places using invariants and state equation in 2523 ms returned []
Implicit Place search using SMT with State Equation took 3221 ms to find 0 implicit places.
[2023-03-17 03:05:20] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-17 03:05:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 03:05:20] [INFO ] Invariant cache hit.
[2023-03-17 03:05:22] [INFO ] Dead Transitions using invariants and state equation in 1946 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5430 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting property specific reduction for SafeBus-COL-10-UpperBounds-04
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 03:05:22] [INFO ] Computed 35 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :9
[2023-03-17 03:05:22] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 03:05:22] [INFO ] Computed 35 place invariants in 7 ms
[2023-03-17 03:05:22] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-17 03:05:22] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 12 ms returned sat
[2023-03-17 03:05:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:05:23] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2023-03-17 03:05:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:05:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-17 03:05:23] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 16 ms returned sat
[2023-03-17 03:05:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:05:23] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2023-03-17 03:05:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 03:05:23] [INFO ] [Nat]Added 111 Read/Feed constraints in 346 ms returned sat
[2023-03-17 03:05:23] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 98 ms.
[2023-03-17 03:05:24] [INFO ] Added : 1 causal constraints over 1 iterations in 202 ms. Result :sat
Minimization took 565 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[9]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 198 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 296/296 places, 1531/1531 transitions.
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 03:05:25] [INFO ] Computed 35 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7051 ms. (steps per millisecond=141 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1421 ms. (steps per millisecond=703 ) properties (out of 1) seen :9
[2023-03-17 03:05:33] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 03:05:33] [INFO ] Computed 35 place invariants in 5 ms
[2023-03-17 03:05:33] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 03:05:33] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 03:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:05:33] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2023-03-17 03:05:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:05:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 03:05:33] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 12 ms returned sat
[2023-03-17 03:05:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:05:34] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-03-17 03:05:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 03:05:34] [INFO ] [Nat]Added 111 Read/Feed constraints in 588 ms returned sat
[2023-03-17 03:05:34] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 107 ms.
[2023-03-17 03:05:35] [INFO ] Added : 1 causal constraints over 1 iterations in 249 ms. Result :sat
Minimization took 940 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[9]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 115 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 129 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 03:05:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 03:05:36] [INFO ] Invariant cache hit.
[2023-03-17 03:05:36] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-17 03:05:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 03:05:36] [INFO ] Invariant cache hit.
[2023-03-17 03:05:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 03:05:39] [INFO ] Implicit Places using invariants and state equation in 3003 ms returned []
Implicit Place search using SMT with State Equation took 3607 ms to find 0 implicit places.
[2023-03-17 03:05:40] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-17 03:05:40] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 03:05:40] [INFO ] Invariant cache hit.
[2023-03-17 03:05:41] [INFO ] Dead Transitions using invariants and state equation in 1571 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5345 ms. Remains : 296/296 places, 1531/1531 transitions.
Ending property specific reduction for SafeBus-COL-10-UpperBounds-04 in 19097 ms.
Starting property specific reduction for SafeBus-COL-10-UpperBounds-06
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 03:05:41] [INFO ] Computed 35 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :9
[2023-03-17 03:05:41] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 03:05:41] [INFO ] Computed 35 place invariants in 7 ms
[2023-03-17 03:05:41] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-17 03:05:41] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-17 03:05:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:05:42] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2023-03-17 03:05:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:05:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-17 03:05:42] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-17 03:05:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:05:42] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2023-03-17 03:05:42] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 03:05:42] [INFO ] [Nat]Added 111 Read/Feed constraints in 375 ms returned sat
[2023-03-17 03:05:43] [INFO ] Deduced a trap composed of 30 places in 461 ms of which 3 ms to minimize.
[2023-03-17 03:05:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 513 ms
[2023-03-17 03:05:43] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 84 ms.
[2023-03-17 03:05:43] [INFO ] Added : 0 causal constraints over 0 iterations in 156 ms. Result :sat
Minimization took 1367 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[9]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 119 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 296/296 places, 1531/1531 transitions.
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 03:05:45] [INFO ] Computed 35 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6547 ms. (steps per millisecond=152 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2325 ms. (steps per millisecond=430 ) properties (out of 1) seen :9
[2023-03-17 03:05:54] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 03:05:54] [INFO ] Computed 35 place invariants in 7 ms
[2023-03-17 03:05:54] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-17 03:05:54] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 03:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:05:54] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2023-03-17 03:05:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:05:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-17 03:05:54] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-17 03:05:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:05:54] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2023-03-17 03:05:54] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 03:05:55] [INFO ] [Nat]Added 111 Read/Feed constraints in 377 ms returned sat
[2023-03-17 03:05:55] [INFO ] Deduced a trap composed of 30 places in 586 ms of which 2 ms to minimize.
[2023-03-17 03:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 641 ms
[2023-03-17 03:05:55] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 96 ms.
[2023-03-17 03:05:55] [INFO ] Added : 0 causal constraints over 0 iterations in 170 ms. Result :sat
Minimization took 1105 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[9]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 182 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 182 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 03:05:57] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 03:05:57] [INFO ] Invariant cache hit.
[2023-03-17 03:05:58] [INFO ] Implicit Places using invariants in 867 ms returned []
[2023-03-17 03:05:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 03:05:58] [INFO ] Invariant cache hit.
[2023-03-17 03:05:58] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 03:06:00] [INFO ] Implicit Places using invariants and state equation in 2374 ms returned []
Implicit Place search using SMT with State Equation took 3244 ms to find 0 implicit places.
[2023-03-17 03:06:00] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-17 03:06:00] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 03:06:00] [INFO ] Invariant cache hit.
[2023-03-17 03:06:03] [INFO ] Dead Transitions using invariants and state equation in 2122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5602 ms. Remains : 296/296 places, 1531/1531 transitions.
Ending property specific reduction for SafeBus-COL-10-UpperBounds-06 in 21462 ms.
[2023-03-17 03:06:03] [INFO ] Flatten gal took : 529 ms
[2023-03-17 03:06:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2023-03-17 03:06:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 296 places, 1531 transitions and 10104 arcs took 31 ms.
Total runtime 146178 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Document_unf
(NrP: 296 NrTr: 1531 NrArc: 10104)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.151sec
net check time: 0m 0.002sec
init dd package: 0m 3.373sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8354472 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095328 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.007sec
18424 32173 37966 52652 67712 74214 79688 84964 90118 93377 96666 105406 121347 130623 135873 150625 165469 171594 177282 182503 187552 190356 193803 197609 202654 206667 208952 214653 220220 224183 228002 231573 233543 235607 237635 240886 244120 247136 248837 250486 252297 253919 761310 960635 1087381 1191890 1176952 1145910 1162232 1255486 1256515 1266148 1268988 1236143 1207473 1196626 1123931 1031536 886399 601434 620758 668483 699234 707096 715310 718220 710235 715571 722649 727883 730376 725028 725277 724896 708535 689285 653339 1453331 1606551 1849521 1847735 1834223 1811676 1863767 1869803 1876215 1880841 1872237 1831602 1808644 1737935 1639774 1468342 1064571 1254238 1271818 1298226 1303853 1305267 1304013 1305606 1310909 1316806 1319440 1313068 1311665 1312503 1297298 1275050 1239092
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-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is SafeBus-COL-10, 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 r362-smll-167891812400221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-10.tgz
mv SafeBus-COL-10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;