Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918200229.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-PT-V50P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918200229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 22K Apr 29 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 29 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 162K Apr 29 23:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 623K Apr 29 23:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 86K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 260K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 10 09:33 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-PT-V50P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652592537830

Running Version 202205111006
[2022-05-15 05:28:58] [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]
[2022-05-15 05:28:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 05:28:59] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2022-05-15 05:28:59] [INFO ] Transformed 128 places.
[2022-05-15 05:28:59] [INFO ] Transformed 1328 transitions.
[2022-05-15 05:28:59] [INFO ] Parsed PT model containing 128 places and 1328 transitions in 280 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 128 cols
[2022-05-15 05:28:59] [INFO ] Computed 7 place invariants in 42 ms
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 11) seen :148
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :105
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :9
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :14
[2022-05-15 05:28:59] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2022-05-15 05:28:59] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-15 05:28:59] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2022-05-15 05:28:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2022-05-15 05:28:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2022-05-15 05:29:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2022-05-15 05:29:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-15 05:29:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:29:00] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-15 05:29:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:29:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-15 05:29:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:29:00] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-15 05:29:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 05:29:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 35 ms returned sat
[2022-05-15 05:29:00] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 3 ms to minimize.
[2022-05-15 05:29:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2022-05-15 05:29:00] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 91 ms.
[2022-05-15 05:29:00] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 2 ms to minimize.
[2022-05-15 05:29:01] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2022-05-15 05:29:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 448 ms
[2022-05-15 05:29:01] [INFO ] Added : 10 causal constraints over 2 iterations in 671 ms. Result :sat
Minimization took 222 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 20] Max seen :[1, 1, 1, 1, 10]
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 226 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2022-05-15 05:29:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 05:29:01] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 05:29:02] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/128 places, 1327/1328 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 05:29:02] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4571 ms. (steps per millisecond=218 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 1087 resets, run finished after 1803 ms. (steps per millisecond=554 ) properties (out of 1) seen :10
[2022-05-15 05:29:09] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 05:29:09] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-15 05:29:09] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 05:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:29:09] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-15 05:29:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 05:29:09] [INFO ] [Real]Added 22 Read/Feed constraints in 18 ms returned sat
[2022-05-15 05:29:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:29:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 05:29:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:29:09] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-05-15 05:29:09] [INFO ] [Nat]Added 22 Read/Feed constraints in 15 ms returned sat
[2022-05-15 05:29:09] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 88 ms.
[2022-05-15 05:29:09] [INFO ] Added : 10 causal constraints over 2 iterations in 249 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 75 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 1327/1327 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 107 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 05:29:10] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 05:29:10] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 05:29:10] [INFO ] Implicit Places using invariants in 251 ms returned []
[2022-05-15 05:29:10] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 05:29:10] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 05:29:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 05:29:11] [INFO ] Implicit Places using invariants and state equation in 766 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1026 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 123/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 74 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 123/125 places, 1327/1327 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 05:29:11] [INFO ] Computed 5 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4264 ms. (steps per millisecond=234 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 1087 resets, run finished after 1633 ms. (steps per millisecond=612 ) properties (out of 1) seen :10
[2022-05-15 05:29:17] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 05:29:17] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 05:29:17] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 05:29:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:29:17] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-05-15 05:29:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:29:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 05:29:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:29:17] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2022-05-15 05:29:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 05:29:17] [INFO ] [Nat]Added 22 Read/Feed constraints in 40 ms returned sat
[2022-05-15 05:29:17] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2022-05-15 05:29:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2022-05-15 05:29:17] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 36 ms.
[2022-05-15 05:29:17] [INFO ] Added : 11 causal constraints over 3 iterations in 115 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 60 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 in SAFETY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 62 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 05:29:18] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 05:29:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 05:29:18] [INFO ] Implicit Places using invariants in 207 ms returned []
[2022-05-15 05:29:18] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 05:29:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 05:29:18] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2022-05-15 05:29:18] [INFO ] Redundant transitions in 98 ms returned []
[2022-05-15 05:29:18] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 05:29:18] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 05:29:19] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V50P20N10-UpperBounds-13
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 05:29:19] [INFO ] Computed 5 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 26 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 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :10
[2022-05-15 05:29:19] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 05:29:19] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 05:29:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 05:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:29:19] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-05-15 05:29:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:29:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 05:29:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:29:19] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2022-05-15 05:29:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 05:29:19] [INFO ] [Nat]Added 22 Read/Feed constraints in 38 ms returned sat
[2022-05-15 05:29:19] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2022-05-15 05:29:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-15 05:29:19] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 31 ms.
[2022-05-15 05:29:19] [INFO ] Added : 11 causal constraints over 3 iterations in 110 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 57 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 05:29:20] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 05:29:20] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 05:29:20] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 05:29:20] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2623 resets, run finished after 4089 ms. (steps per millisecond=244 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1087 resets, run finished after 1685 ms. (steps per millisecond=593 ) properties (out of 1) seen :10
[2022-05-15 05:29:26] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 05:29:26] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 05:29:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 05:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:29:26] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2022-05-15 05:29:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:29:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 05:29:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:29:26] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2022-05-15 05:29:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 05:29:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 41 ms returned sat
[2022-05-15 05:29:27] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2022-05-15 05:29:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-15 05:29:27] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 34 ms.
[2022-05-15 05:29:27] [INFO ] Added : 11 causal constraints over 3 iterations in 110 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 62 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 in SAFETY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 74 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 05:29:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 05:29:27] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 05:29:27] [INFO ] Implicit Places using invariants in 232 ms returned []
[2022-05-15 05:29:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 05:29:27] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 05:29:28] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2022-05-15 05:29:28] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-15 05:29:28] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 05:29:28] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 05:29:28] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V50P20N10-UpperBounds-13 in 9420 ms.
[2022-05-15 05:29:29] [INFO ] Flatten gal took : 139 ms
[2022-05-15 05:29:29] [INFO ] Applying decomposition
[2022-05-15 05:29:29] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14777811179760069030.txt' '-o' '/tmp/graph14777811179760069030.bin' '-w' '/tmp/graph14777811179760069030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14777811179760069030.bin' '-l' '-1' '-v' '-w' '/tmp/graph14777811179760069030.weights' '-q' '0' '-e' '0.001'
[2022-05-15 05:29:29] [INFO ] Decomposing Gal with order
[2022-05-15 05:29:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 05:29:29] [INFO ] Removed a total of 2743 redundant transitions.
[2022-05-15 05:29:30] [INFO ] Flatten gal took : 454 ms
[2022-05-15 05:29:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 322 labels/synchronizations in 29 ms.
[2022-05-15 05:29:30] [INFO ] Time to serialize gal into /tmp/UpperBounds2119352927634874866.gal : 8 ms
[2022-05-15 05:29:30] [INFO ] Time to serialize properties into /tmp/UpperBounds12683520103934418205.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2119352927634874866.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12683520103934418205.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds12683520103934418205.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,2.04953e+08,1163.01,3192484,6348,14738,1.48225e+06,2.40957e+06,285,5.12822e+06,462,4.45064e+07,0
Total reachable state count : 204953172

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-PT-V50P20N10-UpperBounds-13 :0 <= i0.u12.SUR_PONT_A <= 10
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-13 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-PT-V50P20N10-UpperBounds-13,0,1163.94,3192484,1,0,1.48225e+06,2.40957e+06,387,5.12822e+06,532,4.45064e+07,908
Total runtime 1195432 ms.

BK_STOP 1652593734456

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-PT-V50P20N10"
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-PT-V50P20N10, 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 r024-tall-165251918200229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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