fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r041-tajo-167813694300117
Last Updated
May 14, 2023

About the Execution of LTSMin+red for BridgeAndVehicles-COL-V80P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1845.680 3600000.00 14172848.00 115.40 80 80 80 80 80 80 80 1 1 1 80 ? ? 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694300117.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BridgeAndVehicles-COL-V80P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694300117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 9.8K Feb 25 12:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 12:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 12:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 45K Mar 5 18:22 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 BridgeAndVehicles-COL-V80P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678607805833

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P20N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 07:56:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 07:56:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:56:47] [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-12 07:56:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 07:56:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 474 ms
[2023-03-12 07:56:48] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-12 07:56:48] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2023-03-12 07:56:48] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 07:56:48] [INFO ] Computed 4 place invariants in 3 ms
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-05 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-02 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-00 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-12 07:56:48] [INFO ] Invariant cache hit.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 07:56:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 07:56:48] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 07:56:48] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-12 07:56:48] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 07:56:48] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 07:56:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-12 07:56:48] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 07:56:48] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 07:56:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 07:56:48] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 07:56:48] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 07:56:48] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 07:56:48] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 07:56:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-12 07:56:48] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 07:56:48] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 2 ms.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 07:56:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 07:56:48] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 07:56:48] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-12 07:56:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 07:56:48] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 07:56:48] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 07:56:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 07:56:48] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 07:56:48] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-12 07:56:48] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 07:56:48] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 07:56:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 07:56:48] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 07:56:48] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 07:56:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:48] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 07:56:48] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 07:56:48] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [80, 80, 80, 80, 1, 1, 20, 20, 1, 1]
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-12 07:56:49] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 101 ms.
[2023-03-12 07:56:49] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 10) seen :314
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-04 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :162
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-01 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :20
[2023-03-12 07:56:49] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-12 07:56:49] [INFO ] Computed 7 place invariants in 24 ms
[2023-03-12 07:56:49] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-12 07:56:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:49] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-12 07:56:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:56:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 07:56:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:49] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-12 07:56:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:56:49] [INFO ] [Nat]Added 22 Read/Feed constraints in 49 ms returned sat
[2023-03-12 07:56:50] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 6 ms to minimize.
[2023-03-12 07:56:50] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2023-03-12 07:56:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 701 ms
[2023-03-12 07:56:50] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 110 ms.
[2023-03-12 07:56:50] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 2 ms to minimize.
[2023-03-12 07:56:51] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 2 ms to minimize.
[2023-03-12 07:56:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 553 ms
[2023-03-12 07:56:51] [INFO ] Added : 11 causal constraints over 3 iterations in 773 ms. Result :sat
Minimization took 83 ms.
[2023-03-12 07:56:51] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 07:56:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:51] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-12 07:56:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:56:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-12 07:56:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:56:51] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-12 07:56:51] [INFO ] [Nat]Added 22 Read/Feed constraints in 60 ms returned sat
[2023-03-12 07:56:52] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 1 ms to minimize.
[2023-03-12 07:56:52] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 0 ms to minimize.
[2023-03-12 07:56:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 694 ms
[2023-03-12 07:56:52] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 140 ms.
[2023-03-12 07:56:52] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 1 ms to minimize.
[2023-03-12 07:56:53] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 1 ms to minimize.
[2023-03-12 07:56:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 630 ms
[2023-03-12 07:56:53] [INFO ] Added : 11 causal constraints over 3 iterations in 923 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : [20, 20] Max seen :[10, 10]
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 338 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:56:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 07:56:54] [INFO ] Computed 5 place invariants in 20 ms
[2023-03-12 07:56:54] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1135 ms. Remains : 185/188 places, 2107/2108 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 07:56:54] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 6553 ms. (steps per millisecond=152 ) properties (out of 2) seen :18
Incomplete Best-First random walk after 1000001 steps, including 695 resets, run finished after 2589 ms. (steps per millisecond=386 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000000 steps, including 696 resets, run finished after 2807 ms. (steps per millisecond=356 ) properties (out of 2) seen :20
[2023-03-12 07:57:06] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-12 07:57:06] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 07:57:06] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 07:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:07] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-12 07:57:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:57:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:07] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-12 07:57:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:07] [INFO ] [Nat]Added 22 Read/Feed constraints in 55 ms returned sat
[2023-03-12 07:57:07] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 58 ms.
[2023-03-12 07:57:07] [INFO ] Added : 11 causal constraints over 3 iterations in 235 ms. Result :sat
Minimization took 99 ms.
[2023-03-12 07:57:07] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:07] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-12 07:57:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:57:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:07] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-12 07:57:08] [INFO ] [Nat]Added 22 Read/Feed constraints in 56 ms returned sat
[2023-03-12 07:57:08] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 80 ms.
[2023-03-12 07:57:08] [INFO ] Added : 11 causal constraints over 3 iterations in 267 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [20, 20] Max seen :[10, 10]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 189 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 293 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:57:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:09] [INFO ] Invariant cache hit.
[2023-03-12 07:57:09] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-12 07:57:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:09] [INFO ] Invariant cache hit.
[2023-03-12 07:57:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:11] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1845 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 186 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2325 ms. Remains : 183/185 places, 2107/2107 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:57:11] [INFO ] Computed 5 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 6320 ms. (steps per millisecond=158 ) properties (out of 2) seen :18
Incomplete Best-First random walk after 1000000 steps, including 695 resets, run finished after 2559 ms. (steps per millisecond=390 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 695 resets, run finished after 2586 ms. (steps per millisecond=386 ) properties (out of 2) seen :20
[2023-03-12 07:57:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:57:23] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 07:57:23] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:57:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:23] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-12 07:57:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:23] [INFO ] [Real]Added 22 Read/Feed constraints in 36 ms returned sat
[2023-03-12 07:57:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:57:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:57:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:23] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-12 07:57:23] [INFO ] [Nat]Added 22 Read/Feed constraints in 43 ms returned sat
[2023-03-12 07:57:23] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 69 ms.
[2023-03-12 07:57:23] [INFO ] Added : 10 causal constraints over 2 iterations in 434 ms. Result :sat
Minimization took 87 ms.
[2023-03-12 07:57:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:57:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:24] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-12 07:57:24] [INFO ] [Real]Added 22 Read/Feed constraints in 33 ms returned sat
[2023-03-12 07:57:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:57:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:57:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:24] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-12 07:57:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 40 ms returned sat
[2023-03-12 07:57:24] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 54 ms.
[2023-03-12 07:57:24] [INFO ] Added : 10 causal constraints over 2 iterations in 428 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : [20, 20] Max seen :[10, 10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 164 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 157 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:57:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:25] [INFO ] Invariant cache hit.
[2023-03-12 07:57:26] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-12 07:57:26] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:26] [INFO ] Invariant cache hit.
[2023-03-12 07:57:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:28] [INFO ] Implicit Places using invariants and state equation in 2126 ms returned []
Implicit Place search using SMT with State Equation took 2475 ms to find 0 implicit places.
[2023-03-12 07:57:28] [INFO ] Redundant transitions in 187 ms returned []
[2023-03-12 07:57:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:28] [INFO ] Invariant cache hit.
[2023-03-12 07:57:29] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3632 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-11
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:57:29] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :10
[2023-03-12 07:57:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:57:29] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:57:29] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:57:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:29] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-12 07:57:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:29] [INFO ] [Real]Added 22 Read/Feed constraints in 34 ms returned sat
[2023-03-12 07:57:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:57:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:57:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:29] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-12 07:57:29] [INFO ] [Nat]Added 22 Read/Feed constraints in 41 ms returned sat
[2023-03-12 07:57:29] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 50 ms.
[2023-03-12 07:57:30] [INFO ] Added : 10 causal constraints over 2 iterations in 389 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 167 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:57:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:30] [INFO ] Invariant cache hit.
[2023-03-12 07:57:31] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 923 ms. Remains : 183/183 places, 2107/2107 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:57:31] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 6127 ms. (steps per millisecond=163 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 696 resets, run finished after 2320 ms. (steps per millisecond=431 ) properties (out of 1) seen :10
[2023-03-12 07:57:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:57:39] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:57:39] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:57:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:39] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-12 07:57:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:40] [INFO ] [Real]Added 22 Read/Feed constraints in 53 ms returned sat
[2023-03-12 07:57:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:57:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:40] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-12 07:57:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 57 ms returned sat
[2023-03-12 07:57:40] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 92 ms.
[2023-03-12 07:57:40] [INFO ] Added : 10 causal constraints over 2 iterations in 398 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 162 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 205 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:57:41] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:41] [INFO ] Invariant cache hit.
[2023-03-12 07:57:41] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-12 07:57:41] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:41] [INFO ] Invariant cache hit.
[2023-03-12 07:57:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:43] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2216 ms to find 0 implicit places.
[2023-03-12 07:57:43] [INFO ] Redundant transitions in 147 ms returned []
[2023-03-12 07:57:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:43] [INFO ] Invariant cache hit.
[2023-03-12 07:57:44] [INFO ] Dead Transitions using invariants and state equation in 1273 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3865 ms. Remains : 183/183 places, 2107/2107 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-11 in 15778 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-12
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:57:45] [INFO ] Computed 5 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :10
[2023-03-12 07:57:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:57:45] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:57:45] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 07:57:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:45] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-12 07:57:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:45] [INFO ] [Real]Added 22 Read/Feed constraints in 33 ms returned sat
[2023-03-12 07:57:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:57:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:57:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:45] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-12 07:57:45] [INFO ] [Nat]Added 22 Read/Feed constraints in 42 ms returned sat
[2023-03-12 07:57:45] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 82 ms.
[2023-03-12 07:57:46] [INFO ] Added : 10 causal constraints over 2 iterations in 453 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 204 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:57:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:46] [INFO ] Invariant cache hit.
[2023-03-12 07:57:47] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 984 ms. Remains : 183/183 places, 2107/2107 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:57:47] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 6326 ms. (steps per millisecond=158 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 695 resets, run finished after 2604 ms. (steps per millisecond=384 ) properties (out of 1) seen :10
[2023-03-12 07:57:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:57:56] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:56] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-12 07:57:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:56] [INFO ] [Real]Added 22 Read/Feed constraints in 34 ms returned sat
[2023-03-12 07:57:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:57:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:56] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-12 07:57:56] [INFO ] [Nat]Added 22 Read/Feed constraints in 53 ms returned sat
[2023-03-12 07:57:56] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 69 ms.
[2023-03-12 07:57:57] [INFO ] Added : 10 causal constraints over 2 iterations in 434 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 187 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 189 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:57:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:58] [INFO ] Invariant cache hit.
[2023-03-12 07:57:58] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-12 07:57:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:58] [INFO ] Invariant cache hit.
[2023-03-12 07:57:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:59] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 1878 ms to find 0 implicit places.
[2023-03-12 07:57:59] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-12 07:57:59] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:59] [INFO ] Invariant cache hit.
[2023-03-12 07:58:00] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2870 ms. Remains : 183/183 places, 2107/2107 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-12 in 15684 ms.
[2023-03-12 07:58:01] [INFO ] Flatten gal took : 180 ms
[2023-03-12 07:58:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 07:58:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 183 places, 2107 transitions and 15624 arcs took 14 ms.
Total runtime 73531 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/685/ub_0_ --maxsum=/tmp/685/ub_1_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 14296268 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16097404 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2023

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="BridgeAndVehicles-COL-V80P20N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BridgeAndVehicles-COL-V80P20N10, 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 r041-tajo-167813694300117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P20N10.tgz
mv BridgeAndVehicles-COL-V80P20N10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;