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-162038143300043.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-V20P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143300043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 111K 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 3.7K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 11:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 11:06 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 39K 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-V20P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620511730096

Running Version 0
[2021-05-08 22:08:51] [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 22:08:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 22:08:51] [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 22:08:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-08 22:08:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 494 ms
[2021-05-08 22:08:52] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2021-05-08 22:08:52] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions in 2 ms.
[2021-05-08 22:08:52] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_13956005405912034873.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 22:08:52] [INFO ] Computed 4 place invariants in 5 ms
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-08 22:08:52] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions in 19 ms.
[2021-05-08 22:08:52] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 10 rows 12 cols
[2021-05-08 22:08:52] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-08 22:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-08 22:08:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:08:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 22:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:52] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-08 22:08:52] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-08 22:08:52] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 22:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-08 22:08:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:08:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 22:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:52] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-08 22:08:52] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-08 22:08:52] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 22:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-08 22:08:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:08:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 22:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:52] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-08 22:08:52] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-08 22:08:52] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-08 22:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-08 22:08:52] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-08 22:08:52] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 22:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-08 22:08:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:08:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-08 22:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:52] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-08 22:08:52] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-08 22:08:52] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 3 ms.
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 22:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-08 22:08:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:08:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 22:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:52] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-08 22:08:52] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-08 22:08:52] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20, 20, 20, 1]
[2021-05-08 22:08:52] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions in 11 ms.
[2021-05-08 22:08:52] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_7854399883452074494.dot
Incomplete random walk after 10000 steps, including 56 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :56
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-10 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :26
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :20
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :24
[2021-05-08 22:08:52] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2021-05-08 22:08:52] [INFO ] Computed 7 place invariants in 15 ms
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-08 22:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:52] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-08 22:08:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:08:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-08 22:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:52] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-08 22:08:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:08:53] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2021-05-08 22:08:53] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 30 ms.
[2021-05-08 22:08:53] [INFO ] Added : 47 causal constraints over 11 iterations in 128 ms. Result :sat
Minimization took 21 ms.
[2021-05-08 22:08:53] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-08 22:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:53] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-08 22:08:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:08:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-08 22:08:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:53] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-08 22:08:53] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2021-05-08 22:08:53] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
[2021-05-08 22:08:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2021-05-08 22:08:53] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 25 ms.
[2021-05-08 22:08:53] [INFO ] Added : 47 causal constraints over 10 iterations in 100 ms. Result :sat
Minimization took 22 ms.
[2021-05-08 22:08:53] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-08 22:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:53] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-08 22:08:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:08:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-08 22:08:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:53] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-08 22:08:53] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2021-05-08 22:08:53] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 23 ms.
[2021-05-08 22:08:53] [INFO ] Added : 47 causal constraints over 11 iterations in 99 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20] Max seen :[10, 10, 10]
Incomplete Parikh walk after 49000 steps, including 1006 resets, run finished after 146 ms. (steps per millisecond=335 ) properties (out of 3) seen :30 could not realise parikh vector
Incomplete Parikh walk after 49400 steps, including 977 resets, run finished after 132 ms. (steps per millisecond=374 ) properties (out of 3) seen :30 could not realise parikh vector
Incomplete Parikh walk after 49000 steps, including 1010 resets, run finished after 153 ms. (steps per millisecond=320 ) properties (out of 3) seen :30 could not realise parikh vector
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 54 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2021-05-08 22:08:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2021-05-08 22:08:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:08:54] [INFO ] Dead Transitions using invariants and state equation in 160 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/68 places, 548/548 transitions.
Normalized transition count is 130 out of 548 initially.
// Phase 1: matrix 130 rows 66 cols
[2021-05-08 22:08:54] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 5632 resets, run finished after 2476 ms. (steps per millisecond=403 ) properties (out of 3) seen :21
Incomplete Best-First random walk after 1000000 steps, including 2051 resets, run finished after 888 ms. (steps per millisecond=1126 ) properties (out of 3) seen :27
Incomplete Best-First random walk after 1000001 steps, including 1940 resets, run finished after 824 ms. (steps per millisecond=1213 ) properties (out of 3) seen :26
Incomplete Best-First random walk after 1000001 steps, including 2045 resets, run finished after 971 ms. (steps per millisecond=1029 ) properties (out of 3) seen :28
[2021-05-08 22:08:59] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2021-05-08 22:08:59] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 22:08:59] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-08 22:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:59] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-08 22:08:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:08:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:59] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-08 22:08:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:08:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 15 ms returned sat
[2021-05-08 22:08:59] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2021-05-08 22:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2021-05-08 22:08:59] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 18 ms.
[2021-05-08 22:08:59] [INFO ] Added : 47 causal constraints over 11 iterations in 137 ms. Result :sat
Minimization took 20 ms.
[2021-05-08 22:08:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-08 22:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:08:59] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-08 22:08:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:09:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-08 22:09:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:00] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-08 22:09:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:09:00] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 21 ms.
[2021-05-08 22:09:00] [INFO ] Added : 47 causal constraints over 10 iterations in 117 ms. Result :sat
Minimization took 59 ms.
[2021-05-08 22:09:00] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-08 22:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:00] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-08 22:09:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:09:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:00] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-08 22:09:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2021-05-08 22:09:00] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2021-05-08 22:09:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-08 22:09:00] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 23 ms.
[2021-05-08 22:09:00] [INFO ] Added : 47 causal constraints over 11 iterations in 166 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20] Max seen :[10, 10, 10]
Incomplete Parikh walk after 49600 steps, including 1001 resets, run finished after 213 ms. (steps per millisecond=232 ) properties (out of 3) seen :30 could not realise parikh vector
Incomplete Parikh walk after 36700 steps, including 817 resets, run finished after 122 ms. (steps per millisecond=300 ) properties (out of 3) seen :26 could not realise parikh vector
Incomplete Parikh walk after 49600 steps, including 1000 resets, run finished after 175 ms. (steps per millisecond=283 ) properties (out of 3) seen :30 could not realise parikh vector
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 62 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Starting structural reductions, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 48 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2021-05-08 22:09:01] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2021-05-08 22:09:01] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 22:09:01] [INFO ] Implicit Places using invariants in 137 ms returned []
[2021-05-08 22:09:01] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2021-05-08 22:09:01] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 22:09:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:09:01] [INFO ] Implicit Places using invariants and state equation in 246 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 387 ms to find 2 implicit places.
[2021-05-08 22:09:01] [INFO ] Redundant transitions in 44 ms returned []
[2021-05-08 22:09:01] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-08 22:09:01] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 22:09:01] [INFO ] Dead Transitions using invariants and state equation in 217 ms returned []
Starting structural reductions, iteration 1 : 64/66 places, 548/548 transitions.
Applied a total of 0 rules in 23 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2021-05-08 22:09:01] [INFO ] Redundant transitions in 14 ms returned []
[2021-05-08 22:09:01] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-08 22:09:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:02] [INFO ] Dead Transitions using invariants and state equation in 254 ms returned []
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 548/548 transitions.
Normalized transition count is 130 out of 548 initially.
// Phase 1: matrix 130 rows 64 cols
[2021-05-08 22:09:02] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 5632 resets, run finished after 2161 ms. (steps per millisecond=462 ) properties (out of 3) seen :24
Incomplete Best-First random walk after 1000001 steps, including 2047 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 3) seen :28
Incomplete Best-First random walk after 1000001 steps, including 1941 resets, run finished after 799 ms. (steps per millisecond=1251 ) properties (out of 3) seen :26
Incomplete Best-First random walk after 1000000 steps, including 2053 resets, run finished after 996 ms. (steps per millisecond=1004 ) properties (out of 3) seen :28
[2021-05-08 22:09:06] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-08 22:09:06] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 22:09:06] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:07] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-08 22:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:07] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-08 22:09:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:09:07] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2021-05-08 22:09:07] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 14 ms.
[2021-05-08 22:09:07] [INFO ] Added : 44 causal constraints over 9 iterations in 87 ms. Result :sat
Minimization took 26 ms.
[2021-05-08 22:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-08 22:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:07] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-08 22:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:07] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-08 22:09:07] [INFO ] [Nat]Added 22 Read/Feed constraints in 15 ms returned sat
[2021-05-08 22:09:07] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 17 ms.
[2021-05-08 22:09:07] [INFO ] Added : 46 causal constraints over 12 iterations in 115 ms. Result :sat
Minimization took 30 ms.
[2021-05-08 22:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:07] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-08 22:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:07] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-08 22:09:07] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2021-05-08 22:09:07] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 14 ms.
[2021-05-08 22:09:07] [INFO ] Added : 44 causal constraints over 9 iterations in 84 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20] Max seen :[10, 10, 10]
Incomplete Parikh walk after 79600 steps, including 1153 resets, run finished after 238 ms. (steps per millisecond=334 ) properties (out of 3) seen :30 could not realise parikh vector
Incomplete Parikh walk after 49300 steps, including 968 resets, run finished after 98 ms. (steps per millisecond=503 ) properties (out of 3) seen :20 could not realise parikh vector
Incomplete Parikh walk after 79600 steps, including 1159 resets, run finished after 182 ms. (steps per millisecond=437 ) properties (out of 3) seen :30 could not realise parikh vector
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2021-05-08 22:09:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-08 22:09:08] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:08] [INFO ] Implicit Places using invariants in 118 ms returned []
[2021-05-08 22:09:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-08 22:09:08] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:09:08] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2021-05-08 22:09:08] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-08 22:09:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-08 22:09:08] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:08] [INFO ] Dead Transitions using invariants and state equation in 153 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V20P20N10-UpperBounds-03
Normalized transition count is 130 out of 548 initially.
// Phase 1: matrix 130 rows 64 cols
[2021-05-08 22:09:08] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 56 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :10
[2021-05-08 22:09:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-08 22:09:08] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-08 22:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:08] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-08 22:09:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:09:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-08 22:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:08] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-08 22:09:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:09:08] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2021-05-08 22:09:08] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 25 ms.
[2021-05-08 22:09:08] [INFO ] Added : 44 causal constraints over 9 iterations in 108 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 79600 steps, including 1155 resets, run finished after 270 ms. (steps per millisecond=294 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 64/64 places, 548/548 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 547
Applied a total of 2 rules in 32 ms. Remains 63 /64 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2021-05-08 22:09:09] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:09] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-08 22:09:09] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/64 places, 547/548 transitions.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:09] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 6490 resets, run finished after 2066 ms. (steps per millisecond=484 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2551 resets, run finished after 1141 ms. (steps per millisecond=876 ) properties (out of 1) seen :10
[2021-05-08 22:09:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:12] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:12] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:12] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-08 22:09:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:09:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:12] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2021-05-08 22:09:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:09:12] [INFO ] [Nat]Added 22 Read/Feed constraints in 15 ms returned sat
[2021-05-08 22:09:12] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 17 ms.
[2021-05-08 22:09:12] [INFO ] Added : 42 causal constraints over 9 iterations in 103 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 93700 steps, including 1348 resets, run finished after 327 ms. (steps per millisecond=286 ) properties (out of 1) seen :9 could not realise parikh vector
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 18 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 24 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2021-05-08 22:09:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:13] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2021-05-08 22:09:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:13] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:09:13] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2021-05-08 22:09:13] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-08 22:09:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:13] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:13] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V20P20N10-UpperBounds-03 in 5148 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V20P20N10-UpperBounds-05
Normalized transition count is 130 out of 548 initially.
// Phase 1: matrix 130 rows 64 cols
[2021-05-08 22:09:13] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 56 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :10
[2021-05-08 22:09:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-08 22:09:13] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:13] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-08 22:09:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:13] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-08 22:09:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:09:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:14] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-08 22:09:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:09:14] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2021-05-08 22:09:14] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 14 ms.
[2021-05-08 22:09:14] [INFO ] Added : 46 causal constraints over 12 iterations in 130 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 49300 steps, including 976 resets, run finished after 141 ms. (steps per millisecond=349 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 64/64 places, 548/548 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 547
Applied a total of 2 rules in 21 ms. Remains 63 /64 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2021-05-08 22:09:14] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:14] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 22:09:14] [INFO ] Dead Transitions using invariants and state equation in 193 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/64 places, 547/548 transitions.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:14] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 6487 resets, run finished after 2358 ms. (steps per millisecond=424 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 2452 resets, run finished after 928 ms. (steps per millisecond=1077 ) properties (out of 1) seen :10
[2021-05-08 22:09:17] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:17] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 22:09:17] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-08 22:09:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:17] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-08 22:09:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:09:17] [INFO ] [Real]Added 22 Read/Feed constraints in 6 ms returned sat
[2021-05-08 22:09:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:09:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:17] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-08 22:09:17] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2021-05-08 22:09:17] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 13 ms.
[2021-05-08 22:09:18] [INFO ] Added : 47 causal constraints over 10 iterations in 90 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 33800 steps, including 722 resets, run finished after 118 ms. (steps per millisecond=286 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 13 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2021-05-08 22:09:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:18] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:18] [INFO ] Implicit Places using invariants in 109 ms returned []
[2021-05-08 22:09:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:18] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 22:09:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:09:18] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2021-05-08 22:09:18] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-08 22:09:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:18] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:18] [INFO ] Dead Transitions using invariants and state equation in 178 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V20P20N10-UpperBounds-05 in 4954 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V20P20N10-UpperBounds-11
Normalized transition count is 130 out of 548 initially.
// Phase 1: matrix 130 rows 64 cols
[2021-05-08 22:09:18] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 56 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :10
[2021-05-08 22:09:18] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-08 22:09:18] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:18] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-08 22:09:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:09:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:18] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-08 22:09:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:09:18] [INFO ] [Nat]Added 22 Read/Feed constraints in 10 ms returned sat
[2021-05-08 22:09:19] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 17 ms.
[2021-05-08 22:09:19] [INFO ] Added : 44 causal constraints over 9 iterations in 89 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 79600 steps, including 1153 resets, run finished after 279 ms. (steps per millisecond=285 ) properties (out of 1) seen :8 could not realise parikh vector
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 64/64 places, 548/548 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 547
Applied a total of 2 rules in 19 ms. Remains 63 /64 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2021-05-08 22:09:19] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:19] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:19] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/64 places, 547/548 transitions.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:19] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 6489 resets, run finished after 2582 ms. (steps per millisecond=387 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000005 steps, including 2549 resets, run finished after 1027 ms. (steps per millisecond=973 ) properties (out of 1) seen :10
[2021-05-08 22:09:23] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:23] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-08 22:09:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:09:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-08 22:09:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:09:23] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-08 22:09:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:09:23] [INFO ] [Nat]Added 22 Read/Feed constraints in 15 ms returned sat
[2021-05-08 22:09:23] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 13 ms.
[2021-05-08 22:09:23] [INFO ] Added : 42 causal constraints over 9 iterations in 84 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 93700 steps, including 1346 resets, run finished after 334 ms. (steps per millisecond=280 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2021-05-08 22:09:23] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:24] [INFO ] Implicit Places using invariants in 119 ms returned []
[2021-05-08 22:09:24] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:24] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 22:09:24] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2021-05-08 22:09:24] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-08 22:09:24] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2021-05-08 22:09:24] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 22:09:24] [INFO ] Dead Transitions using invariants and state equation in 196 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V20P20N10-UpperBounds-11 in 5619 ms.
[2021-05-08 22:09:24] [INFO ] Flatten gal took : 88 ms
[2021-05-08 22:09:24] [INFO ] Applying decomposition
[2021-05-08 22:09:24] [INFO ] Flatten gal took : 51 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/graph1894519389716047252.txt, -o, /tmp/graph1894519389716047252.bin, -w, /tmp/graph1894519389716047252.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/graph1894519389716047252.bin, -l, -1, -v, -w, /tmp/graph1894519389716047252.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 22:09:24] [INFO ] Decomposing Gal with order
[2021-05-08 22:09:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 22:09:25] [INFO ] Removed a total of 965 redundant transitions.
[2021-05-08 22:09:25] [INFO ] Flatten gal took : 260 ms
[2021-05-08 22:09:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 11 ms.
[2021-05-08 22:09:25] [INFO ] Time to serialize gal into /tmp/UpperBounds12291618265761108759.gal : 3 ms
[2021-05-08 22:09:25] [INFO ] Time to serialize properties into /tmp/UpperBounds15198239279540445729.prop : 0 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/UpperBounds12291618265761108759.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15198239279540445729.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/UpperBounds12291618265761108759.gal -t CGAL -reachable-file /tmp/UpperBounds15198239279540445729.prop --nowitness
Loading property file /tmp/UpperBounds15198239279540445729.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,6.73257e+06,146.831,2081320,1518,7115,385992,581367,141,1.63568e+07,222,1.42708e+07,0
Total reachable state count : 6732570

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-COL-V20P20N10-UpperBounds-03 :0 <= u0.SUR_PONT_A_0 <= 10
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-03 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-V20P20N10-UpperBounds-03,0,147.084,2081320,1,0,385992,581367,178,1.63568e+07,268,1.42708e+07,827
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-COL-V20P20N10-UpperBounds-05 :0 <= u0.SUR_PONT_B_0 <= 10
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-05 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-V20P20N10-UpperBounds-05,0,147.091,2081320,1,0,385992,581367,183,1.63568e+07,284,1.42708e+07,833
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-COL-V20P20N10-UpperBounds-11 :0 <= u0.SUR_PONT_A_0 <= 10
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-11 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-V20P20N10-UpperBounds-11,0,147.091,2081320,1,0,385992,581367,183,1.63568e+07,284,1.42708e+07,833

BK_STOP 1620511912671

--------------------
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-V20P20N10"
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-V20P20N10, 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-162038143300043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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