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.r186-oct2-158987939300617.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 SimpleLoadBal-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987939300617
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 4.5K Apr 12 17:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 17:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 20:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 20:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 14 12:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 30 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 14 12:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 30 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 05:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 05:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 24 05:38 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 SimpleLoadBal-PT-15-00
FORMULA_NAME SimpleLoadBal-PT-15-01
FORMULA_NAME SimpleLoadBal-PT-15-02
FORMULA_NAME SimpleLoadBal-PT-15-03
FORMULA_NAME SimpleLoadBal-PT-15-04
FORMULA_NAME SimpleLoadBal-PT-15-05
FORMULA_NAME SimpleLoadBal-PT-15-06
FORMULA_NAME SimpleLoadBal-PT-15-07
FORMULA_NAME SimpleLoadBal-PT-15-08
FORMULA_NAME SimpleLoadBal-PT-15-09
FORMULA_NAME SimpleLoadBal-PT-15-10
FORMULA_NAME SimpleLoadBal-PT-15-11
FORMULA_NAME SimpleLoadBal-PT-15-12
FORMULA_NAME SimpleLoadBal-PT-15-13
FORMULA_NAME SimpleLoadBal-PT-15-14
FORMULA_NAME SimpleLoadBal-PT-15-15

=== Now, execution of the tool begins

