Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900000286.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DES-PT-30b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 3.3K Mar 30 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 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 3.3K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 26 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 103K 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 DES-PT-30b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591190322459

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 13:18:45] [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 13:18:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 13:18:45] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2020-06-03 13:18:45] [INFO ] Transformed 399 places.
[2020-06-03 13:18:45] [INFO ] Transformed 350 transitions.
[2020-06-03 13:18:45] [INFO ] Found NUPN structural information;
[2020-06-03 13:18:45] [INFO ] Parsed PT model containing 399 places and 350 transitions in 235 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 63 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-30b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 84 resets, run finished after 111 ms. (steps per millisecond=90 ) properties seen :[1, 0, 1, 0, 1, 1, 1]
FORMULA DES-PT-30b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0]
// Phase 1: matrix 350 rows 399 cols
[2020-06-03 13:18:46] [INFO ] Computed 65 place invariants in 53 ms
[2020-06-03 13:18:46] [INFO ] [Real]Absence check using 39 positive place invariants in 65 ms returned sat
[2020-06-03 13:18:46] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2020-06-03 13:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:18:47] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2020-06-03 13:18:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:18:47] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 13:18:47] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 65 ms returned sat
[2020-06-03 13:18:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:18:48] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2020-06-03 13:18:48] [INFO ] Deduced a trap composed of 9 places in 291 ms
[2020-06-03 13:18:49] [INFO ] Deduced a trap composed of 24 places in 186 ms
[2020-06-03 13:18:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 619 ms
[2020-06-03 13:18:49] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 46 ms.
[2020-06-03 13:18:52] [INFO ] Added : 180 causal constraints over 36 iterations in 3177 ms. Result :unknown
[2020-06-03 13:18:52] [INFO ] [Real]Absence check using 39 positive place invariants in 71 ms returned sat
[2020-06-03 13:18:52] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2020-06-03 13:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:18:53] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2020-06-03 13:18:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:18:53] [INFO ] [Nat]Absence check using 39 positive place invariants in 62 ms returned sat
[2020-06-03 13:18:53] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 95 ms returned sat
[2020-06-03 13:18:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:18:54] [INFO ] [Nat]Absence check using state equation in 959 ms returned sat
[2020-06-03 13:18:54] [INFO ] Deduced a trap composed of 14 places in 190 ms
[2020-06-03 13:18:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2020-06-03 13:18:55] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 89 ms.
[2020-06-03 13:18:58] [INFO ] Added : 245 causal constraints over 49 iterations in 3517 ms. Result :(error "Failed to check-sat")
Incomplete Parikh walk after 254000 steps, including 3066 resets, run finished after 1000 ms. (steps per millisecond=254 ) properties seen :[0, 0] could not realise parikh vector
Support contains 6 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 350/350 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 858 edges and 399 vertex of which 388 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.14 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 388 transition count 323
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 43 place count 368 transition count 323
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 43 place count 368 transition count 314
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 61 place count 359 transition count 314
Symmetric choice reduction at 2 with 17 rule applications. Total rules 78 place count 359 transition count 314
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 112 place count 342 transition count 297
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 342 transition count 297
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 154 place count 328 transition count 283
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 168 place count 328 transition count 269
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 171 place count 326 transition count 268
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 171 place count 326 transition count 265
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 177 place count 323 transition count 265
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 333 place count 245 transition count 187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 337 place count 243 transition count 192
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 338 place count 243 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 242 transition count 191
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 340 place count 242 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 341 place count 241 transition count 190
Applied a total of 341 rules in 302 ms. Remains 241 /399 variables (removed 158) and now considering 190/350 (removed 160) transitions.
Finished structural reductions, in 1 iterations. Remains : 241/399 places, 190/350 transitions.
Incomplete random walk after 1000000 steps, including 38347 resets, run finished after 4307 ms. (steps per millisecond=232 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7180 resets, run finished after 1929 ms. (steps per millisecond=518 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6788 resets, run finished after 2295 ms. (steps per millisecond=435 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 8177897 steps, run timeout after 30001 ms. (steps per millisecond=272 ) properties seen :[0, 0]
Probabilistic random walk after 8177897 steps, saw 976750 distinct states, run finished after 30025 ms. (steps per millisecond=272 ) properties seen :[0, 0]
// Phase 1: matrix 190 rows 241 cols
[2020-06-03 13:19:38] [INFO ] Computed 61 place invariants in 15 ms
[2020-06-03 13:19:38] [INFO ] [Real]Absence check using 37 positive place invariants in 27 ms returned sat
[2020-06-03 13:19:38] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 24 ms returned sat
[2020-06-03 13:19:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:19:38] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2020-06-03 13:19:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:19:39] [INFO ] [Nat]Absence check using 37 positive place invariants in 27 ms returned sat
[2020-06-03 13:19:39] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 176 ms returned sat
[2020-06-03 13:19:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:19:39] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2020-06-03 13:19:39] [INFO ] Computed and/alt/rep : 187/834/187 causal constraints in 36 ms.
[2020-06-03 13:19:41] [INFO ] Added : 138 causal constraints over 28 iterations in 1289 ms. Result :sat
[2020-06-03 13:19:41] [INFO ] Deduced a trap composed of 30 places in 127 ms
[2020-06-03 13:19:41] [INFO ] Deduced a trap composed of 18 places in 103 ms
[2020-06-03 13:19:41] [INFO ] Deduced a trap composed of 10 places in 119 ms
[2020-06-03 13:19:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 555 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 13:19:41] [INFO ] [Real]Absence check using 37 positive place invariants in 28 ms returned sat
[2020-06-03 13:19:41] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 23 ms returned sat
[2020-06-03 13:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:19:42] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2020-06-03 13:19:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:19:42] [INFO ] [Nat]Absence check using 37 positive place invariants in 27 ms returned sat
[2020-06-03 13:19:42] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 61 ms returned sat
[2020-06-03 13:19:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:19:42] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2020-06-03 13:19:42] [INFO ] Computed and/alt/rep : 187/834/187 causal constraints in 23 ms.
[2020-06-03 13:19:43] [INFO ] Added : 146 causal constraints over 30 iterations in 1100 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
Incomplete Parikh walk after 126800 steps, including 6245 resets, run finished after 583 ms. (steps per millisecond=217 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 121200 steps, including 5958 resets, run finished after 540 ms. (steps per millisecond=224 ) properties seen :[0, 0] could not realise parikh vector
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 241/241 places, 190/190 transitions.
Applied a total of 0 rules in 19 ms. Remains 241 /241 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 241/241 places, 190/190 transitions.
Starting structural reductions, iteration 0 : 241/241 places, 190/190 transitions.
Applied a total of 0 rules in 19 ms. Remains 241 /241 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 241 cols
[2020-06-03 13:19:45] [INFO ] Computed 61 place invariants in 7 ms
[2020-06-03 13:19:45] [INFO ] Implicit Places using invariants in 722 ms returned []
// Phase 1: matrix 190 rows 241 cols
[2020-06-03 13:19:45] [INFO ] Computed 61 place invariants in 7 ms
[2020-06-03 13:19:47] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2713 ms to find 0 implicit places.
[2020-06-03 13:19:47] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 190 rows 241 cols
[2020-06-03 13:19:47] [INFO ] Computed 61 place invariants in 7 ms
[2020-06-03 13:19:48] [INFO ] Dead Transitions using invariants and state equation in 600 ms returned []
Finished structural reductions, in 1 iterations. Remains : 241/241 places, 190/190 transitions.
Incomplete random walk after 100000 steps, including 3829 resets, run finished after 433 ms. (steps per millisecond=230 ) properties seen :[0, 0]
// Phase 1: matrix 190 rows 241 cols
[2020-06-03 13:19:48] [INFO ] Computed 61 place invariants in 6 ms
[2020-06-03 13:19:48] [INFO ] [Real]Absence check using 37 positive place invariants in 29 ms returned sat
[2020-06-03 13:19:48] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 25 ms returned sat
[2020-06-03 13:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:19:49] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2020-06-03 13:19:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:19:49] [INFO ] [Nat]Absence check using 37 positive place invariants in 26 ms returned sat
[2020-06-03 13:19:49] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 191 ms returned sat
[2020-06-03 13:19:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:19:50] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2020-06-03 13:19:50] [INFO ] Computed and/alt/rep : 187/834/187 causal constraints in 22 ms.
[2020-06-03 13:19:51] [INFO ] Added : 138 causal constraints over 28 iterations in 1204 ms. Result :sat
[2020-06-03 13:19:51] [INFO ] Deduced a trap composed of 30 places in 153 ms
[2020-06-03 13:19:51] [INFO ] Deduced a trap composed of 18 places in 105 ms
[2020-06-03 13:19:51] [INFO ] Deduced a trap composed of 10 places in 102 ms
[2020-06-03 13:19:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 562 ms
[2020-06-03 13:19:52] [INFO ] [Real]Absence check using 37 positive place invariants in 27 ms returned sat
[2020-06-03 13:19:52] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 23 ms returned sat
[2020-06-03 13:19:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:19:52] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2020-06-03 13:19:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:19:52] [INFO ] [Nat]Absence check using 37 positive place invariants in 37 ms returned sat
[2020-06-03 13:19:52] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 75 ms returned sat
[2020-06-03 13:19:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:19:53] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2020-06-03 13:19:53] [INFO ] Computed and/alt/rep : 187/834/187 causal constraints in 27 ms.
[2020-06-03 13:19:54] [INFO ] Added : 146 causal constraints over 30 iterations in 1179 ms. Result :sat
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 241 transition count 190
Applied a total of 1 rules in 53 ms. Remains 241 /241 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 241 cols
[2020-06-03 13:19:54] [INFO ] Computed 61 place invariants in 8 ms
[2020-06-03 13:19:54] [INFO ] [Real]Absence check using 37 positive place invariants in 32 ms returned sat
[2020-06-03 13:19:54] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 27 ms returned sat
[2020-06-03 13:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:19:54] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2020-06-03 13:19:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:19:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 26 ms returned sat
[2020-06-03 13:19:55] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 176 ms returned sat
[2020-06-03 13:19:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:19:55] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2020-06-03 13:19:55] [INFO ] Deduced a trap composed of 6 places in 39 ms
[2020-06-03 13:19:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2020-06-03 13:19:55] [INFO ] Computed and/alt/rep : 187/834/187 causal constraints in 25 ms.
[2020-06-03 13:19:57] [INFO ] Added : 137 causal constraints over 28 iterations in 1509 ms. Result :sat
[2020-06-03 13:19:57] [INFO ] Deduced a trap composed of 27 places in 139 ms
[2020-06-03 13:19:57] [INFO ] Deduced a trap composed of 16 places in 129 ms
[2020-06-03 13:19:57] [INFO ] Deduced a trap composed of 27 places in 134 ms
[2020-06-03 13:19:57] [INFO ] Deduced a trap composed of 36 places in 138 ms
[2020-06-03 13:19:58] [INFO ] Deduced a trap composed of 22 places in 124 ms
[2020-06-03 13:19:58] [INFO ] Deduced a trap composed of 25 places in 104 ms
[2020-06-03 13:19:58] [INFO ] Deduced a trap composed of 22 places in 105 ms
[2020-06-03 13:19:58] [INFO ] Deduced a trap composed of 14 places in 102 ms
[2020-06-03 13:19:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1490 ms
Attempting to minimize the solution found.
Minimization took 35 ms.
[2020-06-03 13:19:58] [INFO ] [Real]Absence check using 37 positive place invariants in 28 ms returned sat
[2020-06-03 13:19:58] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 23 ms returned sat
[2020-06-03 13:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:19:59] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2020-06-03 13:19:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:19:59] [INFO ] [Nat]Absence check using 37 positive place invariants in 34 ms returned sat
[2020-06-03 13:19:59] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 59 ms returned sat
[2020-06-03 13:19:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:19:59] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2020-06-03 13:19:59] [INFO ] Computed and/alt/rep : 187/834/187 causal constraints in 32 ms.
[2020-06-03 13:20:00] [INFO ] Added : 149 causal constraints over 30 iterations in 1208 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-06-03 13:20:01] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2020-06-03 13:20:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
[2020-06-03 13:20:01] [INFO ] Flatten gal took : 148 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-30b @ 3570 seconds

