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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.670 3600000.00 10629546.00 17625.30 FTFFTF?FFFFTTFTF 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-158897699000374.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-V50P20N50, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699000374
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.5M
-rw-r--r-- 1 mcc users 8.9K Mar 26 02:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 26 02:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K Mar 25 21:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 531K Mar 25 21:25 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 13K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 134K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 405K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Mar 25 17:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 25 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 540K Mar 25 13:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Mar 25 13:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.6K Mar 25 17:55 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 6.0M 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-V50P20N50-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589237842479

[2020-05-11 22:57:23] [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 22:57:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 22:57:24] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2020-05-11 22:57:24] [INFO ] Transformed 168 places.
[2020-05-11 22:57:24] [INFO ] Transformed 5408 transitions.
[2020-05-11 22:57:24] [INFO ] Parsed PT model containing 168 places and 5408 transitions in 308 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 128 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 23 resets, run finished after 206 ms. (steps per millisecond=48 ) properties seen :[0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1]
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[1, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 60 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0]
[2020-05-11 22:57:25] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 168 cols
[2020-05-11 22:57:25] [INFO ] Computed 7 place invariants in 18 ms
[2020-05-11 22:57:25] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned unsat
[2020-05-11 22:57:25] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-05-11 22:57:25] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2020-05-11 22:57:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:57:25] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2020-05-11 22:57:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:57:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-05-11 22:57:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:57:25] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2020-05-11 22:57:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-05-11 22:57:26] [INFO ] [Nat]Added 102 Read/Feed constraints in 470 ms returned sat
[2020-05-11 22:57:26] [INFO ] Computed and/alt/rep : 5405/288599/407 causal constraints in 404 ms.
[2020-05-11 22:57:30] [INFO ] Added : 130 causal constraints over 26 iterations in 4202 ms. Result :(error "Failed to check-sat")
[2020-05-11 22:57:30] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned unsat
[2020-05-11 22:57:30] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned unsat
[2020-05-11 22:57:30] [INFO ] [Real]Absence check using 7 positive place invariants in 55 ms returned unsat
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 7 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 5408/5408 transitions.
Applied a total of 0 rules in 1230 ms. Remains 168 /168 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2020-05-11 22:57:32] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 168 cols
[2020-05-11 22:57:32] [INFO ] Computed 7 place invariants in 6 ms
[2020-05-11 22:57:36] [INFO ] Dead Transitions using invariants and state equation in 4033 ms returned []
Finished structural reductions, in 1 iterations. Remains : 168/168 places, 5408/5408 transitions.
Incomplete random walk after 1000000 steps, including 2353 resets, run finished after 10270 ms. (steps per millisecond=97 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 707 resets, run finished after 3167 ms. (steps per millisecond=315 ) properties seen :[0]
Interrupted probabilistic random walk after 2596979 steps, run timeout after 30001 ms. (steps per millisecond=86 ) properties seen :[0]
Probabilistic random walk after 2596979 steps, saw 678873 distinct states, run finished after 30001 ms. (steps per millisecond=86 ) properties seen :[0]
[2020-05-11 22:58:19] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 168 cols
[2020-05-11 22:58:19] [INFO ] Computed 7 place invariants in 5 ms
[2020-05-11 22:58:19] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-11 22:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:58:19] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2020-05-11 22:58:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:58:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-05-11 22:58:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:58:20] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2020-05-11 22:58:20] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-05-11 22:58:20] [INFO ] [Nat]Added 102 Read/Feed constraints in 472 ms returned sat
[2020-05-11 22:58:20] [INFO ] Computed and/alt/rep : 5405/288599/407 causal constraints in 274 ms.
[2020-05-11 22:58:41] [INFO ] Added : 310 causal constraints over 62 iterations in 20804 ms.(timeout) Result :sat
[2020-05-11 22:58:42] [INFO ] Deduced a trap composed of 55 places in 553 ms
[2020-05-11 22:58:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 953 ms
Attempting to minimize the solution found.
Minimization took 352 ms.
Incomplete Parikh walk after 979000 steps, including 3269 resets, run finished after 14112 ms. (steps per millisecond=69 ) properties seen :[0] could not realise parikh vector
Support contains 7 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 5408/5408 transitions.
Applied a total of 0 rules in 1099 ms. Remains 168 /168 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/168 places, 5408/5408 transitions.
Starting structural reductions, iteration 0 : 168/168 places, 5408/5408 transitions.
Applied a total of 0 rules in 852 ms. Remains 168 /168 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2020-05-11 22:58:58] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 168 cols
[2020-05-11 22:58:58] [INFO ] Computed 7 place invariants in 3 ms
[2020-05-11 22:58:59] [INFO ] Implicit Places using invariants in 976 ms returned []
[2020-05-11 22:58:59] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 168 cols
[2020-05-11 22:58:59] [INFO ] Computed 7 place invariants in 2 ms
[2020-05-11 22:59:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-05-11 22:59:02] [INFO ] Implicit Places using invariants and state equation in 2418 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3419 ms to find 1 implicit places.
[2020-05-11 22:59:02] [INFO ] Redundant transitions in 439 ms returned []
[2020-05-11 22:59:02] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 167 cols
[2020-05-11 22:59:02] [INFO ] Computed 6 place invariants in 3 ms
[2020-05-11 22:59:05] [INFO ] Dead Transitions using invariants and state equation in 3042 ms returned []
Starting structural reductions, iteration 1 : 167/168 places, 5408/5408 transitions.
Applied a total of 0 rules in 799 ms. Remains 167 /167 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2020-05-11 22:59:07] [INFO ] Redundant transitions in 412 ms returned []
[2020-05-11 22:59:07] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 167 cols
[2020-05-11 22:59:07] [INFO ] Computed 6 place invariants in 2 ms
[2020-05-11 22:59:10] [INFO ] Dead Transitions using invariants and state equation in 3013 ms returned []
Finished structural reductions, in 2 iterations. Remains : 167/168 places, 5408/5408 transitions.
Incomplete random walk after 1000000 steps, including 2353 resets, run finished after 9467 ms. (steps per millisecond=105 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 704 resets, run finished after 2981 ms. (steps per millisecond=335 ) properties seen :[0]
Interrupted probabilistic random walk after 2662212 steps, run timeout after 30001 ms. (steps per millisecond=88 ) properties seen :[0]
Probabilistic random walk after 2662212 steps, saw 696715 distinct states, run finished after 30001 ms. (steps per millisecond=88 ) properties seen :[0]
[2020-05-11 22:59:52] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 167 cols
[2020-05-11 22:59:52] [INFO ] Computed 6 place invariants in 2 ms
[2020-05-11 22:59:52] [INFO ] [Real]Absence check using 6 positive place invariants in 34 ms returned sat
[2020-05-11 22:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:59:52] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-05-11 22:59:52] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-05-11 22:59:52] [INFO ] [Real]Added 102 Read/Feed constraints in 97 ms returned sat
[2020-05-11 22:59:53] [INFO ] Deduced a trap composed of 5 places in 856 ms
[2020-05-11 22:59:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 924 ms
[2020-05-11 22:59:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:59:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-11 22:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:59:54] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2020-05-11 22:59:54] [INFO ] [Nat]Added 102 Read/Feed constraints in 899 ms returned sat
[2020-05-11 22:59:55] [INFO ] Computed and/alt/rep : 5405/286049/407 causal constraints in 309 ms.
[2020-05-11 23:00:09] [INFO ] Added : 210 causal constraints over 42 iterations in 14105 ms. Result :unknown
Incomplete Parikh walk after 1115300 steps, including 3596 resets, run finished after 14908 ms. (steps per millisecond=74 ) properties seen :[0] could not realise parikh vector
Support contains 7 out of 167 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 167/167 places, 5408/5408 transitions.
Applied a total of 0 rules in 834 ms. Remains 167 /167 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 167/167 places, 5408/5408 transitions.
Starting structural reductions, iteration 0 : 167/167 places, 5408/5408 transitions.
Applied a total of 0 rules in 934 ms. Remains 167 /167 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2020-05-11 23:00:25] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 167 cols
[2020-05-11 23:00:25] [INFO ] Computed 6 place invariants in 5 ms
[2020-05-11 23:00:26] [INFO ] Implicit Places using invariants in 897 ms returned []
[2020-05-11 23:00:26] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 167 cols
[2020-05-11 23:00:26] [INFO ] Computed 6 place invariants in 1 ms
[2020-05-11 23:00:26] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-05-11 23:00:29] [INFO ] Implicit Places using invariants and state equation in 3019 ms returned []
Implicit Place search using SMT with State Equation took 3919 ms to find 0 implicit places.
[2020-05-11 23:00:30] [INFO ] Redundant transitions in 292 ms returned []
[2020-05-11 23:00:30] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 167 cols
[2020-05-11 23:00:30] [INFO ] Computed 6 place invariants in 4 ms
[2020-05-11 23:00:34] [INFO ] Dead Transitions using invariants and state equation in 3951 ms returned []
Finished structural reductions, in 1 iterations. Remains : 167/167 places, 5408/5408 transitions.
Incomplete random walk after 100000 steps, including 235 resets, run finished after 944 ms. (steps per millisecond=105 ) properties seen :[0]
[2020-05-11 23:00:35] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 167 cols
[2020-05-11 23:00:35] [INFO ] Computed 6 place invariants in 1 ms
[2020-05-11 23:00:35] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-05-11 23:00:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 23:00:35] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2020-05-11 23:00:35] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-05-11 23:00:35] [INFO ] [Real]Added 102 Read/Feed constraints in 63 ms returned sat
[2020-05-11 23:00:36] [INFO ] Deduced a trap composed of 5 places in 870 ms
[2020-05-11 23:00:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 905 ms
[2020-05-11 23:00:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 23:00:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-11 23:00:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 23:00:36] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2020-05-11 23:00:37] [INFO ] [Nat]Added 102 Read/Feed constraints in 892 ms returned sat
[2020-05-11 23:00:37] [INFO ] Computed and/alt/rep : 5405/286049/407 causal constraints in 469 ms.
[2020-05-11 23:00:52] [INFO ] Added : 210 causal constraints over 42 iterations in 14920 ms. Result :unknown
Ensure Unique test removed 4998 transitions
Reduce isomorphic transitions removed 4998 transitions.
Iterating post reduction 0 with 4998 rules applied. Total rules applied 4998 place count 167 transition count 410
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5002 place count 165 transition count 408
Applied a total of 5002 rules in 17 ms. Remains 165 /167 variables (removed 2) and now considering 408/5408 (removed 5000) transitions.
// Phase 1: matrix 408 rows 165 cols
[2020-05-11 23:00:52] [INFO ] Computed 6 place invariants in 1 ms
[2020-05-11 23:00:52] [INFO ] [Real]Absence check using 6 positive place invariants in 37 ms returned sat
[2020-05-11 23:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 23:00:52] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2020-05-11 23:00:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 23:00:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 52 ms returned sat
[2020-05-11 23:00:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 23:00:53] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2020-05-11 23:00:53] [INFO ] Computed and/alt/rep : 405/18748/405 causal constraints in 35 ms.
[2020-05-11 23:01:14] [INFO ] Added : 295 causal constraints over 59 iterations in 21176 ms.(timeout) Result :sat
[2020-05-11 23:01:14] [INFO ] Deduced a trap composed of 52 places in 113 ms
[2020-05-11 23:01:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 506 ms
Attempting to minimize the solution found.
Minimization took 316 ms.
[2020-05-11 23:01:16] [INFO ] Flatten gal took : 538 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-11 23:01:17] [INFO ] Input system was already deterministic with 5408 transitions.
[2020-05-11 23:01:17] [INFO ] Too many transitions (5408) to apply POR reductions. Disabling POR matrices.
[2020-05-11 23:01:17] [INFO ] Flatten gal took : 1118 ms
[2020-05-11 23:01:17] [INFO ] Applying decomposition
[2020-05-11 23:01:18] [INFO ] Flatten gal took : 412 ms
[2020-05-11 23:01:18] [INFO ] Input system was already deterministic with 5408 transitions.
[2020-05-11 23:01:18] [INFO ] Built C files in 1618ms 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]
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/graph2549480768306874781.txt, -o, /tmp/graph2549480768306874781.bin, -w, /tmp/graph2549480768306874781.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/graph2549480768306874781.bin, -l, -1, -v, -w, /tmp/graph2549480768306874781.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-11 23:01:19] [INFO ] Decomposing Gal with order
[2020-05-11 23:01:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-11 23:01:21] [INFO ] Ran tautology test, simplified 0 / 1 in 4093 ms.
[2020-05-11 23:01:21] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=0 took 100 ms
[2020-05-11 23:01:21] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=1 took 3 ms
[2020-05-11 23:01:22] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=2 took 283 ms
[2020-05-11 23:01:22] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=3 took 373 ms
[2020-05-11 23:01:23] [INFO ] Removed a total of 5294 redundant transitions.
[2020-05-11 23:01:23] [INFO ] Flatten gal took : 3830 ms
[2020-05-11 23:01:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 493 labels/synchronizations in 139 ms.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 410 out of 5408 initially.
// Phase 1: matrix 410 rows 167 cols
[2020-05-11 23:01:24] [INFO ] Computed 6 place invariants in 64 ms
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 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 = 1
inv : CONTROLEUR_1 + CONTROLEUR_2 + CHOIX_1 + CHOIX_2 + VIDANGE_1 + VIDANGE_2 = 1
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 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 = 1
inv : SUR_PONT_A + CAPACITE + SUR_PONT_B = 20
inv : COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 = 1
inv : ROUTE_A + ATTENTE_A + SUR_PONT_A + SORTI_A = 50
Total of 6 invariants.
[2020-05-11 23:01:24] [INFO ] Computed 6 place invariants in 65 ms
[2020-05-11 23:01:25] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 109 ms
[2020-05-11 23:01:25] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 1 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
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06 with value :(((((gu0.SUR_PONT_B>=3)&&(gu0.SUR_PONT_B<=gu0.ROUTE_A))&&(gi1.gu2.SUR_PONT_A>=3))&&((gu3.SORTI_B<=gu0.ROUTE_A)||(gu3.SORTI_A<=gu3.ROUTE_B)))&&((gi1.gu1.ATTENTE_A<=1)||(gu3.SORTI_B<=gu3.ROUTE_B)))
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 23:01:28] [INFO ] Proved 167 variables to be positive in 4397 ms
[2020-05-11 23:01:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06
[2020-05-11 23:01:28] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(SAT) depth K=0 took 26 ms
SDD proceeding with computation, new max is 64
[2020-05-11 23:01:29] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=4 took 6384 ms
[2020-05-11 23:01:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06
[2020-05-11 23:01:35] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(SAT) depth K=1 took 6770 ms
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
[2020-05-11 23:01:45] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=5 took 16322 ms
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
[2020-05-11 23:02:29] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=6 took 43945 ms
[2020-05-11 23:03:24] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=7 took 55430 ms
[2020-05-11 23:03:43] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06
[2020-05-11 23:03:43] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(SAT) depth K=2 took 127552 ms
Compilation finished in 184285 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 72 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BridgeAndVehiclesPTV50P20N50ReachabilityCardinality06==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BridgeAndVehiclesPTV50P20N50ReachabilityCardinality06==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BridgeAndVehiclesPTV50P20N50ReachabilityCardinality06==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
SDD proceeding with computation, new max is 32768
[2020-05-11 23:04:57] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=8 took 92543 ms
[2020-05-11 23:07:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06
[2020-05-11 23:07:31] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(SAT) depth K=3 took 227590 ms
[2020-05-11 23:09:34] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=9 took 277162 ms
[2020-05-11 23:09:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06
[2020-05-11 23:09:48] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(SAT) depth K=4 took 136987 ms
[2020-05-11 23:10:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06
[2020-05-11 23:10:51] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(SAT) depth K=5 took 63148 ms
[2020-05-11 23:13:48] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=10 took 253931 ms
[2020-05-11 23:17:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06
[2020-05-11 23:17:06] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(SAT) depth K=6 took 375282 ms
SDD proceeding with computation, new max is 65536
[2020-05-11 23:22:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06
[2020-05-11 23:22:23] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(SAT) depth K=7 took 316527 ms
Detected timeout of ITS tools.
[2020-05-11 23:22:46] [INFO ] Flatten gal took : 2000 ms
[2020-05-11 23:22:46] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 232 ms
[2020-05-11 23:22:46] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 14 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
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06 with value :(((((SUR_PONT_B>=3)&&(SUR_PONT_B<=ROUTE_A))&&(SUR_PONT_A>=3))&&((SORTI_B<=ROUTE_A)||(SORTI_A<=ROUTE_B)))&&((ATTENTE_A<=1)||(SORTI_B<=ROUTE_B)))
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
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
[2020-05-11 23:27:43] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=11 took 834993 ms
[2020-05-11 23:30:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06
[2020-05-11 23:30:24] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(SAT) depth K=8 took 481675 ms
[2020-05-11 23:37:32] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=12 took 589252 ms
Detected timeout of ITS tools.
[2020-05-11 23:44:13] [INFO ] Flatten gal took : 2805 ms
[2020-05-11 23:44:19] [INFO ] Input system was already deterministic with 5408 transitions.
[2020-05-11 23:44:19] [INFO ] Transformed 167 places.
[2020-05-11 23:44:19] [INFO ] Transformed 5408 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-11 23:44:20] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 39 ms
[2020-05-11 23:44:20] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 1 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, --load-order, /home/mcc/execution/model.ord, --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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06 with value :(((((SUR_PONT_B>=3)&&(SUR_PONT_B<=ROUTE_A))&&(SUR_PONT_A>=3))&&((SORTI_B<=ROUTE_A)||(SORTI_A<=ROUTE_B)))&&((ATTENTE_A<=1)||(SORTI_B<=ROUTE_B)))
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
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
[2020-05-11 23:51:30] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(UNSAT) depth K=13 took 837840 ms
[2020-05-11 23:54:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06
[2020-05-11 23:54:40] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(SAT) depth K=9 took 1455586 ms
[2020-05-11 23:55:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06
[2020-05-11 23:55:54] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P20N50-ReachabilityCardinality-06(SAT) depth K=10 took 73718 ms

BK_TIME_CONFINEMENT_REACHED

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

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