fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897698900310
Last Updated
Jun 28, 2020

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15718.590 113201.00 240945.00 766.70 FFFTTTFFFFFTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897698900310.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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-V20P10N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897698900310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 11K Mar 26 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Mar 26 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Mar 25 20:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 25 20:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 25 17:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 25 17:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Mar 25 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Mar 25 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 598K Mar 24 05:37 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-V20P10N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589229415068

[2020-05-11 20:36:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-11 20:36:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 20:36:56] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2020-05-11 20:36:56] [INFO ] Transformed 68 places.
[2020-05-11 20:36:56] [INFO ] Transformed 548 transitions.
[2020-05-11 20:36:56] [INFO ] Parsed PT model containing 68 places and 548 transitions in 109 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 56 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0]
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-05-11 20:36:56] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-05-11 20:36:56] [INFO ] Computed 7 place invariants in 6 ms
[2020-05-11 20:36:57] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2020-05-11 20:36:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:36:57] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-05-11 20:36:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:36:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned unsat
[2020-05-11 20:36:57] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-11 20:36:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:36:57] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-05-11 20:36:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:36:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-11 20:36:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:36:57] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-05-11 20:36:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 20:36:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 24 ms returned sat
[2020-05-11 20:36:57] [INFO ] Deduced a trap composed of 5 places in 70 ms
[2020-05-11 20:36:57] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2020-05-11 20:36:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2020-05-11 20:36:57] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 23 ms.
[2020-05-11 20:36:58] [INFO ] Added : 125 causal constraints over 30 iterations in 1262 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-05-11 20:36:58] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 20:36:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:36:58] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-11 20:36:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:36:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned unsat
[2020-05-11 20:36:58] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-11 20:36:58] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-05-11 20:36:58] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 20:36:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:36:58] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
[2020-05-11 20:36:58] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 62700 steps, including 1108 resets, run finished after 151 ms. (steps per millisecond=415 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 548/548 transitions.
Discarding 2 places :
Also discarding 0 output 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.5 ms
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 66 transition count 548
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 547
Applied a total of 4 rules in 47 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2020-05-11 20:36:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2020-05-11 20:36:59] [INFO ] Computed 5 place invariants in 2 ms
[2020-05-11 20:36:59] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/68 places, 547/548 transitions.
Incomplete random walk after 1000000 steps, including 5632 resets, run finished after 1730 ms. (steps per millisecond=578 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 1994 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties seen :[0]
Interrupted probabilistic random walk after 18864914 steps, run timeout after 30001 ms. (steps per millisecond=628 ) properties seen :[0]
Probabilistic random walk after 18864914 steps, saw 4235061 distinct states, run finished after 30001 ms. (steps per millisecond=628 ) properties seen :[0]
[2020-05-11 20:37:31] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2020-05-11 20:37:31] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 20:37:31] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-05-11 20:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:37:31] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-11 20:37:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:37:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-11 20:37:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:37:31] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-05-11 20:37:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 20:37:32] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2020-05-11 20:37:32] [INFO ] Deduced a trap composed of 5 places in 43 ms
[2020-05-11 20:37:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2020-05-11 20:37:32] [INFO ] Computed and/alt/rep : 544/7789/126 causal constraints in 19 ms.
[2020-05-11 20:37:32] [INFO ] Added : 117 causal constraints over 24 iterations in 668 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
Incomplete Parikh walk after 71200 steps, including 1204 resets, run finished after 166 ms. (steps per millisecond=428 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 16 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 547/547 transitions.
Starting structural reductions, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 19 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2020-05-11 20:37:32] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2020-05-11 20:37:32] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 20:37:33] [INFO ] Implicit Places using invariants in 81 ms returned []
[2020-05-11 20:37:33] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2020-05-11 20:37:33] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 20:37:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 20:37:33] [INFO ] Implicit Places using invariants and state equation in 197 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 282 ms to find 2 implicit places.
[2020-05-11 20:37:33] [INFO ] Redundant transitions in 22 ms returned []
[2020-05-11 20:37:33] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-05-11 20:37:33] [INFO ] Computed 5 place invariants in 0 ms
[2020-05-11 20:37:33] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Starting structural reductions, iteration 1 : 63/65 places, 547/547 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2020-05-11 20:37:33] [INFO ] Redundant transitions in 3 ms returned []
[2020-05-11 20:37:33] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-05-11 20:37:33] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 20:37:33] [INFO ] Dead Transitions using invariants and state equation in 174 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/65 places, 547/547 transitions.
Incomplete random walk after 1000000 steps, including 5633 resets, run finished after 1539 ms. (steps per millisecond=649 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 1995 resets, run finished after 659 ms. (steps per millisecond=1517 ) properties seen :[0]
Interrupted probabilistic random walk after 20034805 steps, run timeout after 30001 ms. (steps per millisecond=667 ) properties seen :[0]
Probabilistic random walk after 20034805 steps, saw 4490011 distinct states, run finished after 30001 ms. (steps per millisecond=667 ) properties seen :[0]
[2020-05-11 20:38:05] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-05-11 20:38:05] [INFO ] Computed 5 place invariants in 5 ms
[2020-05-11 20:38:05] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-05-11 20:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:38:05] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-11 20:38:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:38:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-11 20:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:38:05] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-05-11 20:38:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 20:38:05] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2020-05-11 20:38:06] [INFO ] Deduced a trap composed of 5 places in 44 ms
[2020-05-11 20:38:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2020-05-11 20:38:06] [INFO ] Computed and/alt/rep : 544/6949/126 causal constraints in 15 ms.
[2020-05-11 20:38:06] [INFO ] Added : 124 causal constraints over 26 iterations in 604 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 63100 steps, including 1093 resets, run finished after 115 ms. (steps per millisecond=548 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 19 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 12 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2020-05-11 20:38:06] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-05-11 20:38:06] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 20:38:06] [INFO ] Implicit Places using invariants in 69 ms returned []
[2020-05-11 20:38:06] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-05-11 20:38:06] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 20:38:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 20:38:07] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2020-05-11 20:38:07] [INFO ] Redundant transitions in 4 ms returned []
[2020-05-11 20:38:07] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-05-11 20:38:07] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 20:38:07] [INFO ] Dead Transitions using invariants and state equation in 182 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Incomplete random walk after 100000 steps, including 563 resets, run finished after 154 ms. (steps per millisecond=649 ) properties seen :[0]
[2020-05-11 20:38:07] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-05-11 20:38:07] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 20:38:07] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-05-11 20:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:38:07] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-11 20:38:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:38:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-11 20:38:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:38:07] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-05-11 20:38:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 20:38:07] [INFO ] [Nat]Added 22 Read/Feed constraints in 11 ms returned sat
[2020-05-11 20:38:07] [INFO ] Deduced a trap composed of 5 places in 34 ms
[2020-05-11 20:38:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2020-05-11 20:38:07] [INFO ] Computed and/alt/rep : 544/6949/126 causal constraints in 14 ms.
[2020-05-11 20:38:08] [INFO ] Added : 124 causal constraints over 26 iterations in 613 ms. Result :sat
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 63 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 61 transition count 127
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 424 place count 61 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 426 place count 59 transition count 125
Applied a total of 426 rules in 7 ms. Remains 59 /63 variables (removed 4) and now considering 125/547 (removed 422) transitions.
// Phase 1: matrix 125 rows 59 cols
[2020-05-11 20:38:08] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 20:38:08] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-11 20:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:38:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-11 20:38:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:38:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-11 20:38:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:38:08] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-05-11 20:38:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-11 20:38:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2020-05-11 20:38:08] [INFO ] Computed and/alt/rep : 122/1242/122 causal constraints in 6 ms.
[2020-05-11 20:38:08] [INFO ] Added : 107 causal constraints over 23 iterations in 423 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-05-11 20:38:08] [INFO ] Flatten gal took : 61 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-11 20:38:09] [INFO ] Flatten gal took : 56 ms
[2020-05-11 20:38:09] [INFO ] Applying decomposition
[2020-05-11 20:38:09] [INFO ] Input system was already deterministic with 547 transitions.
[2020-05-11 20:38:09] [INFO ] Flatten gal took : 77 ms
[2020-05-11 20:38:09] [INFO ] Input system was already deterministic with 547 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2020-05-11 20:38:09] [INFO ] Computed 5 place invariants in 3 ms
inv : NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 = 1
inv : SUR_PONT_A + CAPACITE = 10
inv : COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + COMPTEUR_10 = 1
inv : NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 + NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 = 1
inv : CONTROLEUR_1 + CONTROLEUR_2 + CHOIX_1 + CHOIX_2 + VIDANGE_1 + VIDANGE_2 = 1
Total of 5 invariants.
[2020-05-11 20:38:09] [INFO ] Computed 5 place invariants in 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph9803999932124481899.txt, -o, /tmp/graph9803999932124481899.bin, -w, /tmp/graph9803999932124481899.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph9803999932124481899.bin, -l, -1, -v, -w, /tmp/graph9803999932124481899.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-11 20:38:09] [INFO ] Ran tautology test, simplified 0 / 1 in 291 ms.
[2020-05-11 20:38:09] [INFO ] Decomposing Gal with order
[2020-05-11 20:38:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-11 20:38:09] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(UNSAT) depth K=0 took 2 ms
[2020-05-11 20:38:09] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(UNSAT) depth K=1 took 6 ms
[2020-05-11 20:38:09] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(UNSAT) depth K=2 took 32 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2020-05-11 20:38:09] [INFO ] Computed 5 place invariants in 1 ms
inv : NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 = 1
inv : SUR_PONT_A + CAPACITE = 10
inv : COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + COMPTEUR_10 = 1
inv : NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 + NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 = 1
inv : CONTROLEUR_1 + CONTROLEUR_2 + CHOIX_1 + CHOIX_2 + VIDANGE_1 + VIDANGE_2 = 1
Total of 5 invariants.
[2020-05-11 20:38:09] [INFO ] Computed 5 place invariants in 1 ms
[2020-05-11 20:38:09] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(UNSAT) depth K=3 took 90 ms
[2020-05-11 20:38:09] [INFO ] Removed a total of 759 redundant transitions.
[2020-05-11 20:38:09] [INFO ] Flatten gal took : 154 ms
[2020-05-11 20:38:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 9 ms.
[2020-05-11 20:38:09] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 4 ms
[2020-05-11 20:38:09] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
[2020-05-11 20:38:09] [INFO ] Proved 63 variables to be positive in 400 ms
[2020-05-11 20:38:09] [INFO ] Computing symmetric may disable matrix : 547 transitions.
[2020-05-11 20:38:09] [INFO ] Computation of disable matrix completed :0/547 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09 with value :(((gi2.gu2.COMPTEUR_6<2)&&(gu0.COMPTEUR_9>gu0.CAPACITE))&&((gi2.gu3.NB_ATTENTE_B_9<2)||(gu1.NB_ATTENTE_B_7>gu1.CONTROLEUR_1)))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
[2020-05-11 20:38:09] [INFO ] Computation of Complete disable matrix. took 75 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation, new max is 64
[2020-05-11 20:38:09] [INFO ] Computing symmetric may enable matrix : 547 transitions.
[2020-05-11 20:38:09] [INFO ] Computation of Complete enable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation, new max is 128
[2020-05-11 20:38:09] [INFO ] Proved 63 variables to be positive in 369 ms
[2020-05-11 20:38:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09
[2020-05-11 20:38:09] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(SAT) depth K=0 took 2 ms
[2020-05-11 20:38:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09
[2020-05-11 20:38:10] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(SAT) depth K=1 took 209 ms
SDD proceeding with computation, new max is 256
[2020-05-11 20:38:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09
[2020-05-11 20:38:10] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(SAT) depth K=2 took 127 ms
[2020-05-11 20:38:10] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(UNSAT) depth K=4 took 724 ms
SDD proceeding with computation, new max is 512
[2020-05-11 20:38:10] [INFO ] Computing symmetric co enabling matrix : 547 transitions.
[2020-05-11 20:38:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09
[2020-05-11 20:38:10] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(SAT) depth K=3 took 664 ms
SDD proceeding with computation, new max is 1024
[2020-05-11 20:38:11] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(UNSAT) depth K=5 took 1444 ms
[2020-05-11 20:38:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09
[2020-05-11 20:38:12] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(SAT) depth K=4 took 1284 ms
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
[2020-05-11 20:38:12] [INFO ] Computation of co-enabling matrix(15/547) took 2173 ms. Total solver calls (SAT/UNSAT): 7560(400/7160)
SDD proceeding with computation, new max is 8192
[2020-05-11 20:38:14] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(UNSAT) depth K=6 took 2835 ms
SDD proceeding with computation, new max is 16384
[2020-05-11 20:38:15] [INFO ] Computation of co-enabling matrix(42/547) took 5224 ms. Total solver calls (SAT/UNSAT): 20685(520/20165)
[2020-05-11 20:38:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09
[2020-05-11 20:38:16] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(SAT) depth K=5 took 3975 ms
[2020-05-11 20:38:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09
[2020-05-11 20:38:16] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(SAT) depth K=6 took 759 ms
SDD proceeding with computation, new max is 32768
[2020-05-11 20:38:18] [INFO ] Computation of co-enabling matrix(65/547) took 8226 ms. Total solver calls (SAT/UNSAT): 31098(960/30138)
[2020-05-11 20:38:19] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(UNSAT) depth K=7 took 5000 ms
[2020-05-11 20:38:21] [INFO ] Computation of co-enabling matrix(94/547) took 11237 ms. Total solver calls (SAT/UNSAT): 44612(960/43652)
[2020-05-11 20:38:24] [INFO ] Computation of co-enabling matrix(126/547) took 14283 ms. Total solver calls (SAT/UNSAT): 58548(960/57588)
SDD proceeding with computation, new max is 65536
[2020-05-11 20:38:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09
[2020-05-11 20:38:26] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(SAT) depth K=7 took 9206 ms
[2020-05-11 20:38:27] [INFO ] Computation of co-enabling matrix(160/547) took 17291 ms. Total solver calls (SAT/UNSAT): 72233(960/71273)
[2020-05-11 20:38:28] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(UNSAT) depth K=8 took 8511 ms
[2020-05-11 20:38:31] [INFO ] Computation of co-enabling matrix(192/547) took 20400 ms. Total solver calls (SAT/UNSAT): 84057(960/83097)
[2020-05-11 20:38:34] [INFO ] Computation of co-enabling matrix(232/547) took 23413 ms. Total solver calls (SAT/UNSAT): 97397(960/96437)
[2020-05-11 20:38:37] [INFO ] Computation of co-enabling matrix(277/547) took 26469 ms. Total solver calls (SAT/UNSAT): 110492(960/109532)
[2020-05-11 20:38:40] [INFO ] Computation of co-enabling matrix(329/547) took 29489 ms. Total solver calls (SAT/UNSAT): 123102(960/122142)
SDD proceeding with computation, new max is 131072
[2020-05-11 20:38:43] [INFO ] Computation of co-enabling matrix(394/547) took 32526 ms. Total solver calls (SAT/UNSAT): 135062(960/134102)
[2020-05-11 20:38:43] [INFO ] BMC solution for property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09(UNSAT) depth K=9 took 15829 ms
[2020-05-11 20:38:46] [INFO ] Computation of co-enabling matrix(491/547) took 35544 ms. Total solver calls (SAT/UNSAT): 145053(960/144093)
[2020-05-11 20:38:47] [INFO ] Computation of Finished co-enabling matrix. took 36462 ms. Total solver calls (SAT/UNSAT): 146538(960/145578)
[2020-05-11 20:38:47] [INFO ] Computing Do-Not-Accords matrix : 547 transitions.
[2020-05-11 20:38:47] [INFO ] Computation of Completed DNA matrix. took 246 ms. Total solver calls (SAT/UNSAT): 40(0/40)
[2020-05-11 20:38:47] [INFO ] Built C files in 38381ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
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\_flatf,6.73257e+06,38.3364,812204,2,104230,28,1.55712e+06,7,0,629,2.55732e+06,0
Total reachable state count : 6732570

Verifying 1 reachability properties.
Reachability property BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09 does not hold.
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09

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-V20P10N10-ReachabilityCardinality-09,0,38.3519,812204,1,0,28,1.55712e+06,7,0,635,2.55732e+06,0
[2020-05-11 20:38:48] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2020-05-11 20:38:48] [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:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-11 20:38:48] [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:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-11 20:38:48] [WARNING] Unexpected error occurred while running SMT. Was verifying BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09 K-induction depth 8
Exception in thread "Thread-5" 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:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
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:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
[2020-05-11 20:38:48] [WARNING] Unexpected error occurred while running SMT. Was verifying BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09 SMT depth 10
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:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
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:384)
... 3 more
[2020-05-11 20:38:48] [INFO ] During BMC, SMT solver timed out at depth 10
[2020-05-11 20:38:48] [INFO ] BMC solving timed out (3600000 secs) at depth 10
[2020-05-11 20:38:48] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.

BK_STOP 1589229528269

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-V20P10N10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-V20P10N10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897698900310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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