Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 02:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 02:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 22 11:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 22 11:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 42K May 5 16:51 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-V50P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620516221309

Running Version 0
[2021-05-08 23:23:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 23:23:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 23:23:43] [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.
[2021-05-08 23:23:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-08 23:23:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 561 ms
[2021-05-08 23:23:44] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2021-05-08 23:23:44] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions in 2 ms.
[2021-05-08 23:23:44] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_7575013541697990855.dot
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
[2021-05-08 23:23:44] [INFO ] Computed 4 place invariants in 5 ms
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-08 23:23:44] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions in 33 ms.
[2021-05-08 23:23:44] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 10 rows 12 cols
[2021-05-08 23:23:44] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 23:23:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-08 23:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:44] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-08 23:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:23:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-08 23:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:44] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-08 23:23:44] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-08 23:23:44] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 12 ms.
[2021-05-08 23:23:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:44] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-08 23:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:23:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-08 23:23:44] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-08 23:23:44] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2021-05-08 23:23:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-08 23:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-08 23:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:23:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-08 23:23:44] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-08 23:23:44] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2021-05-08 23:23:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:44] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-08 23:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:23:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-08 23:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-08 23:23:44] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-08 23:23:44] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2021-05-08 23:23:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:44] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-08 23:23:44] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-08 23:23:44] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Minimization took 3 ms.
[2021-05-08 23:23:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-08 23:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:23:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 24 ms returned sat
[2021-05-08 23:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:45] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-08 23:23:45] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-08 23:23:45] [INFO ] Added : 1 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 5 ms.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-08 23:23:45] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-08 23:23:45] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Minimization took 6 ms.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-08 23:23:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:23:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-08 23:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:45] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-08 23:23:45] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-08 23:23:45] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-08 23:23:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:23:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:45] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-08 23:23:45] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-08 23:23:45] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-08 23:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-08 23:23:45] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-08 23:23:45] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-08 23:23:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:23:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:45] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-08 23:23:45] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-08 23:23:45] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-08 23:23:45] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-08 23:23:45] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-08 23:23:45] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-08 23:23:45] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [1, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 50, 50]
[2021-05-08 23:23:45] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions in 38 ms.
[2021-05-08 23:23:45] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_14354842201666986849.dot
Incomplete random walk after 10001 steps, including 22 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 13) seen :389
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :270
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :207
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :27
[2021-05-08 23:23:45] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2021-05-08 23:23:45] [INFO ] Computed 7 place invariants in 20 ms
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2021-05-08 23:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:45] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-08 23:23:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:23:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-08 23:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:46] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-08 23:23:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:23:46] [INFO ] [Nat]Added 22 Read/Feed constraints in 42 ms returned sat
[2021-05-08 23:23:46] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 2 ms to minimize.
[2021-05-08 23:23:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2021-05-08 23:23:46] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 73 ms.
[2021-05-08 23:23:47] [INFO ] Added : 105 causal constraints over 22 iterations in 677 ms. Result :sat
Minimization took 125 ms.
[2021-05-08 23:23:47] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned sat
[2021-05-08 23:23:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:47] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-08 23:23:47] [INFO ] [Real]Added 22 Read/Feed constraints in 15 ms returned sat
[2021-05-08 23:23:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:23:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-08 23:23:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:47] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2021-05-08 23:23:47] [INFO ] [Nat]Added 22 Read/Feed constraints in 20 ms returned sat
[2021-05-08 23:23:47] [INFO ] Deduced a trap composed of 7 places in 362 ms of which 1 ms to minimize.
[2021-05-08 23:23:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 400 ms
[2021-05-08 23:23:48] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 56 ms.
[2021-05-08 23:23:48] [INFO ] Added : 105 causal constraints over 22 iterations in 600 ms. Result :sat
Minimization took 275 ms.
[2021-05-08 23:23:48] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-08 23:23:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:49] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-08 23:23:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:23:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-08 23:23:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:23:49] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-08 23:23:49] [INFO ] [Nat]Added 22 Read/Feed constraints in 24 ms returned sat
[2021-05-08 23:23:49] [INFO ] Deduced a trap composed of 5 places in 393 ms of which 2 ms to minimize.
[2021-05-08 23:23:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 429 ms
[2021-05-08 23:23:49] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 78 ms.
[2021-05-08 23:23:50] [INFO ] Added : 105 causal constraints over 22 iterations in 588 ms. Result :sat
Minimization took 167 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50] Max seen :[10, 7, 10]
Incomplete Parikh walk after 47300 steps, including 557 resets, run finished after 335 ms. (steps per millisecond=141 ) properties (out of 3) seen :30 could not realise parikh vector
Incomplete Parikh walk after 44300 steps, including 576 resets, run finished after 168 ms. (steps per millisecond=263 ) properties (out of 3) seen :19 could not realise parikh vector
Incomplete Parikh walk after 47300 steps, including 568 resets, run finished after 163 ms. (steps per millisecond=290 ) properties (out of 3) seen :30 could not realise parikh vector
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 198 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:23:51] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:23:51] [INFO ] Computed 5 place invariants in 11 ms
[2021-05-08 23:23:51] [INFO ] Dead Transitions using invariants and state equation in 432 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/128 places, 1328/1328 transitions.
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:23:51] [INFO ] Computed 5 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2273 resets, run finished after 4942 ms. (steps per millisecond=202 ) properties (out of 3) seen :26
Incomplete Best-First random walk after 1000001 steps, including 865 resets, run finished after 1566 ms. (steps per millisecond=638 ) properties (out of 3) seen :29
Incomplete Best-First random walk after 1000000 steps, including 817 resets, run finished after 1750 ms. (steps per millisecond=571 ) properties (out of 3) seen :26
Incomplete Best-First random walk after 1000000 steps, including 863 resets, run finished after 1497 ms. (steps per millisecond=668 ) properties (out of 3) seen :28
[2021-05-08 23:24:01] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:24:01] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-08 23:24:01] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-08 23:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:01] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-08 23:24:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:24:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 23:24:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:01] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2021-05-08 23:24:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:24:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 106 ms returned sat
[2021-05-08 23:24:01] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 60 ms.
[2021-05-08 23:24:02] [INFO ] Added : 107 causal constraints over 23 iterations in 565 ms. Result :sat
Minimization took 159 ms.
[2021-05-08 23:24:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 23:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:02] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-08 23:24:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:24:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 23:24:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:02] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-08 23:24:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 38 ms returned sat
[2021-05-08 23:24:03] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2021-05-08 23:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2021-05-08 23:24:03] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 63 ms.
[2021-05-08 23:24:04] [INFO ] Added : 107 causal constraints over 22 iterations in 931 ms. Result :sat
Minimization took 225 ms.
[2021-05-08 23:24:04] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-08 23:24:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:04] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-08 23:24:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:24:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-08 23:24:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:04] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2021-05-08 23:24:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 104 ms returned sat
[2021-05-08 23:24:04] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 58 ms.
[2021-05-08 23:24:05] [INFO ] Added : 107 causal constraints over 23 iterations in 522 ms. Result :sat
Minimization took 139 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50] Max seen :[10, 10, 10]
Incomplete Parikh walk after 47100 steps, including 559 resets, run finished after 328 ms. (steps per millisecond=143 ) properties (out of 3) seen :30 could not realise parikh vector
Incomplete Parikh walk after 44600 steps, including 571 resets, run finished after 266 ms. (steps per millisecond=167 ) properties (out of 3) seen :16 could not realise parikh vector
Incomplete Parikh walk after 47100 steps, including 550 resets, run finished after 235 ms. (steps per millisecond=200 ) properties (out of 3) seen :30 could not realise parikh vector
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 81 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 1328/1328 transitions.
Starting structural reductions, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 87 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:24:06] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:24:06] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:24:06] [INFO ] Implicit Places using invariants in 295 ms returned []
[2021-05-08 23:24:06] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:24:06] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:24:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:24:07] [INFO ] Implicit Places using invariants and state equation in 849 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1151 ms to find 2 implicit places.
[2021-05-08 23:24:07] [INFO ] Redundant transitions in 99 ms returned []
[2021-05-08 23:24:07] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:24:07] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:24:08] [INFO ] Dead Transitions using invariants and state equation in 472 ms returned []
Starting structural reductions, iteration 1 : 124/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 79 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:24:08] [INFO ] Redundant transitions in 18 ms returned []
[2021-05-08 23:24:08] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:24:08] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-08 23:24:08] [INFO ] Dead Transitions using invariants and state equation in 510 ms returned []
Finished structural reductions, in 2 iterations. Remains : 124/126 places, 1328/1328 transitions.
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:24:08] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2272 resets, run finished after 4449 ms. (steps per millisecond=224 ) properties (out of 3) seen :23
Incomplete Best-First random walk after 1000000 steps, including 867 resets, run finished after 1468 ms. (steps per millisecond=681 ) properties (out of 3) seen :28
Incomplete Best-First random walk after 1000001 steps, including 816 resets, run finished after 1364 ms. (steps per millisecond=733 ) properties (out of 3) seen :26
Incomplete Best-First random walk after 1000001 steps, including 865 resets, run finished after 1430 ms. (steps per millisecond=699 ) properties (out of 3) seen :29
[2021-05-08 23:24:17] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:24:17] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-08 23:24:17] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-08 23:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:17] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-08 23:24:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:24:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-08 23:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:17] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2021-05-08 23:24:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:24:17] [INFO ] [Nat]Added 22 Read/Feed constraints in 36 ms returned sat
[2021-05-08 23:24:17] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 53 ms.
[2021-05-08 23:24:18] [INFO ] Added : 107 causal constraints over 22 iterations in 669 ms. Result :sat
Minimization took 143 ms.
[2021-05-08 23:24:18] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-08 23:24:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:18] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-08 23:24:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:24:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-08 23:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:18] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-08 23:24:18] [INFO ] [Nat]Added 22 Read/Feed constraints in 40 ms returned sat
[2021-05-08 23:24:19] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2021-05-08 23:24:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2021-05-08 23:24:19] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 35 ms.
[2021-05-08 23:24:19] [INFO ] Added : 104 causal constraints over 21 iterations in 411 ms. Result :sat
Minimization took 174 ms.
[2021-05-08 23:24:19] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-08 23:24:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:19] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-08 23:24:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:24:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-08 23:24:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:19] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-08 23:24:19] [INFO ] [Nat]Added 22 Read/Feed constraints in 22 ms returned sat
[2021-05-08 23:24:19] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 28 ms.
[2021-05-08 23:24:20] [INFO ] Added : 107 causal constraints over 22 iterations in 503 ms. Result :sat
Minimization took 173 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50] Max seen :[10, 10, 10]
Incomplete Parikh walk after 48100 steps, including 550 resets, run finished after 205 ms. (steps per millisecond=234 ) properties (out of 3) seen :30 could not realise parikh vector
Incomplete Parikh walk after 46400 steps, including 626 resets, run finished after 200 ms. (steps per millisecond=232 ) properties (out of 3) seen :21 could not realise parikh vector
Incomplete Parikh walk after 48100 steps, including 552 resets, run finished after 173 ms. (steps per millisecond=278 ) properties (out of 3) seen :30 could not realise parikh vector
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 78 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 1328/1328 transitions.
Starting structural reductions, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 86 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:24:21] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:24:21] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:24:21] [INFO ] Implicit Places using invariants in 304 ms returned []
[2021-05-08 23:24:21] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:24:21] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:24:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:24:22] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2021-05-08 23:24:22] [INFO ] Redundant transitions in 27 ms returned []
[2021-05-08 23:24:22] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:24:22] [INFO ] Computed 5 place invariants in 11 ms
[2021-05-08 23:24:22] [INFO ] Dead Transitions using invariants and state equation in 610 ms returned []
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 1328/1328 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-04
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:24:22] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 22 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :10
[2021-05-08 23:24:23] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:24:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:24:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 23:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:23] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-08 23:24:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:24:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 23:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:23] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-08 23:24:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:24:23] [INFO ] [Nat]Added 22 Read/Feed constraints in 15 ms returned sat
[2021-05-08 23:24:23] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 32 ms.
[2021-05-08 23:24:23] [INFO ] Added : 107 causal constraints over 22 iterations in 436 ms. Result :sat
Minimization took 171 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Incomplete Parikh walk after 48100 steps, including 572 resets, run finished after 227 ms. (steps per millisecond=211 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 places, 1328/1328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1327
Applied a total of 2 rules in 147 ms. Remains 123 /124 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2021-05-08 23:24:24] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:24] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:24:24] [INFO ] Dead Transitions using invariants and state equation in 547 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/124 places, 1327/1328 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:24] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2623 resets, run finished after 3768 ms. (steps per millisecond=265 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 1088 resets, run finished after 1549 ms. (steps per millisecond=645 ) properties (out of 1) seen :10
[2021-05-08 23:24:30] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:30] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:24:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-08 23:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:30] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-08 23:24:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:24:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 23:24:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:30] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2021-05-08 23:24:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:24:30] [INFO ] [Nat]Added 22 Read/Feed constraints in 63 ms returned sat
[2021-05-08 23:24:30] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 0 ms to minimize.
[2021-05-08 23:24:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2021-05-08 23:24:30] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 53 ms.
[2021-05-08 23:24:30] [INFO ] Added : 108 causal constraints over 22 iterations in 372 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Incomplete Parikh walk after 55900 steps, including 779 resets, run finished after 161 ms. (steps per millisecond=347 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 54 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 52 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2021-05-08 23:24:31] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:31] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:24:31] [INFO ] Implicit Places using invariants in 253 ms returned []
[2021-05-08 23:24:31] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:31] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:24:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:24:32] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
[2021-05-08 23:24:32] [INFO ] Redundant transitions in 26 ms returned []
[2021-05-08 23:24:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:32] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:24:32] [INFO ] Dead Transitions using invariants and state equation in 464 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-04 in 9733 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-06
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:24:32] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 22 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :10
[2021-05-08 23:24:32] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:24:32] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:24:32] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-08 23:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:32] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-08 23:24:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:24:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 23:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:32] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-08 23:24:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:24:32] [INFO ] [Nat]Added 22 Read/Feed constraints in 19 ms returned sat
[2021-05-08 23:24:33] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2021-05-08 23:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2021-05-08 23:24:33] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 33 ms.
[2021-05-08 23:24:33] [INFO ] Added : 104 causal constraints over 21 iterations in 350 ms. Result :sat
Minimization took 214 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Incomplete Parikh walk after 46400 steps, including 620 resets, run finished after 177 ms. (steps per millisecond=262 ) properties (out of 1) seen :9 could not realise parikh vector
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 places, 1328/1328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1327
Applied a total of 2 rules in 82 ms. Remains 123 /124 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2021-05-08 23:24:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:33] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:24:34] [INFO ] Dead Transitions using invariants and state equation in 615 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/124 places, 1327/1328 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:34] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4097 ms. (steps per millisecond=244 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1028 resets, run finished after 1723 ms. (steps per millisecond=580 ) properties (out of 1) seen :10
[2021-05-08 23:24:40] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:40] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:24:40] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-08 23:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:40] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-08 23:24:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:24:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-08 23:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:40] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-08 23:24:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:24:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 46 ms returned sat
[2021-05-08 23:24:40] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
[2021-05-08 23:24:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2021-05-08 23:24:40] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 54 ms.
[2021-05-08 23:24:41] [INFO ] Added : 103 causal constraints over 23 iterations in 489 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Incomplete Parikh walk after 58300 steps, including 777 resets, run finished after 212 ms. (steps per millisecond=275 ) properties (out of 1) seen :9 could not realise parikh vector
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 78 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 77 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2021-05-08 23:24:41] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:41] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:24:42] [INFO ] Implicit Places using invariants in 257 ms returned []
[2021-05-08 23:24:42] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:42] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:24:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:24:43] [INFO ] Implicit Places using invariants and state equation in 1717 ms returned []
Implicit Place search using SMT with State Equation took 1997 ms to find 0 implicit places.
[2021-05-08 23:24:43] [INFO ] Redundant transitions in 17 ms returned []
[2021-05-08 23:24:43] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:43] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:24:44] [INFO ] Dead Transitions using invariants and state equation in 488 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-06 in 11767 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-09
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:24:44] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 22 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :10
[2021-05-08 23:24:44] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:24:44] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:24:44] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-08 23:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:44] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-08 23:24:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:24:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-08 23:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:44] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2021-05-08 23:24:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:24:44] [INFO ] [Nat]Added 22 Read/Feed constraints in 23 ms returned sat
[2021-05-08 23:24:44] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 35 ms.
[2021-05-08 23:24:45] [INFO ] Added : 107 causal constraints over 22 iterations in 420 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Incomplete Parikh walk after 48100 steps, including 558 resets, run finished after 148 ms. (steps per millisecond=325 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 places, 1328/1328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1327
Applied a total of 2 rules in 121 ms. Remains 123 /124 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2021-05-08 23:24:45] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:45] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:24:46] [INFO ] Dead Transitions using invariants and state equation in 516 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/124 places, 1327/1328 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:46] [INFO ] Computed 5 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 3885 ms. (steps per millisecond=257 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 1088 resets, run finished after 1616 ms. (steps per millisecond=618 ) properties (out of 1) seen :10
[2021-05-08 23:24:51] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:51] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:24:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 23:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:51] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-08 23:24:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:24:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 23:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:24:51] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-08 23:24:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:24:51] [INFO ] [Nat]Added 22 Read/Feed constraints in 43 ms returned sat
[2021-05-08 23:24:52] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2021-05-08 23:24:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2021-05-08 23:24:52] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 41 ms.
[2021-05-08 23:24:52] [INFO ] Added : 108 causal constraints over 22 iterations in 372 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Incomplete Parikh walk after 55900 steps, including 777 resets, run finished after 182 ms. (steps per millisecond=307 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 67 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 63 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2021-05-08 23:24:52] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:52] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:24:53] [INFO ] Implicit Places using invariants in 198 ms returned []
[2021-05-08 23:24:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:53] [INFO ] Computed 5 place invariants in 15 ms
[2021-05-08 23:24:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:24:53] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2021-05-08 23:24:53] [INFO ] Redundant transitions in 20 ms returned []
[2021-05-08 23:24:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:24:53] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:24:54] [INFO ] Dead Transitions using invariants and state equation in 437 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-09 in 9705 ms.
[2021-05-08 23:24:54] [INFO ] Flatten gal took : 241 ms
[2021-05-08 23:24:54] [INFO ] Applying decomposition
[2021-05-08 23:24:54] [INFO ] Flatten gal took : 138 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11680560799879971762.txt, -o, /tmp/graph11680560799879971762.bin, -w, /tmp/graph11680560799879971762.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11680560799879971762.bin, -l, -1, -v, -w, /tmp/graph11680560799879971762.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 23:24:55] [INFO ] Decomposing Gal with order
[2021-05-08 23:24:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 23:24:55] [INFO ] Removed a total of 2333 redundant transitions.
[2021-05-08 23:24:55] [INFO ] Flatten gal took : 514 ms
[2021-05-08 23:24:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 287 labels/synchronizations in 26 ms.
[2021-05-08 23:24:55] [INFO ] Time to serialize gal into /tmp/UpperBounds16166994010209123409.gal : 4 ms
[2021-05-08 23:24:55] [INFO ] Time to serialize properties into /tmp/UpperBounds5174862826808887315.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16166994010209123409.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5174862826808887315.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds16166994010209123409.gal -t CGAL -reachable-file /tmp/UpperBounds5174862826808887315.prop --nowitness
Loading property file /tmp/UpperBounds5174862826808887315.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.47634e+08,674.437,2929648,1097,24369,313149,2.57772e+06,109,3.15831e+06,399,4.78574e+07,0
Total reachable state count : 347634372

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-COL-V50P50N10-UpperBounds-04 :0 <= u0.SUR_PONT_A_0 <= 10
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-04 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V50P50N10-UpperBounds-04,0,675.218,2929648,1,0,313149,2.57772e+06,136,3.15831e+06,475,4.78574e+07,226
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-COL-V50P50N10-UpperBounds-06 :0 <= u0.SUR_PONT_B_0 <= 10
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-06 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V50P50N10-UpperBounds-06,0,675.221,2929648,1,0,313149,2.57772e+06,141,3.15831e+06,491,4.78574e+07,232
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-COL-V50P50N10-UpperBounds-09 :0 <= u0.SUR_PONT_A_0 <= 10
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-09 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V50P50N10-UpperBounds-09,0,675.221,2929648,1,0,313149,2.57772e+06,141,3.15831e+06,491,4.78574e+07,232

BK_STOP 1620516972028

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-V50P50N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V50P50N10, 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 r026-tajo-162038143400091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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