Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r168-smll-158987806600334.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 CloudDeployment-PT-6a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806600334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 3.6K Mar 30 01:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 30 01:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 26 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 317K 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 CloudDeployment-PT-6a-ReachabilityCardinality-00
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-01
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-02
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-03
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-04
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-05
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-06
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-07
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-08
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-09
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-10
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-11
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-12
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-13
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-14
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591303686575

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 20:48:09] [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-04 20:48:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 20:48:09] [INFO ] Load time of PNML (sax parser for PT used): 263 ms
[2020-06-04 20:48:09] [INFO ] Transformed 221 places.
[2020-06-04 20:48:09] [INFO ] Transformed 908 transitions.
[2020-06-04 20:48:09] [INFO ] Found NUPN structural information;
[2020-06-04 20:48:09] [INFO ] Parsed PT model containing 221 places and 908 transitions in 364 ms.
Ensure Unique test removed 114 transitions
Reduce redundant transitions removed 114 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 62 ms.
Working with output stream class java.io.PrintStream
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 112 resets, run finished after 164 ms. (steps per millisecond=60 ) properties seen :[0, 1, 1, 1, 1, 0, 0, 1, 1, 1]
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0]
[2020-06-04 20:48:10] [INFO ] Flow matrix only has 384 transitions (discarded 410 similar events)
// Phase 1: matrix 384 rows 221 cols
[2020-06-04 20:48:10] [INFO ] Computed 36 place invariants in 24 ms
[2020-06-04 20:48:10] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 63 ms returned sat
[2020-06-04 20:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:48:10] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2020-06-04 20:48:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:48:11] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 566 ms returned sat
[2020-06-04 20:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:48:12] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2020-06-04 20:48:12] [INFO ] State equation strengthened by 182 read => feed constraints.
[2020-06-04 20:48:12] [INFO ] [Nat]Added 182 Read/Feed constraints in 73 ms returned sat
[2020-06-04 20:48:12] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 109 ms.
[2020-06-04 20:48:14] [INFO ] Added : 214 causal constraints over 44 iterations in 2441 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-04 20:48:14] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 38 ms returned sat
[2020-06-04 20:48:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:48:15] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2020-06-04 20:48:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:48:15] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 601 ms returned sat
[2020-06-04 20:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:48:16] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2020-06-04 20:48:16] [INFO ] [Nat]Added 182 Read/Feed constraints in 59 ms returned sat
[2020-06-04 20:48:16] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 75 ms.
[2020-06-04 20:48:18] [INFO ] Added : 217 causal constraints over 44 iterations in 1915 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-04 20:48:18] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 50 ms returned sat
[2020-06-04 20:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:48:18] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2020-06-04 20:48:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:48:19] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 619 ms returned sat
[2020-06-04 20:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:48:20] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2020-06-04 20:48:20] [INFO ] [Nat]Added 182 Read/Feed constraints in 56 ms returned sat
[2020-06-04 20:48:20] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 66 ms.
[2020-06-04 20:48:21] [INFO ] Added : 198 causal constraints over 40 iterations in 1755 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 11500 steps, including 127 resets, run finished after 118 ms. (steps per millisecond=97 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 18600 steps, including 195 resets, run finished after 180 ms. (steps per millisecond=103 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 19500 steps, including 177 resets, run finished after 143 ms. (steps per millisecond=136 ) properties seen :[0, 0] could not realise parikh vector
Support contains 9 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 794/794 transitions.
Graph (trivial) has 232 edges and 221 vertex of which 60 / 221 are part of one of the 18 SCC in 9 ms
Free SCC test removed 42 places
Ensure Unique test removed 10 places
Drop transitions removed 207 transitions
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 249 transitions.
Iterating post reduction 0 with 259 rules applied. Total rules applied 260 place count 169 transition count 545
Symmetric choice reduction at 1 with 4 rule applications. Total rules 264 place count 169 transition count 545
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 272 place count 165 transition count 541
Symmetric choice reduction at 1 with 1 rule applications. Total rules 273 place count 165 transition count 541
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 275 place count 164 transition count 540
Symmetric choice reduction at 1 with 1 rule applications. Total rules 276 place count 164 transition count 540
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 278 place count 163 transition count 539
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 314 place count 145 transition count 605
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 318 place count 145 transition count 856
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 322 place count 141 transition count 856
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 323 place count 141 transition count 856
Partial Post-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 334 place count 141 transition count 856
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 339 place count 141 transition count 851
Drop transitions removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 3 with 102 rules applied. Total rules applied 441 place count 141 transition count 749
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 442 place count 141 transition count 1004
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 443 place count 140 transition count 1004
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 444 place count 139 transition count 1003
Applied a total of 444 rules in 330 ms. Remains 139 /221 variables (removed 82) and now considering 1003/794 (removed -209) transitions.
Finished structural reductions, in 1 iterations. Remains : 139/221 places, 1003/794 transitions.
Incomplete random walk after 1000000 steps, including 12781 resets, run finished after 5994 ms. (steps per millisecond=166 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1745 resets, run finished after 1323 ms. (steps per millisecond=755 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1784 resets, run finished after 1273 ms. (steps per millisecond=785 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 5433276 steps, run timeout after 30001 ms. (steps per millisecond=181 ) properties seen :[0, 0]
Probabilistic random walk after 5433276 steps, saw 850691 distinct states, run finished after 30001 ms. (steps per millisecond=181 ) properties seen :[0, 0]
[2020-06-04 20:49:01] [INFO ] Flow matrix only has 715 transitions (discarded 288 similar events)
// Phase 1: matrix 715 rows 139 cols
[2020-06-04 20:49:01] [INFO ] Computed 26 place invariants in 12 ms
[2020-06-04 20:49:01] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 18 ms returned sat
[2020-06-04 20:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:01] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2020-06-04 20:49:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:49:01] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 61 ms returned sat
[2020-06-04 20:49:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:02] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2020-06-04 20:49:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2020-06-04 20:49:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 37 ms returned sat
[2020-06-04 20:49:02] [INFO ] Computed and/alt/rep : 967/11120/679 causal constraints in 162 ms.
[2020-06-04 20:49:03] [INFO ] Added : 116 causal constraints over 24 iterations in 1257 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2020-06-04 20:49:03] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 23 ms returned sat
[2020-06-04 20:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:03] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2020-06-04 20:49:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:49:04] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 24 ms returned sat
[2020-06-04 20:49:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:04] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2020-06-04 20:49:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2020-06-04 20:49:04] [INFO ] Computed and/alt/rep : 967/11120/679 causal constraints in 116 ms.
[2020-06-04 20:49:05] [INFO ] Added : 94 causal constraints over 19 iterations in 1086 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
Incomplete Parikh walk after 10100 steps, including 144 resets, run finished after 67 ms. (steps per millisecond=150 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 10600 steps, including 129 resets, run finished after 61 ms. (steps per millisecond=173 ) properties seen :[0, 0] could not realise parikh vector
Support contains 9 out of 139 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 139/139 places, 1003/1003 transitions.
Applied a total of 0 rules in 20 ms. Remains 139 /139 variables (removed 0) and now considering 1003/1003 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 139/139 places, 1003/1003 transitions.
Starting structural reductions, iteration 0 : 139/139 places, 1003/1003 transitions.
Applied a total of 0 rules in 19 ms. Remains 139 /139 variables (removed 0) and now considering 1003/1003 (removed 0) transitions.
[2020-06-04 20:49:05] [INFO ] Flow matrix only has 715 transitions (discarded 288 similar events)
// Phase 1: matrix 715 rows 139 cols
[2020-06-04 20:49:05] [INFO ] Computed 26 place invariants in 9 ms
[2020-06-04 20:49:06] [INFO ] Implicit Places using invariants in 300 ms returned []
[2020-06-04 20:49:06] [INFO ] Flow matrix only has 715 transitions (discarded 288 similar events)
// Phase 1: matrix 715 rows 139 cols
[2020-06-04 20:49:06] [INFO ] Computed 26 place invariants in 10 ms
[2020-06-04 20:49:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2020-06-04 20:49:07] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 1630 ms to find 0 implicit places.
[2020-06-04 20:49:07] [INFO ] Redundant transitions in 95 ms returned []
[2020-06-04 20:49:07] [INFO ] Flow matrix only has 715 transitions (discarded 288 similar events)
// Phase 1: matrix 715 rows 139 cols
[2020-06-04 20:49:07] [INFO ] Computed 26 place invariants in 8 ms
[2020-06-04 20:49:08] [INFO ] Dead Transitions using invariants and state equation in 1475 ms returned []
Finished structural reductions, in 1 iterations. Remains : 139/139 places, 1003/1003 transitions.
Incomplete random walk after 100000 steps, including 1293 resets, run finished after 548 ms. (steps per millisecond=182 ) properties seen :[0, 0]
[2020-06-04 20:49:09] [INFO ] Flow matrix only has 715 transitions (discarded 288 similar events)
// Phase 1: matrix 715 rows 139 cols
[2020-06-04 20:49:09] [INFO ] Computed 26 place invariants in 10 ms
[2020-06-04 20:49:09] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 16 ms returned sat
[2020-06-04 20:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:09] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2020-06-04 20:49:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:49:09] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 52 ms returned sat
[2020-06-04 20:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:10] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2020-06-04 20:49:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2020-06-04 20:49:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 40 ms returned sat
[2020-06-04 20:49:10] [INFO ] Computed and/alt/rep : 967/11120/679 causal constraints in 111 ms.
[2020-06-04 20:49:12] [INFO ] Added : 116 causal constraints over 24 iterations in 1601 ms. Result :sat
[2020-06-04 20:49:12] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 23 ms returned sat
[2020-06-04 20:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:12] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2020-06-04 20:49:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:49:12] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 39 ms returned sat
[2020-06-04 20:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:13] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2020-06-04 20:49:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 35 ms returned sat
[2020-06-04 20:49:13] [INFO ] Computed and/alt/rep : 967/11120/679 causal constraints in 85 ms.
[2020-06-04 20:49:14] [INFO ] Added : 94 causal constraints over 19 iterations in 1042 ms. Result :sat
Graph (trivial) has 101 edges and 139 vertex of which 30 / 139 are part of one of the 5 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 11 places
Drop transitions removed 34 transitions
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 322 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 0 with 358 rules applied. Total rules applied 359 place count 103 transition count 656
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 384 place count 78 transition count 656
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 384 place count 78 transition count 647
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 402 place count 69 transition count 647
Symmetric choice reduction at 2 with 5 rule applications. Total rules 407 place count 69 transition count 647
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 417 place count 64 transition count 642
Symmetric choice reduction at 2 with 1 rule applications. Total rules 418 place count 64 transition count 642
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 6 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 420 place count 63 transition count 636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 421 place count 63 transition count 635
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 425 place count 61 transition count 633
Symmetric choice reduction at 3 with 1 rule applications. Total rules 426 place count 61 transition count 633
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 6 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 428 place count 60 transition count 627
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 429 place count 60 transition count 626
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 431 place count 59 transition count 634
Free-agglomeration rule applied 9 times with reduction of 416 identical transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 440 place count 59 transition count 209
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 513 place count 50 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 514 place count 50 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 515 place count 50 transition count 144
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 517 place count 50 transition count 144
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 527 place count 50 transition count 134
Free-agglomeration rule applied 3 times with reduction of 16 identical transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 530 place count 50 transition count 115
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 545 place count 47 transition count 103
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 546 place count 47 transition count 103
Symmetric choice reduction at 7 with 1 rule applications. Total rules 547 place count 47 transition count 103
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 549 place count 46 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 550 place count 46 transition count 100
Applied a total of 550 rules in 136 ms. Remains 46 /139 variables (removed 93) and now considering 100/1003 (removed 903) transitions.
// Phase 1: matrix 100 rows 46 cols
[2020-06-04 20:49:14] [INFO ] Computed 15 place invariants in 1 ms
[2020-06-04 20:49:14] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 10 ms returned sat
[2020-06-04 20:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:14] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-06-04 20:49:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:49:14] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 18 ms returned sat
[2020-06-04 20:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:14] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-06-04 20:49:14] [INFO ] Computed and/alt/rep : 58/415/58 causal constraints in 11 ms.
[2020-06-04 20:49:14] [INFO ] Added : 8 causal constraints over 2 iterations in 85 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2020-06-04 20:49:14] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 9 ms returned sat
[2020-06-04 20:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:14] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-06-04 20:49:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:49:14] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 9 ms returned sat
[2020-06-04 20:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:14] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-06-04 20:49:14] [INFO ] Computed and/alt/rep : 58/415/58 causal constraints in 9 ms.
[2020-06-04 20:49:14] [INFO ] Added : 13 causal constraints over 3 iterations in 54 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2020-06-04 20:49:14] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2020-06-04 20:49:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 19 ms.
[2020-06-04 20:49:15] [INFO ] Flatten gal took : 364 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ CloudDeployment-PT-6a @ 3570 seconds

FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-6a-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityCardinality @ CloudDeployment-PT-6a

{
"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": "Thu Jun 4 20:49:16 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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 ((((p93 <= 0)) OR ((1 <= p9)) OR ((p76 <= 0)) OR ((1 <= p51)))))",
"processed_size": 72,
"rewrites": 2
},
"result":
{
"edges": 26339,
"markings": 13126,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 4,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((((p106 <= 0)) AND ((1 <= p78)) AND ((p105 <= 0)) AND (((p27 <= 0)) OR ((1 <= p116))))))",
"processed_size": 95,
"rewrites": 1
},
"result":
{
"edges": 38,
"markings": 39,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 35376,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 8589,
"conflict_clusters": 2,
"places": 139,
"places_significant": 113,
"singleton_clusters": 0,
"transitions": 1003
},
"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: 1142/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 139
lola: finding significant places
lola: 139 places, 1003 transitions, 113 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: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: E (F ((((p106 <= 0)) AND ((1 <= p78)) AND ((p105 <= 0)) AND (((p27 <= 0)) OR ((1 <= p116)))))) : A (G ((((p93 <= 0)) OR ((1 <= p9)) OR ((p76 <= 0)) OR ((1 <= p51)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p93 <= 0)) OR ((1 <= p9)) OR ((p76 <= 0)) OR ((1 <= p51)))))
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 ((((p93 <= 0)) OR ((1 <= p9)) OR ((p76 <= 0)) OR ((1 <= p51)))))
lola: processed formula length: 72
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 <= p93)) AND ((p9 <= 0)) AND ((1 <= p76)) AND ((p51 <= 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: error: :179: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13126 markings, 26339 edges
lola: ========================================
lola: subprocess 1 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p106 <= 0)) AND ((1 <= p78)) AND ((p105 <= 0)) AND (((p27 <= 0)) OR ((1 <= p116))))))
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 ((((p106 <= 0)) AND ((1 <= p78)) AND ((p105 <= 0)) AND (((p27 <= 0)) OR ((1 <= p116))))))
lola: processed formula length: 95
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: (((p106 <= 0)) AND ((1 <= p78)) AND ((p105 <= 0)) AND (((p27 <= 0)) OR ((1 <= p116))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no
lola:
preliminary result: yes no
lola: memory consumption: 35376 KB
lola: time consumption: 4 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="CloudDeployment-PT-6a"
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 CloudDeployment-PT-6a, 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 r168-smll-158987806600334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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