BK_START 1591255203342

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 07:20:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 07:20:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 07:20:05] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2020-06-04 07:20:05] [INFO ] Transformed 149 places.
[2020-06-04 07:20:05] [INFO ] Transformed 1280 transitions.
[2020-06-04 07:20:05] [INFO ] Parsed PT model containing 149 places and 1280 transitions in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 600 ms. (steps per millisecond=166 ) properties seen :[1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1]
[2020-06-04 07:20:06] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 149 cols
[2020-06-04 07:20:06] [INFO ] Computed 39 place invariants in 38 ms
[2020-06-04 07:20:06] [INFO ] [Real]Absence check using 35 positive place invariants in 23 ms returned sat
[2020-06-04 07:20:06] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-04 07:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:20:06] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2020-06-04 07:20:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:20:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2020-06-04 07:20:06] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 07:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:20:07] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2020-06-04 07:20:07] [INFO ] State equation strengthened by 481 read => feed constraints.
[2020-06-04 07:20:07] [INFO ] [Nat]Added 481 Read/Feed constraints in 177 ms returned sat
[2020-06-04 07:20:07] [INFO ] Deduced a trap composed of 20 places in 195 ms
[2020-06-04 07:20:07] [INFO ] Deduced a trap composed of 24 places in 149 ms
[2020-06-04 07:20:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2020-06-04 07:20:08] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 262 ms.
[2020-06-04 07:20:26] [INFO ] Added : 355 causal constraints over 71 iterations in 19063 ms. Result :unknown
[2020-06-04 07:20:26] [INFO ] [Real]Absence check using 35 positive place invariants in 36 ms returned sat
[2020-06-04 07:20:26] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 07:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:20:27] [INFO ] [Real]Absence check using state equation in 820 ms returned sat
[2020-06-04 07:20:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:20:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 141 ms returned sat
[2020-06-04 07:20:28] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 9 ms returned sat
[2020-06-04 07:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:20:28] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2020-06-04 07:20:28] [INFO ] [Nat]Added 481 Read/Feed constraints in 169 ms returned sat
[2020-06-04 07:20:29] [INFO ] Deduced a trap composed of 26 places in 283 ms
[2020-06-04 07:20:29] [INFO ] Deduced a trap composed of 24 places in 883 ms
[2020-06-04 07:20:31] [INFO ] Deduced a trap composed of 21 places in 1318 ms
[2020-06-04 07:20:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2659 ms
[2020-06-04 07:20:31] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 96 ms.
[2020-06-04 07:20:47] [INFO ] Added : 365 causal constraints over 73 iterations in 16475 ms. Result :(error "Failed to check-sat")
[2020-06-04 07:20:47] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2020-06-04 07:20:47] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 6 ms returned sat
[2020-06-04 07:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:20:48] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2020-06-04 07:20:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:20:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 60 ms returned sat
[2020-06-04 07:20:48] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-04 07:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:20:48] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2020-06-04 07:20:48] [INFO ] [Nat]Added 481 Read/Feed constraints in 151 ms returned sat
[2020-06-04 07:20:49] [INFO ] Deduced a trap composed of 19 places in 422 ms
[2020-06-04 07:20:49] [INFO ] Deduced a trap composed of 18 places in 149 ms
[2020-06-04 07:20:49] [INFO ] Deduced a trap composed of 78 places in 138 ms
[2020-06-04 07:20:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 816 ms
[2020-06-04 07:20:49] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 164 ms.
[2020-06-04 07:21:08] [INFO ] Added : 365 causal constraints over 73 iterations in 18617 ms. Result :unknown
[2020-06-04 07:21:08] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned unsat
[2020-06-04 07:21:08] [INFO ] [Real]Absence check using 35 positive place invariants in 27 ms returned unsat
[2020-06-04 07:21:08] [INFO ] [Real]Absence check using 35 positive place invariants in 106 ms returned sat
[2020-06-04 07:21:08] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 27 ms returned unsat
[2020-06-04 07:21:08] [INFO ] [Real]Absence check using 35 positive place invariants in 74 ms returned sat
[2020-06-04 07:21:08] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 10 ms returned sat
[2020-06-04 07:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:09] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2020-06-04 07:21:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:21:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2020-06-04 07:21:09] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-04 07:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:10] [INFO ] [Nat]Absence check using state equation in 1165 ms returned sat
[2020-06-04 07:21:11] [INFO ] [Nat]Added 481 Read/Feed constraints in 185 ms returned sat
[2020-06-04 07:21:11] [INFO ] Deduced a trap composed of 25 places in 466 ms
[2020-06-04 07:21:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 526 ms
[2020-06-04 07:21:11] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 219 ms.
[2020-06-04 07:21:29] [INFO ] Added : 325 causal constraints over 65 iterations in 18141 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 07:21:29] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned unsat
[2020-06-04 07:21:29] [INFO ] [Real]Absence check using 35 positive place invariants in 108 ms returned sat
[2020-06-04 07:21:29] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 10 ms returned sat
[2020-06-04 07:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:31] [INFO ] [Real]Absence check using state equation in 1010 ms returned sat
[2020-06-04 07:21:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:21:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 220 ms returned sat
[2020-06-04 07:21:31] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 36 ms returned sat
[2020-06-04 07:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:31] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2020-06-04 07:21:31] [INFO ] [Nat]Added 481 Read/Feed constraints in 157 ms returned sat
[2020-06-04 07:21:32] [INFO ] Deduced a trap composed of 25 places in 751 ms
[2020-06-04 07:21:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 836 ms
[2020-06-04 07:21:32] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 312 ms.
[2020-06-04 07:21:51] [INFO ] Added : 330 causal constraints over 66 iterations in 18401 ms. Result :unknown
[2020-06-04 07:21:51] [INFO ] [Real]Absence check using 35 positive place invariants in 195 ms returned unsat
[2020-06-04 07:21:51] [INFO ] [Real]Absence check using 35 positive place invariants in 2 ms returned unsat
[2020-06-04 07:21:51] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2020-06-04 07:21:51] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-06-04 07:21:51] [INFO ] [Real]Absence check using 35 positive place invariants in 30 ms returned unsat
[2020-06-04 07:21:51] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned unsat
[2020-06-04 07:21:51] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2020-06-04 07:21:51] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 6 ms returned unsat
[2020-06-04 07:21:51] [INFO ] [Real]Absence check using 35 positive place invariants in 36 ms returned sat
[2020-06-04 07:21:51] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-04 07:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:52] [INFO ] [Real]Absence check using state equation in 1333 ms returned sat
[2020-06-04 07:21:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:21:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 146 ms returned sat
[2020-06-04 07:21:53] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 29 ms returned sat
[2020-06-04 07:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:53] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2020-06-04 07:21:53] [INFO ] [Nat]Added 481 Read/Feed constraints in 184 ms returned sat
[2020-06-04 07:21:54] [INFO ] Deduced a trap composed of 21 places in 348 ms
[2020-06-04 07:21:55] [INFO ] Deduced a trap composed of 21 places in 1741 ms
[2020-06-04 07:21:56] [INFO ] Deduced a trap composed of 20 places in 148 ms
[2020-06-04 07:21:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2464 ms
[2020-06-04 07:21:56] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 125 ms.
[2020-06-04 07:22:13] [INFO ] Added : 340 causal constraints over 68 iterations in 16883 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 07:22:13] [INFO ] [Real]Absence check using 35 positive place invariants in 68 ms returned unsat
[2020-06-04 07:22:13] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned unsat
[2020-06-04 07:22:13] [INFO ] [Real]Absence check using 35 positive place invariants in 104 ms returned unsat
[2020-06-04 07:22:13] [INFO ] [Real]Absence check using 35 positive place invariants in 117 ms returned unsat
[2020-06-04 07:22:13] [INFO ] [Real]Absence check using 35 positive place invariants in 221 ms returned sat
[2020-06-04 07:22:13] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 27 ms returned sat
[2020-06-04 07:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:13] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2020-06-04 07:22:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:22:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 236 ms returned sat
[2020-06-04 07:22:14] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 12 ms returned sat
[2020-06-04 07:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:14] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2020-06-04 07:22:14] [INFO ] [Nat]Added 481 Read/Feed constraints in 132 ms returned sat
[2020-06-04 07:22:15] [INFO ] Deduced a trap composed of 19 places in 433 ms
[2020-06-04 07:22:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 480 ms
[2020-06-04 07:22:15] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 106 ms.
[2020-06-04 07:22:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t383 0) (and (and (> t69 0) (< o69 o383)) (or (and (> t83 0) (< o83 o383)) (and (> t98 0) (< o98 o383)) (and (> t113 0) (< o113 o383)) (and (> t128 0) (< o128 o383)) (and (> t143 0) (< o143 o383)) (and (> t158 0) (< o158 o383)) (and (> t173 0) (< o173 o383)) (and (> t188 0) (< o188 o383)) (and (> t203 0) (< o203 o383)) (and (> t218 0) (< o218 o383)) (and (> t233 0) (< o233 o383)) (and (> t248 0) (< o248 o383)) (and (> t263 0) (< o263 o383)) (and (> t278 0) (< o278 o383)) (and (> t293 0) (< o293 o383)) (and (> t534 0) (< o534 o383)) (and (> t620 0) (< o620 o383)) (and (> t621 0) (< o621 o383)) (and (> t622 0) (< o622 o383)) (and (> t623 0) (< o623 o383)) (and (> t624 0) (< o624 o383)) (and (> t625 0) (< o625 o383)) (and (> t626 0) (< o626 o383)) (and (> t627 0) (< o627 o383)) (and (> t628 0) (< o628 o383)) (and (> t629 0) (< o629 o383)) (and (> t630 0) (< o630 o383)) (and (> t631 0) (< o631 o383)) (and (> t632 0) (< o632 o383)) (and (> t633 0) (< o633 o383)) (and (> t634 0) (< o634 o383)) (and (> t830 0) (< o830 o383)) (and (> t831 0) (< o831 o383)) (and (> t832 0) (< o832 o383)) (and (> t833 0) (< o833 o383)) (and (> t834 0) (< o834 o383)) (and (> t835 0) (< o835 o383)) (and (> t836 0) (< o836 o383)) (and (> t837 0) (< o837 o383)) (and (> t838 0) (< o838 o383)) (and (> t839 0) (< o839 o383)) (and (> t840 0) (< o840 o383)) (and (> t841 0) (< o841 o383)) (and (> t842 0) (< o842 o383)) (and (> t843 0) (< o843 o383)) (and (> t844 0) (< o844 o383)) (and (> t985 0) (< o985 o383))) (or (and (> t307 0) (< o307 o383)) (and (> t322 0) (< o322 o383)) (and (> t337 0) (< o337 o383)) (and (> t352 0) (< o352 o383)) (and (> t367 0) (< o367 o383)) (and (> t382 0) (< o382 o383)) (and (> t397 0) (< o397 o383)) (and (> t412 0) (< o412 o383)) (and (> t427 0) (< o427 o383)) (and (> t442 0) (< o442 o383)) (and (> t457 0) (< o457 o383)) (and (> t472 0) (< o472 o383)) (and (> t487 0) (< o487 o383)) (and (> t502 0) (< o502 o383)) (and (> t517 0) (< o517 o383)) (and (> t548 0) (< o548 o383)) (and (> t605 0) (< o605 o383)) (and (> t606 0) (< o606 o383)) (and (> t607 0) (< o607 o383)) (and (> t608 0) (< o608 o383)) (and (> t609 0) (< o609 o383)) (and (> t610 0) (< o610 o383)) (and (> t611 0) (< o611 o383)) (and (> t612 0) (< o612 o383)) (and (> t613 0) (< o613 o383)) (and (> t614 0) (< o614 o383)) (and (> t615 0) (< o615 o383)) (and (> t616 0) (< o616 o383)) (and (> t617 0) (< o617 o383)) (and (> t618 0) (< o618 o383)) (and (> t619 0) (< o619 o383)) (and (> t815 0) (< o815 o383)) (and (> t816 0) (< o816 o383)) (and (> t817 0) (< o817 o383)) (and (> t818 0) (< o818 o383)) (and (> t819 0) (< o819 o383)) (and (> t820 0) (< o820 o383)) (and (> t821 0) (< o821 o383)) (and (> t822 0) (< o822 o383)) (and (> t823 0) (< o823 o383)) (and (> t824 0) (< o824 o383)) (and (> t825 0) (< o825 o383)) (and (> t826 0) (< o826 o383)) (and (> t827 0) (< o827 o383)) (and (> t828 0) (< o828 o383)) (and (> t829 0) (< o829 o383)) (and (> t999 0) (< o999 o383)))))") while checking expression at index 20
Successfully simplified 14 atomic propositions for a total of 17 simplifications.
[2020-06-04 07:22:34] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 07:22:34] [INFO ] Flatten gal took : 328 ms
FORMULA SimpleLoadBal-PT-15-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 07:22:34] [INFO ] Flatten gal took : 236 ms
[2020-06-04 07:22:35] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 19 ms.
[2020-06-04 07:22:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 26 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SimpleLoadBal-PT-15 @ 3570 seconds

FORMULA SimpleLoadBal-PT-15-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLCardinality @ SimpleLoadBal-PT-15

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 07:22:35 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"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": "((p145 <= p135))",
"processed_size": 16,
"rewrites": 35
},
"result":
{
"edges": 32,
"markings": 32,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 254
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((p114 + 1 <= p6) R X ((p135 + 1 <= p145))) AND (p135 + 1 <= p145)))",
"processed_size": 72,
"rewrites": 33
},
"result":
{
"edges": 170,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "X (((p72 + 1 <= p147) AND (p139 <= p22)))",
"processed_size": 41,
"rewrites": 33
},
"result":
{
"edges": 170,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "X (F (((p72 + 1 <= p147) AND (p139 <= p22))))",
"processed_size": 45,
"rewrites": 33
},
"result":
{
"edges": 170,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((F (((p76 + 1 <= p103) AND (p4 + 1 <= p15))) OR (p40 <= p15)))",
"processed_size": 65,
"rewrites": 33
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p105)))",
"processed_size": 19,
"rewrites": 33
},
"result":
{
"edges": 123,
"markings": 122,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "G ((p36 <= p111))",
"processed_size": 17,
"rewrites": 33
},
"result":
{
"edges": 84,
"markings": 84,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "G ((p113 <= p62))",
"processed_size": 17,
"rewrites": 33
},
"result":
{
"edges": 298,
"markings": 292,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "G ((p82 <= p138))",
"processed_size": 17,
"rewrites": 33
},
"result":
{
"edges": 3683,
"markings": 3006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p10 <= p127)",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p10 <= p127)",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "G (F ((p127 + 1 <= p10)))",
"processed_size": 25,
"rewrites": 33
},
"result":
{
"edges": 159,
"markings": 159,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 41196,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(**) : (F(*) OR X(((* R X(*)) AND *))) : (X(**) OR (X(F(**)) AND F(G((X(F(**)) AND **))))) : G(**) : F(G(**)) : X((F((* AND *)) OR **)) : G(**) : (G(F(*)) OR **)"
},
"net":
{
"arcs": 8988,
"conflict_clusters": 35,
"places": 149,
"places_significant": 110,
"singleton_clusters": 0,
"transitions": 1280
},
"result":
{
"preliminary_value": "no no no no no no no no ",
"value": "no no no no no no no 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: 1429/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 149
lola: finding significant places
lola: 149 places, 1280 transitions, 110 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 LTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: G ((p36 <= p111)) : (NOT(G (((p145 <= p135)))) OR NOT(X ((((p6 <= p114) U X ((p145 <= p135))) OR (p145 <= p135))))) : (G (F (G ((F (X ((p139 <= p22))) AND (p75 <= p119))))) U X (((p72 + 1 <= p147) AND (p139 <= p22)))) : G (((1 <= 0) U (p113 <= p62))) : NOT(X (G (NOT(G (((1 <= 0) U (1 <= p105))))))) : (X (NOT(G ((((1 <= 0) U (p103 <= p76)) OR (p15 <= p4))))) OR X ((p40 <= p15))) : G ((p82 <= p138)) : (X (G (NOT(G ((p10 <= p127))))) OR (p10 <= p127))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p135 + 1 <= p145))) OR X ((((p114 + 1 <= p6) R X ((p135 + 1 <= p145))) AND (p135 + 1 <= p145))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p135 + 1 <= p145)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((p145 <= p135))
lola: processed formula length: 16
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 32 markings, 32 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p114 + 1 <= p6) R X ((p135 + 1 <= p145))) AND (p135 + 1 <= p145)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p114 + 1 <= p6) R X ((p135 + 1 <= p145))) AND (p135 + 1 <= p145)))
lola: processed formula length: 72
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 170 markings, 170 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p72 + 1 <= p147) AND (p139 <= p22))) OR (X (F (((p72 + 1 <= p147) AND (p139 <= p22)))) AND F (G ((X (F ((p139 <= p22))) AND (p75 <= p119))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p72 + 1 <= p147) AND (p139 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p72 + 1 <= p147) AND (p139 <= p22)))
lola: processed formula length: 41
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 170 markings, 170 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p72 + 1 <= p147) AND (p139 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p72 + 1 <= p147) AND (p139 <= p22))))
lola: processed formula length: 45
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 170 markings, 170 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p76 + 1 <= p103) AND (p4 + 1 <= p15))) OR (p40 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p76 + 1 <= p103) AND (p4 + 1 <= p15))) OR (p40 <= p15)))
lola: processed formula length: 65
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 169 markings, 169 edges
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p105)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p105)))
lola: processed formula length: 19
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 122 markings, 123 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p36 <= p111))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p36 <= p111))
lola: processed formula length: 17
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 84 markings, 84 edges
lola: ========================================
lola: subprocess 5 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p113 <= p62))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p113 <= p62))
lola: processed formula length: 17
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 292 markings, 298 edges
lola: ========================================
lola: subprocess 6 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p82 <= p138))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p82 <= p138))
lola: processed formula length: 17
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3006 markings, 3683 edges
lola: ========================================
lola: subprocess 7 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p127 + 1 <= p10))) OR (p10 <= p127))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p10 <= p127)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 <= p127)
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((p127 + 1 <= p10))) OR (p10 <= p127))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p10 <= p127)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 <= p127)
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((p127 + 1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p127 + 1 <= p10)))
lola: processed formula length: 25
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 159 markings, 159 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no
lola:
preliminary result: no no no no no no no no
lola: memory consumption: 41196 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="SimpleLoadBal-PT-15"
export BK_EXAMINATION="LTLCardinality"
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 SimpleLoadBal-PT-15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987939300617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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