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

About the Execution of LTSMin+red for BridgeAndVehicles-PT-V50P50N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1053.508 2248271.00 8857370.00 67.90 50 1 1 1 1 50 1 20 1 1 1 50 1 50 50 50 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 18K Feb 25 12:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 343K Feb 25 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 12:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 579K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 398K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 25 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.0M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678619057405

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 11:04:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 11:04:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:04:19] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2023-03-12 11:04:19] [INFO ] Transformed 138 places.
[2023-03-12 11:04:19] [INFO ] Transformed 2348 transitions.
[2023-03-12 11:04:19] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 138 cols
[2023-03-12 11:04:19] [INFO ] Computed 7 place invariants in 43 ms
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 23 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 12) seen :253
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :153
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :7
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :22
[2023-03-12 11:04:19] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2023-03-12 11:04:19] [INFO ] Computed 7 place invariants in 9 ms
[2023-03-12 11:04:19] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2023-03-12 11:04:19] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2023-03-12 11:04:19] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 11:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:04:20] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-12 11:04:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:04:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 11:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:04:20] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-12 11:04:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:04:20] [INFO ] [Nat]Added 42 Read/Feed constraints in 158 ms returned sat
[2023-03-12 11:04:20] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 140 ms.
[2023-03-12 11:04:20] [INFO ] Added : 20 causal constraints over 4 iterations in 289 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 50] Max seen :[1, 1, 20]
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 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 135 transition count 2347
Applied a total of 3 rules in 403 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 11:04:21] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 11:04:21] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 11:04:22] [INFO ] Dead Transitions using invariants and state equation in 842 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1246 ms. Remains : 135/138 places, 2347/2348 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 11:04:22] [INFO ] Computed 5 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 7238 ms. (steps per millisecond=138 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 1063 resets, run finished after 2905 ms. (steps per millisecond=344 ) properties (out of 1) seen :20
[2023-03-12 11:04:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 11:04:32] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 11:04:33] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 11:04:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:04:33] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-12 11:04:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:04:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 11:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:04:33] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-12 11:04:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:04:33] [INFO ] [Nat]Added 42 Read/Feed constraints in 25 ms returned sat
[2023-03-12 11:04:33] [INFO ] Deduced a trap composed of 5 places in 314 ms of which 5 ms to minimize.
[2023-03-12 11:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 339 ms
[2023-03-12 11:04:33] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 72 ms.
[2023-03-12 11:04:33] [INFO ] Added : 21 causal constraints over 5 iterations in 307 ms. Result :sat
Minimization took 176 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 210 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 135/135 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 273 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 11:04:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:04:35] [INFO ] Invariant cache hit.
[2023-03-12 11:04:35] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-12 11:04:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:04:35] [INFO ] Invariant cache hit.
[2023-03-12 11:04:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:04:36] [INFO ] Implicit Places using invariants and state equation in 831 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1178 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 185 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1638 ms. Remains : 133/135 places, 2347/2347 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 11:04:36] [INFO ] Computed 5 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2681 resets, run finished after 6730 ms. (steps per millisecond=148 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 1062 resets, run finished after 2593 ms. (steps per millisecond=385 ) properties (out of 1) seen :20
[2023-03-12 11:04:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 11:04:46] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 11:04:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:04:46] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2023-03-12 11:04:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:04:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 11:04:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:04:46] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-12 11:04:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:04:46] [INFO ] [Nat]Added 42 Read/Feed constraints in 26 ms returned sat
[2023-03-12 11:04:46] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 66 ms.
[2023-03-12 11:04:46] [INFO ] Added : 20 causal constraints over 4 iterations in 165 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 170 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 171 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 11:04:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:04:47] [INFO ] Invariant cache hit.
[2023-03-12 11:04:47] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-12 11:04:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:04:47] [INFO ] Invariant cache hit.
[2023-03-12 11:04:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:04:48] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
[2023-03-12 11:04:48] [INFO ] Redundant transitions in 156 ms returned []
[2023-03-12 11:04:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:04:48] [INFO ] Invariant cache hit.
[2023-03-12 11:04:49] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2238 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-07
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 11:04:49] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 26 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :20
[2023-03-12 11:04:49] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 11:04:49] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 11:04:49] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:04:50] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2023-03-12 11:04:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:04:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 11:04:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:04:50] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2023-03-12 11:04:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:04:50] [INFO ] [Nat]Added 42 Read/Feed constraints in 38 ms returned sat
[2023-03-12 11:04:50] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 57 ms.
[2023-03-12 11:04:50] [INFO ] Added : 20 causal constraints over 4 iterations in 230 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 197 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 11:04:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:04:51] [INFO ] Invariant cache hit.
[2023-03-12 11:04:52] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 810 ms. Remains : 133/133 places, 2347/2347 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 11:04:52] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 6935 ms. (steps per millisecond=144 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1064 resets, run finished after 2611 ms. (steps per millisecond=382 ) properties (out of 1) seen :20
[2023-03-12 11:05:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 11:05:01] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 11:05:01] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 11:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:05:01] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-03-12 11:05:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:05:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 11:05:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:05:02] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-12 11:05:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:05:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 38 ms returned sat
[2023-03-12 11:05:02] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 69 ms.
[2023-03-12 11:05:02] [INFO ] Added : 20 causal constraints over 4 iterations in 229 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 197 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 175 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 11:05:03] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:05:03] [INFO ] Invariant cache hit.
[2023-03-12 11:05:03] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-12 11:05:03] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:05:03] [INFO ] Invariant cache hit.
[2023-03-12 11:05:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:05:04] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
[2023-03-12 11:05:04] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-12 11:05:04] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:05:04] [INFO ] Invariant cache hit.
[2023-03-12 11:05:05] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1901 ms. Remains : 133/133 places, 2347/2347 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-07 in 15463 ms.
[2023-03-12 11:05:05] [INFO ] Flatten gal took : 180 ms
[2023-03-12 11:05:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 11:05:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 133 places, 2347 transitions and 17884 arcs took 15 ms.
Total runtime 46626 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/563/ub_0_
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-07 20 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678621305676

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name BridgeAndVehicles-PT-V50P50N20-UpperBounds-07
ub formula formula --maxsum=/tmp/563/ub_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 133 places, 2347 transitions and 17884 arcs
pnml2lts-sym: Petri net BridgeAndVehicles_PT_V50P50N20 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.030 real 0.030 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 2347->2246 groups
pnml2lts-sym: Regrouping took 2.230 real 2.240 user 0.000 sys
pnml2lts-sym: state vector length is 133; there are 2246 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 461674100 group checks and 0 next state calls
pnml2lts-sym: reachability took 2197.090 real 8780.560 user 1.600 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.040 user 0.000 sys
pnml2lts-sym: state space has 496311560 states, 155994 nodes
pnml2lts-sym: Maximum sum of /tmp/563/ub_0_ is: 20
pnml2lts-sym: group_next: 37708 nodes total
pnml2lts-sym: group_explored: 50357 nodes, 70527 short vectors total
pnml2lts-sym: max token count: 50

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V50P50N20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694400261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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