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.r182-oct2-158987913800358.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 itslola
Input is BridgeAndVehicles-PT-V50P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913800358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 8.9K Mar 26 02:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 26 02:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 85K Mar 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 254K Mar 25 21:09 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 9.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 25 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 34K Mar 25 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 70K Mar 25 12:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 207K Mar 25 12:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K 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 1.5M 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-V50P20N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591145527243

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:52:08] [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, -timeout, 3600, -rebuildPNML]
[2020-06-03 00:52:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:52:08] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2020-06-03 00:52:08] [INFO ] Transformed 128 places.
[2020-06-03 00:52:08] [INFO ] Transformed 1328 transitions.
[2020-06-03 00:52:08] [INFO ] Parsed PT model containing 128 places and 1328 transitions in 179 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 103 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0]
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 1, 0, 0, 1, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 1, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-06-03 00:52:09] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2020-06-03 00:52:09] [INFO ] Computed 7 place invariants in 17 ms
[2020-06-03 00:52:09] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2020-06-03 00:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:52:09] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2020-06-03 00:52:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:52:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-03 00:52:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:52:09] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2020-06-03 00:52:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:52:09] [INFO ] [Nat]Added 22 Read/Feed constraints in 36 ms returned sat
[2020-06-03 00:52:09] [INFO ] Computed and/alt/rep : 1325/22399/247 causal constraints in 78 ms.
[2020-06-03 00:52:14] [INFO ] Added : 190 causal constraints over 38 iterations in 4782 ms. Result :unknown
[2020-06-03 00:52:14] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:52:14] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned unsat
[2020-06-03 00:52:14] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:52:14] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 33700 steps, including 698 resets, run finished after 126 ms. (steps per millisecond=267 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 1328/1328 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 1222 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Applied a total of 1 rules in 127 ms. Remains 127 /128 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2020-06-03 00:52:14] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2020-06-03 00:52:14] [INFO ] Computed 6 place invariants in 4 ms
[2020-06-03 00:52:15] [INFO ] Dead Transitions using invariants and state equation in 723 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/128 places, 1328/1328 transitions.
Incomplete random walk after 1000000 steps, including 2272 resets, run finished after 3313 ms. (steps per millisecond=301 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 929 resets, run finished after 1319 ms. (steps per millisecond=758 ) properties seen :[0]
Interrupted probabilistic random walk after 9044779 steps, run timeout after 30001 ms. (steps per millisecond=301 ) properties seen :[0]
Probabilistic random walk after 9044779 steps, saw 2170785 distinct states, run finished after 30004 ms. (steps per millisecond=301 ) properties seen :[0]
[2020-06-03 00:52:50] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2020-06-03 00:52:50] [INFO ] Computed 6 place invariants in 3 ms
[2020-06-03 00:52:50] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-06-03 00:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:52:50] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2020-06-03 00:52:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:52:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 22 ms returned sat
[2020-06-03 00:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:52:51] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2020-06-03 00:52:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:52:51] [INFO ] [Nat]Added 22 Read/Feed constraints in 60 ms returned sat
[2020-06-03 00:52:51] [INFO ] Computed and/alt/rep : 1325/22399/247 causal constraints in 60 ms.
[2020-06-03 00:53:03] [INFO ] Added : 224 causal constraints over 45 iterations in 12492 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 160 ms.
Incomplete Parikh walk after 52700 steps, including 781 resets, run finished after 149 ms. (steps per millisecond=353 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 88 ms. Remains 127 /127 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 1328/1328 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 103 ms. Remains 127 /127 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2020-06-03 00:53:04] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2020-06-03 00:53:04] [INFO ] Computed 6 place invariants in 5 ms
[2020-06-03 00:53:04] [INFO ] Implicit Places using invariants in 222 ms returned []
[2020-06-03 00:53:04] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2020-06-03 00:53:04] [INFO ] Computed 6 place invariants in 28 ms
[2020-06-03 00:53:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:53:06] [INFO ] Implicit Places using invariants and state equation in 1582 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1828 ms to find 2 implicit places.
[2020-06-03 00:53:06] [INFO ] Redundant transitions in 56 ms returned []
[2020-06-03 00:53:06] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2020-06-03 00:53:06] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 00:53:07] [INFO ] Dead Transitions using invariants and state equation in 737 ms returned []
Starting structural reductions, iteration 1 : 125/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 72 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2020-06-03 00:53:07] [INFO ] Redundant transitions in 13 ms returned []
[2020-06-03 00:53:07] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2020-06-03 00:53:07] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 00:53:07] [INFO ] Dead Transitions using invariants and state equation in 690 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/127 places, 1328/1328 transitions.
Incomplete random walk after 1000002 steps, including 2273 resets, run finished after 3099 ms. (steps per millisecond=322 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 929 resets, run finished after 1260 ms. (steps per millisecond=793 ) properties seen :[0]
Interrupted probabilistic random walk after 9344754 steps, run timeout after 30001 ms. (steps per millisecond=311 ) properties seen :[0]
Probabilistic random walk after 9344754 steps, saw 2238661 distinct states, run finished after 30003 ms. (steps per millisecond=311 ) properties seen :[0]
[2020-06-03 00:53:42] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2020-06-03 00:53:42] [INFO ] Computed 5 place invariants in 13 ms
[2020-06-03 00:53:42] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2020-06-03 00:53:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:53:42] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2020-06-03 00:53:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:53:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-03 00:53:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:53:42] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2020-06-03 00:53:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:53:42] [INFO ] [Nat]Added 22 Read/Feed constraints in 94 ms returned sat
[2020-06-03 00:53:42] [INFO ] Deduced a trap composed of 5 places in 132 ms
[2020-06-03 00:53:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2020-06-03 00:53:43] [INFO ] Computed and/alt/rep : 1325/17299/247 causal constraints in 103 ms.
[2020-06-03 00:53:47] [INFO ] Added : 219 causal constraints over 44 iterations in 4273 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
Incomplete Parikh walk after 57000 steps, including 868 resets, run finished after 133 ms. (steps per millisecond=428 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 83 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 1328/1328 transitions.
Starting structural reductions, iteration 0 : 125/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 88 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2020-06-03 00:53:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2020-06-03 00:53:47] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 00:53:47] [INFO ] Implicit Places using invariants in 321 ms returned []
[2020-06-03 00:53:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2020-06-03 00:53:47] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 00:53:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:53:49] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
[2020-06-03 00:53:49] [INFO ] Redundant transitions in 22 ms returned []
[2020-06-03 00:53:49] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2020-06-03 00:53:49] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 00:53:49] [INFO ] Dead Transitions using invariants and state equation in 805 ms returned []
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 1328/1328 transitions.
Incomplete random walk after 100000 steps, including 227 resets, run finished after 291 ms. (steps per millisecond=343 ) properties seen :[0]
[2020-06-03 00:53:50] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2020-06-03 00:53:50] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 00:53:50] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-03 00:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:53:50] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-06-03 00:53:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:53:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-06-03 00:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:53:50] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2020-06-03 00:53:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:53:50] [INFO ] [Nat]Added 22 Read/Feed constraints in 63 ms returned sat
[2020-06-03 00:53:50] [INFO ] Deduced a trap composed of 5 places in 74 ms
[2020-06-03 00:53:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2020-06-03 00:53:50] [INFO ] Computed and/alt/rep : 1325/17299/247 causal constraints in 67 ms.
[2020-06-03 00:53:54] [INFO ] Added : 219 causal constraints over 44 iterations in 3621 ms. Result :sat
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 125 transition count 250
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1079 place count 125 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1080 place count 124 transition count 249
Applied a total of 1080 rules in 12 ms. Remains 124 /125 variables (removed 1) and now considering 249/1328 (removed 1079) transitions.
// Phase 1: matrix 249 rows 124 cols
[2020-06-03 00:53:54] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 00:53:54] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-03 00:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:53:54] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2020-06-03 00:53:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:53:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 42 ms returned sat
[2020-06-03 00:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:53:56] [INFO ] [Nat]Absence check using state equation in 1039 ms returned sat
[2020-06-03 00:53:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 00:53:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 28 ms returned sat
[2020-06-03 00:53:56] [INFO ] Computed and/alt/rep : 246/2378/246 causal constraints in 17 ms.
[2020-06-03 00:53:57] [INFO ] Added : 213 causal constraints over 43 iterations in 1880 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-06-03 00:53:57] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2020-06-03 00:53:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 29 ms.
[2020-06-03 00:53:58] [INFO ] Flatten gal took : 154 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V50P20N10 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-PT-V50P20N10

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 00:53:58 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 41792,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((p52 <= p53) OR (2 <= p54) OR (2 <= p54) OR (p111 + p112 <= p53) OR (p52 + 1 <= p113))))",
"processed_size": 99,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 9807,
"conflict_clusters": 4,
"places": 125,
"places_significant": 120,
"singleton_clusters": 0,
"transitions": 1328
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1453/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4000
lola: finding significant places
lola: 125 places, 1328 transitions, 120 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: A (G (((p52 <= p53) OR (2 <= p54) OR (2 <= p54) OR (p111 + p112 <= p53) OR (p52 + 1 <= p113))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p52 <= p53) OR (2 <= p54) OR (2 <= p54) OR (p111 + p112 <= p53) OR (p52 + 1 <= p113))))
lola: processed formula length: 99
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p53 + 1 <= p52) AND (p54 <= 1) AND (p54 <= 1) AND (p53 + 1 <= p111 + p112) AND (p113 <= p52))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: local time limit reached - aborting
lola: memory consumption: 41792 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
rslt: finished

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V50P20N10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
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 itslola"
echo " Input is BridgeAndVehicles-PT-V50P20N10, 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 r182-oct2-158987913800358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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