fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r024-tall-165251918200207
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for BridgeAndVehicles-PT-V20P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4561.172 944904.00 2927850.00 1522.00 TFFFFTTFTTFFTTTT normal

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-165251918200207.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-V20P20N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918200207
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 9.8K Apr 29 21:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 21:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 99K Apr 29 21:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 29 21:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 29 21:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 29 21:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 140K Apr 29 21:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 588K Apr 29 21:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 434K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654194298822

Running Version 202205111006
[2022-06-02 18:25:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-06-02 18:25:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 18:25:00] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2022-06-02 18:25:00] [INFO ] Transformed 68 places.
[2022-06-02 18:25:00] [INFO ] Transformed 548 transitions.
[2022-06-02 18:25:00] [INFO ] Parsed PT model containing 68 places and 548 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 56 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 16) seen :5
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 11) seen :1
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-06-02 18:25:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2022-06-02 18:25:03] [INFO ] Computed 7 place invariants in 13 ms
[2022-06-02 18:25:04] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2022-06-02 18:25:04] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2022-06-02 18:25:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 60 ms returned sat
[2022-06-02 18:25:05] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2022-06-02 18:25:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-02 18:25:05] [INFO ] After 187ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :5 sat :5
[2022-06-02 18:25:06] [INFO ] After 462ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :5
Attempting to minimize the solution found.
Minimization took 193 ms.
[2022-06-02 18:25:06] [INFO ] After 1293ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :5
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 924 ms.
Support contains 53 out of 68 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 73 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2022-06-02 18:25:07] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:25:07] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-02 18:25:07] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/68 places, 548/548 transitions.
Incomplete random walk after 1000000 steps, including 5632 resets, run finished after 18971 ms. (steps per millisecond=52 ) properties (out of 5) seen :1
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 419562 steps, including 804 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen 0
Interrupted Best-First random walk after 877534 steps, including 1883 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen 0
Interrupted Best-First random walk after 827603 steps, including 1822 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Interrupted Best-First random walk after 503765 steps, including 1101 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen 0
Running SMT prover for 4 properties.
[2022-06-02 18:25:46] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:25:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:25:46] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:25:46] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 18:25:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:25:47] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 18:25:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-02 18:25:47] [INFO ] After 163ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 18:25:47] [INFO ] After 349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 184 ms.
[2022-06-02 18:25:47] [INFO ] After 732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 635 ms.
Support contains 53 out of 66 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 24 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Incomplete random walk after 1000000 steps, including 5632 resets, run finished after 16072 ms. (steps per millisecond=62 ) properties (out of 4) seen :1
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 521617 steps, including 992 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen 0
Interrupted Best-First random walk after 679546 steps, including 1451 resets, run timeout after 5001 ms. (steps per millisecond=135 ) properties seen 0
Interrupted Best-First random walk after 826812 steps, including 1812 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Running SMT prover for 3 properties.
[2022-06-02 18:26:19] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:26:19] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:26:19] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:26:19] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 18:26:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:26:19] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-02 18:26:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-02 18:26:19] [INFO ] After 166ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-02 18:26:19] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 128 ms.
[2022-06-02 18:26:20] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1628 ms.
Support contains 52 out of 66 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 29 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Incomplete random walk after 1000000 steps, including 5633 resets, run finished after 13736 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 657508 steps, including 1258 resets, run timeout after 5001 ms. (steps per millisecond=131 ) properties seen 0
Interrupted Best-First random walk after 919467 steps, including 1970 resets, run timeout after 5001 ms. (steps per millisecond=183 ) properties seen 0
Interrupted Best-First random walk after 905794 steps, including 1988 resets, run timeout after 5001 ms. (steps per millisecond=181 ) properties seen 0
Interrupted probabilistic random walk after 17633936 steps, run timeout after 84001 ms. (steps per millisecond=209 ) properties seen :{1=1}
Probabilistic random walk after 17633936 steps, saw 3960745 distinct states, run finished after 84003 ms. (steps per millisecond=209 ) properties seen :1
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2022-06-02 18:28:14] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:28:14] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-02 18:28:14] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:28:14] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 18:28:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:28:14] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 18:28:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-02 18:28:14] [INFO ] After 116ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 18:28:14] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2022-06-02 18:28:15] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 113 ms.
Support contains 50 out of 66 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 27 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Incomplete random walk after 1000001 steps, including 5632 resets, run finished after 10690 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 858166 steps, including 1641 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2197 resets, run finished after 3955 ms. (steps per millisecond=252 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 12254347 steps, run timeout after 57001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 12254347 steps, saw 2773763 distinct states, run finished after 57003 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-02 18:29:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:29:31] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-02 18:29:31] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-06-02 18:29:31] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 18:29:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:29:32] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 18:29:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-02 18:29:32] [INFO ] After 119ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 18:29:32] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 107 ms.
[2022-06-02 18:29:32] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 129 ms.
Support contains 50 out of 66 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-06-02 18:29:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:29:32] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-02 18:29:32] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-06-02 18:29:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:29:32] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:29:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-02 18:29:32] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2022-06-02 18:29:32] [INFO ] Redundant transitions in 38 ms returned []
[2022-06-02 18:29:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:29:32] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:29:33] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Incomplete random walk after 1000000 steps, including 5630 resets, run finished after 10887 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 786616 steps, including 1505 resets, run timeout after 5001 ms. (steps per millisecond=157 ) properties seen 0
Incomplete Best-First random walk after 1000000 steps, including 2192 resets, run finished after 4337 ms. (steps per millisecond=230 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 12334477 steps, run timeout after 60001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 12334477 steps, saw 2790764 distinct states, run finished after 60001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-02 18:30:53] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:30:53] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:30:53] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:30:53] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 18:30:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:30:53] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 18:30:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-02 18:30:53] [INFO ] After 120ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 18:30:53] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 104 ms.
[2022-06-02 18:30:53] [INFO ] After 517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 116 ms.
Support contains 50 out of 66 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-06-02 18:30:53] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:30:53] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-02 18:30:54] [INFO ] Implicit Places using invariants in 61 ms returned []
[2022-06-02 18:30:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:30:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-02 18:30:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-02 18:30:54] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2022-06-02 18:30:54] [INFO ] Redundant transitions in 16 ms returned []
[2022-06-02 18:30:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:30:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:30:54] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 66 transition count 130
Applied a total of 418 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 130/548 (removed 418) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:30:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-02 18:30:54] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:30:54] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 18:30:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:30:54] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 18:30:54] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 83 ms.
[2022-06-02 18:30:54] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-02 18:30:55] [INFO ] Flatten gal took : 46 ms
[2022-06-02 18:30:55] [INFO ] Flatten gal took : 17 ms
[2022-06-02 18:30:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13019217252383492072.gal : 9 ms
[2022-06-02 18:30:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9071979642105088441.prop : 1 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/ReachabilityCardinality13019217252383492072.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9071979642105088441.prop' '--nowitness' '--gen-order' 'FOLLOW'

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...320
Loading property file /tmp/ReachabilityCardinality9071979642105088441.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 55
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :55 after 189
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :189 after 2240
Reachability property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10 is true.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2240 after 43520
Reachability property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
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,245888,1.27543,9252,2,4602,14,29762,6,0,395,17313,0
Total reachable state count : 245888

Verifying 2 reachability properties.
Reachability property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04 is true.

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-V20P20N10-ReachabilityFireability-04,10,1.28956,9356,2,79,14,29762,7,0,528,17313,0
Reachability property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10 is true.

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-V20P20N10-ReachabilityFireability-10,10,1.32679,9356,2,94,14,29762,8,0,534,17313,0
[2022-06-02 18:30:56] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2344005525558104813
[2022-06-02 18:30:56] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2022-06-02 18:30:56] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 18:30:56] [INFO ] Applying decomposition
[2022-06-02 18:30:56] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2022-06-02 18:30:56] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 18:30:56] [INFO ] Flatten gal took : 96 ms
[2022-06-02 18:30:56] [INFO ] Flatten gal took : 84 ms
[2022-06-02 18:30:56] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2022-06-02 18:30:56] [INFO ] Input system was already deterministic with 548 transitions.
[2022-06-02 18:30:56] [INFO ] Computation of Completed DNA matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 18:30:56] [INFO ] Built C files in 278ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2344005525558104813
Running compilation step : cd /tmp/ltsmin2344005525558104813;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph6642666291838998273.txt' '-o' '/tmp/graph6642666291838998273.bin' '-w' '/tmp/graph6642666291838998273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6642666291838998273.bin' '-l' '-1' '-v' '-w' '/tmp/graph6642666291838998273.weights' '-q' '0' '-e' '0.001'
[2022-06-02 18:30:57] [INFO ] Decomposing Gal with order
[2022-06-02 18:30:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 18:30:57] [INFO ] Ran tautology test, simplified 0 / 2 in 572 ms.
[2022-06-02 18:30:57] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(UNSAT) depth K=0 took 16 ms
[2022-06-02 18:30:57] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(UNSAT) depth K=0 took 1 ms
[2022-06-02 18:30:57] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(UNSAT) depth K=1 took 16 ms
[2022-06-02 18:30:57] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(UNSAT) depth K=1 took 1 ms
[2022-06-02 18:30:57] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(UNSAT) depth K=2 took 73 ms
[2022-06-02 18:30:57] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(UNSAT) depth K=2 took 34 ms
[2022-06-02 18:30:57] [INFO ] Removed a total of 1031 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 130 out of 548 initially.
// Phase 1: matrix 130 rows 66 cols
[2022-06-02 18:30:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-02 18:30:57] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:30:57] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(UNSAT) depth K=3 took 187 ms
[2022-06-02 18:30:57] [INFO ] Flatten gal took : 397 ms
[2022-06-02 18:30:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 233 labels/synchronizations in 13 ms.
[2022-06-02 18:30:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16748844207072167307.gal : 3 ms
[2022-06-02 18:30:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14949675721677845161.prop : 2 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/ReachabilityFireability16748844207072167307.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14949675721677845161.prop' '--nowitness'

[2022-06-02 18:30:57] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(UNSAT) depth K=3 took 102 ms
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...300
Loading property file /tmp/ReachabilityFireability14949675721677845161.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1109 after 1307
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1307 after 1346
SDD proceeding with computation,2 properties remain. new max is 16
[2022-06-02 18:30:57] [INFO ] Proved 66 variables to be positive in 389 ms
SDD size :3243 after 3837
[2022-06-02 18:30:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04
[2022-06-02 18:30:57] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(SAT) depth K=0 took 13 ms
[2022-06-02 18:30:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10
[2022-06-02 18:30:57] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(SAT) depth K=0 took 4 ms
[2022-06-02 18:30:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04
[2022-06-02 18:30:58] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(SAT) depth K=1 took 270 ms
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14429 after 16026
[2022-06-02 18:30:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10
[2022-06-02 18:30:58] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(SAT) depth K=1 took 46 ms
[2022-06-02 18:30:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04
[2022-06-02 18:30:58] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(SAT) depth K=2 took 122 ms
[2022-06-02 18:30:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10
[2022-06-02 18:30:58] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(SAT) depth K=2 took 384 ms
[2022-06-02 18:30:59] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(UNSAT) depth K=4 took 1468 ms
Compilation finished in 2526 ms.
Running link step : cd /tmp/ltsmin2344005525558104813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin2344005525558104813;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesPTV20P20N10ReachabilityFireability04==true'
[2022-06-02 18:30:59] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(UNSAT) depth K=4 took 676 ms
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :78220 after 81090
[2022-06-02 18:31:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04
[2022-06-02 18:31:02] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(SAT) depth K=3 took 3811 ms
[2022-06-02 18:31:08] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(UNSAT) depth K=5 took 8460 ms
[2022-06-02 18:31:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10
[2022-06-02 18:31:09] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(SAT) depth K=3 took 6985 ms
[2022-06-02 18:31:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04
[2022-06-02 18:31:15] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(SAT) depth K=4 took 6223 ms
[2022-06-02 18:31:16] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(UNSAT) depth K=5 took 8412 ms
[2022-06-02 18:31:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10
[2022-06-02 18:31:28] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(SAT) depth K=4 took 12781 ms
[2022-06-02 18:31:43] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(UNSAT) depth K=6 took 27070 ms
[2022-06-02 18:31:57] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(UNSAT) depth K=6 took 13632 ms
[2022-06-02 18:31:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04
[2022-06-02 18:31:58] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(SAT) depth K=5 took 29604 ms
[2022-06-02 18:32:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10
[2022-06-02 18:32:24] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(SAT) depth K=5 took 26515 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.57242e+06 after 2.58237e+06
[2022-06-02 18:32:59] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(UNSAT) depth K=7 took 61588 ms
[2022-06-02 18:33:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04
[2022-06-02 18:33:20] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(SAT) depth K=6 took 55889 ms
[2022-06-02 18:33:37] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(UNSAT) depth K=7 took 38294 ms
[2022-06-02 18:34:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10
[2022-06-02 18:34:06] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(SAT) depth K=6 took 46218 ms
[2022-06-02 18:34:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04
[2022-06-02 18:34:14] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(SAT) depth K=7 took 7653 ms
[2022-06-02 18:34:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10
[2022-06-02 18:34:21] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(SAT) depth K=7 took 7303 ms
[2022-06-02 18:36:09] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(UNSAT) depth K=8 took 152363 ms
[2022-06-02 18:36:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04
[2022-06-02 18:36:14] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(SAT) depth K=8 took 112893 ms
[2022-06-02 18:37:37] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(UNSAT) depth K=8 took 87637 ms
[2022-06-02 18:38:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10
[2022-06-02 18:38:24] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10(SAT) depth K=8 took 129178 ms
[2022-06-02 18:39:32] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04(UNSAT) depth K=9 took 115580 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.73257e+06,211.874,1623968,5408,2058,2.05501e+06,86059,353,1.27713e+07,203,1.0015e+06,0
Total reachable state count : 6732570

Verifying 2 reachability properties.
Reachability property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04 does not hold.
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04

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-V20P20N10-ReachabilityFireability-04,0,213.192,1623968,1,0,2.05501e+06,86059,561,1.27713e+07,314,1.0015e+06,27127
Reachability property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10 does not hold.
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10

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-V20P20N10-ReachabilityFireability-10,0,213.213,1623968,1,0,2.05501e+06,86059,577,1.27713e+07,317,1.0015e+06,28063
[2022-06-02 18:40:43] [WARNING] Interrupting SMT solver.
[2022-06-02 18:40:43] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 18:40:43] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 18:40:43] [WARNING] Unexpected error occurred while running SMT. Was verifying BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10 SMT depth 9
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-02 18:40:43] [WARNING] Unexpected error occurred while running SMT. Was verifying BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04 K-induction depth 9
Exception in thread "Thread-7" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-02 18:40:43] [INFO ] During BMC, SMT solver timed out at depth 9
[2022-06-02 18:40:43] [INFO ] BMC solving timed out (3600000 secs) at depth 9
[2022-06-02 18:40:43] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 943459 ms.

BK_STOP 1654195243726

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-V20P20N10"
export BK_EXAMINATION="ReachabilityFireability"
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-V20P20N10, examination is ReachabilityFireability"
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-165251918200207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N10.tgz
mv BridgeAndVehicles-PT-V20P20N10 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;