FORMULA DES-PT-30b-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3520
rslt: Output for ReachabilityCardinality @ DES-PT-30b

{
"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",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 13:20:01 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p109)) AND ((p132 <= 0)))))",
"processed_size": 41,
"rewrites": 1
},
"result":
{
"edges": 325146,
"markings": 276801,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p35 <= 0)) OR ((1 <= p38)) OR ((p83 <= 0)) OR ((1 <= p122)))))",
"processed_size": 74,
"rewrites": 2
},
"result":
{
"edges": 9348178,
"markings": 8461048,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 19316,
"runtime": 50.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 969,
"conflict_clusters": 50,
"places": 241,
"places_significant": 180,
"singleton_clusters": 0,
"transitions": 190
},
"result":
{
"preliminary_value": "yes no ",
"value": "yes no "
},
"task":
{
"type": "compound"
}
}
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: 431/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 241
lola: finding significant places
lola: 241 places, 190 transitions, 180 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: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: E (F ((((1 <= p109)) AND ((p132 <= 0))))) : A (G ((((p35 <= 0)) OR ((1 <= p38)) OR ((p83 <= 0)) OR ((1 <= p122)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p109)) AND ((p132 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p109)) AND ((p132 <= 0)))))
lola: processed formula length: 41
lola: 1 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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p109)) AND ((p132 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 276801 markings, 325146 edges
lola: ========================================
lola: subprocess 1 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p35 <= 0)) OR ((1 <= p38)) OR ((p83 <= 0)) OR ((1 <= p122)))))
lola: ========================================
lola: SUBTASK
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 ((((p35 <= 0)) OR ((1 <= p38)) OR ((p83 <= 0)) OR ((1 <= p122)))))
lola: processed formula length: 74
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: 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: (((1 <= p35)) AND ((p38 <= 0)) AND ((1 <= p83)) AND ((p122 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1036534 markings, 1106796 edges, 207307 markings/sec, 0 secs
lola: sara is running 5 secs || 2037653 markings, 2203187 edges, 200224 markings/sec, 5 secs
lola: sara is running 10 secs || 3005872 markings, 3279050 edges, 193644 markings/sec, 10 secs
lola: sara is running 15 secs || 3979697 markings, 4364179 edges, 194765 markings/sec, 15 secs
lola: sara is running 20 secs || 4964498 markings, 5455788 edges, 196960 markings/sec, 20 secs
lola: sara is running 25 secs || 5956756 markings, 6562995 edges, 198452 markings/sec, 25 secs
lola: sara is running 30 secs || 6969193 markings, 7689815 edges, 202487 markings/sec, 30 secs
lola: sara is running 35 secs || 7982676 markings, 8814454 edges, 202697 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8461048 markings, 9348178 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no
lola:
preliminary result: yes no
lola: memory consumption: 19316 KB
lola: time consumption: 50 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
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="DES-PT-30b"
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 DES-PT-30b, 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 r180-ebro-158987900000286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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