fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r168-smll-158987806700417
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for CloudOpsManagement-PT-00320by00160

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15794.480 3600000.00 337086.00 41453.20 TFTFF?TTTTTTFFFF normal

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-158987806700417.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 CloudOpsManagement-PT-00320by00160, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806700417
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.8K Mar 30 01:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 30 01:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 8 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 26 08:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 26 08:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 13 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 17K 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 CloudOpsManagement-PT-00320by00160-00
FORMULA_NAME CloudOpsManagement-PT-00320by00160-01
FORMULA_NAME CloudOpsManagement-PT-00320by00160-02
FORMULA_NAME CloudOpsManagement-PT-00320by00160-03
FORMULA_NAME CloudOpsManagement-PT-00320by00160-04
FORMULA_NAME CloudOpsManagement-PT-00320by00160-05
FORMULA_NAME CloudOpsManagement-PT-00320by00160-06
FORMULA_NAME CloudOpsManagement-PT-00320by00160-07
FORMULA_NAME CloudOpsManagement-PT-00320by00160-08
FORMULA_NAME CloudOpsManagement-PT-00320by00160-09
FORMULA_NAME CloudOpsManagement-PT-00320by00160-10
FORMULA_NAME CloudOpsManagement-PT-00320by00160-11
FORMULA_NAME CloudOpsManagement-PT-00320by00160-12
FORMULA_NAME CloudOpsManagement-PT-00320by00160-13
FORMULA_NAME CloudOpsManagement-PT-00320by00160-14
FORMULA_NAME CloudOpsManagement-PT-00320by00160-15

=== Now, execution of the tool begins

BK_START 1591345006148

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 08:16:48] [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-05 08:16:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 08:16:49] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2020-06-05 08:16:49] [INFO ] Transformed 27 places.
[2020-06-05 08:16:49] [INFO ] Transformed 29 transitions.
[2020-06-05 08:16:49] [INFO ] Parsed PT model containing 27 places and 29 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100178 steps, including 0 resets, run finished after 78 ms. (steps per millisecond=1284 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1]
// Phase 1: matrix 29 rows 27 cols
[2020-06-05 08:16:49] [INFO ] Computed 11 place invariants in 6 ms
[2020-06-05 08:16:49] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned unsat
[2020-06-05 08:16:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-06-05 08:16:49] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-06-05 08:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:49] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-05 08:16:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-05 08:16:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:49] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-05 08:16:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-05 08:16:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 08:16:49] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-06-05 08:16:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2020-06-05 08:16:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2020-06-05 08:16:49] [INFO ] Added : 26 causal constraints over 6 iterations in 47 ms. Result :sat
[2020-06-05 08:16:49] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 08:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:49] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-05 08:16:49] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 08:16:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 08:16:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 08:16:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:49] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2020-06-05 08:16:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2020-06-05 08:16:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 08:16:49] [INFO ] Added : 25 causal constraints over 6 iterations in 39 ms. Result :sat
[2020-06-05 08:16:49] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 08:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:49] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-05 08:16:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 08:16:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:49] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-05 08:16:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 08:16:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2020-06-05 08:16:49] [INFO ] Added : 25 causal constraints over 6 iterations in 48 ms. Result :sat
[2020-06-05 08:16:49] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 08:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-05 08:16:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 08:16:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 08:16:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 08:16:50] [INFO ] Added : 25 causal constraints over 6 iterations in 36 ms. Result :sat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-05 08:16:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 08:16:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 08:16:50] [INFO ] Added : 25 causal constraints over 6 iterations in 36 ms. Result :sat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-05 08:16:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 08:16:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 08:16:50] [INFO ] Added : 25 causal constraints over 6 iterations in 34 ms. Result :sat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-05 08:16:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 08:16:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2020-06-05 08:16:50] [INFO ] Added : 25 causal constraints over 5 iterations in 34 ms. Result :sat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 08:16:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 08:16:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 08:16:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 08:16:50] [INFO ] Added : 25 causal constraints over 6 iterations in 29 ms. Result :sat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-05 08:16:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 08:16:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 08:16:50] [INFO ] Added : 22 causal constraints over 5 iterations in 31 ms. Result :sat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-05 08:16:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 08:16:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 08:16:50] [INFO ] Added : 25 causal constraints over 6 iterations in 37 ms. Result :sat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 08:16:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 08:16:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:50] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 08:16:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 08:16:50] [INFO ] Added : 25 causal constraints over 6 iterations in 37 ms. Result :sat
[2020-06-05 08:16:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 08:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:51] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-05 08:16:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 08:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:51] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-05 08:16:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 08:16:51] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 08:16:51] [INFO ] Added : 25 causal constraints over 6 iterations in 43 ms. Result :sat
[2020-06-05 08:16:51] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 08:16:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-05 08:16:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 08:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:51] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-05 08:16:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 08:16:51] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 08:16:51] [INFO ] Added : 25 causal constraints over 6 iterations in 27 ms. Result :sat
[2020-06-05 08:16:51] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-06-05 08:16:51] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-06-05 08:16:51] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 08:16:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:51] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-05 08:16:51] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 08:16:51] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 08:16:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 08:16:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-05 08:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 08:16:51] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-05 08:16:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 08:16:51] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 08:16:51] [INFO ] Added : 25 causal constraints over 5 iterations in 36 ms. Result :sat
Successfully simplified 10 atomic propositions for a total of 10 simplifications.
[2020-06-05 08:16:51] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-05 08:16:51] [INFO ] Flatten gal took : 37 ms
FORMULA CloudOpsManagement-PT-00320by00160-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00320by00160-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00320by00160-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00320by00160-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00320by00160-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00320by00160-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00320by00160-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 08:16:51] [INFO ] Flatten gal took : 10 ms
[2020-06-05 08:16:51] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-05 08:16:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudOpsManagement-PT-00320by00160 @ 3570 seconds

FORMULA CloudOpsManagement-PT-00320by00160-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3156
rslt: Output for LTLCardinality @ CloudOpsManagement-PT-00320by00160

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 08:16:53 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((G (F ((p12 <= p6))) AND (((p21 <= 2) R (p15 + 1 <= p24)) AND (p10 + 1 <= p18))))",
"processed_size": 84,
"rewrites": 55
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"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": 482
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((X ((1 <= p25)) AND F ((1 <= p25))))",
"processed_size": 39,
"rewrites": 55
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"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": 562
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 562
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p21))",
"processed_size": 14,
"rewrites": 55
},
"result":
{
"edges": 965,
"markings": 965,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 674
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p20 <= p24)))",
"processed_size": 20,
"rewrites": 55
},
"result":
{
"edges": 3058,
"markings": 2731,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 843
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((p20 <= p24)))",
"processed_size": 20,
"rewrites": 55
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 674
},
"exit":
{
"localtimelimitreached": false
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p10 <= 1)",
"processed_size": 10,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 843
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((p0 + 1 <= p6))",
"processed_size": 18,
"rewrites": 55
},
"result":
{
"edges": 965,
"markings": 965,
"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": 1124
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p5 <= p7)))",
"processed_size": 18,
"rewrites": 55
},
"result":
{
"edges": 1278264,
"markings": 620174,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 843
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= p20)",
"processed_size": 10,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1124
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X ((1 <= p8))",
"processed_size": 13,
"rewrites": 55
},
"result":
{
"edges": 167,
"markings": 167,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1124
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((X (F ((3 <= p2))) AND (G ((3 <= p2)) OR (p2 <= 2)))))",
"processed_size": 60,
"rewrites": 55
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"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": 1686
},
"exit":
{
"localtimelimitreached": false
},
"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": "F (G ((p24 + 1 <= p12)))",
"processed_size": 24,
"rewrites": 55
},
"result":
{
"edges": 166,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 3373
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G ((F ((p10 <= p5)) AND ((2 <= p4) OR (p10 <= p5)))) OR (G ((2 <= p8)) AND F (G ((F ((p10 <= p5)) AND ((2 <= p4) OR (p10 <= p5))))))))",
"processed_size": 138,
"rewrites": 55
},
"result":
{
"edges": 2837,
"markings": 1582,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 24
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3416,
"runtime": 414.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(F(**)) AND ((* R *) AND **))) : F((G((F(**) AND (** OR **))) OR (G(**) AND F(G((F(**) AND (** OR **))))))) : F(G(*)) : X((G((G((G(*) AND *)) AND *)) OR *)) : F((X(**) AND F(**))) : (F(G(**)) OR (X(F(**)) OR G(**))) : ((X(F(*)) AND (G(*) OR **)) OR (G(F(**)) AND F((X(F(*)) AND (G(*) OR **))))) : (** OR X(**)) : X(F((X(F(**)) AND (G(**) OR **))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no no no unknown yes yes no no no ",
"value": "no no no unknown yes yes 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: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 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: X (((G (F ((p12 <= p6))) AND NOT(((3 <= p21) U (p24 <= p15)))) AND (p10 + 1 <= p18))) : F ((F ((3 <= p26)) U (G ((2 <= p8)) U G (((2 <= p4) U (p10 <= p5)))))) : G (X (X (F (G (X (NOT(X (F ((p12 <= p24)))))))))) : NOT(X ((F ((F ((F ((2 <= p2)) OR (p18 <= p13))) OR (p18 <= p13))) AND ((p22 <= p9) OR (p15 <= 0))))) : F ((X ((1 <= p25)) AND F ((1 <= p25)))) : ((F (G ((p20 <= p24))) OR F (X ((p20 <= p24)))) OR G ((1 <= p21))) : (G (X (F ((p5 <= p7)))) U (F (NOT(X ((p14 <= p25)))) AND (NOT(F ((p6 <= p0))) OR (p10 <= 1)))) : NOT(((1 <= 0) U (NOT(((1 <= 0) U (2 <= p20))) AND NOT(X ((1 <= p8)))))) : F (X (F ((X (F ((3 <= p2))) AND (G ((3 <= p2)) OR (p2 <= 2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:185
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F ((p12 <= p6))) AND (((p21 <= 2) R (p15 + 1 <= p24)) AND (p10 + 1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F ((p12 <= p6))) AND (((p21 <= 2) R (p15 + 1 <= p24)) AND (p10 + 1 <= p18))))
lola: processed formula length: 84
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 165 markings, 165 edges
lola: ========================================
lola: subprocess 1 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((G ((G ((p2 <= 1)) AND (p13 + 1 <= p18))) AND (p13 + 1 <= p18))) OR ((p9 + 1 <= p22) AND (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((G ((G ((p2 <= 1)) AND (p13 + 1 <= p18))) AND (p13 + 1 <= p18))) OR ((p9 + 1 <= p22) AND (1 <= p15))))
lola: processed formula length: 109
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 3449248 markings, 5204252 edges, 689850 markings/sec, 0 secs
lola: 7153041 markings, 10783077 edges, 740759 markings/sec, 5 secs
lola: 10763932 markings, 16221926 edges, 722178 markings/sec, 10 secs
lola: 14281268 markings, 21519913 edges, 703467 markings/sec, 15 secs
lola: 17796318 markings, 26814461 edges, 703010 markings/sec, 20 secs
lola: 21158230 markings, 31878334 edges, 672382 markings/sec, 25 secs
lola: 24494841 markings, 36904160 edges, 667322 markings/sec, 30 secs
lola: 27665368 markings, 41679707 edges, 634105 markings/sec, 35 secs
lola: 31090483 markings, 46838829 edges, 685023 markings/sec, 40 secs
lola: 34405168 markings, 51831616 edges, 662937 markings/sec, 45 secs
lola: 37724010 markings, 56830538 edges, 663768 markings/sec, 50 secs
lola: 40936828 markings, 61669811 edges, 642564 markings/sec, 55 secs
lola: 44211211 markings, 66601923 edges, 654877 markings/sec, 60 secs
lola: 47334609 markings, 71306522 edges, 624680 markings/sec, 65 secs
lola: 50489073 markings, 76057926 edges, 630893 markings/sec, 70 secs
lola: 53764607 markings, 80991670 edges, 655107 markings/sec, 75 secs
lola: 56907472 markings, 85725634 edges, 628573 markings/sec, 80 secs
lola: 59999748 markings, 90383368 edges, 618455 markings/sec, 85 secs
lola: 63253713 markings, 95284650 edges, 650793 markings/sec, 90 secs
lola: 66283149 markings, 99847753 edges, 605887 markings/sec, 95 secs
lola: 69429339 markings, 104586644 edges, 629238 markings/sec, 100 secs
lola: 72531446 markings, 109259243 edges, 620421 markings/sec, 105 secs
lola: 74704224 markings, 112532621 edges, 434556 markings/sec, 110 secs
lola: 75249404 markings, 113353775 edges, 109036 markings/sec, 115 secs
lola: 77259544 markings, 116387708 edges, 402028 markings/sec, 120 secs
lola: 78424678 markings, 118135916 edges, 233027 markings/sec, 125 secs
lola: 80050236 markings, 120584413 edges, 325112 markings/sec, 130 secs
lola: 81197095 markings, 122311818 edges, 229372 markings/sec, 135 secs
lola: 82221015 markings, 123854192 edges, 204784 markings/sec, 140 secs
lola: 83290263 markings, 125464694 edges, 213850 markings/sec, 145 secs
lola: 85257389 markings, 128427630 edges, 393425 markings/sec, 150 secs
lola: 86429264 markings, 130192803 edges, 234375 markings/sec, 155 secs
lola: 87578013 markings, 131923161 edges, 229750 markings/sec, 160 secs
lola: 89915922 markings, 135444551 edges, 467582 markings/sec, 165 secs
lola: 91246873 markings, 137449309 edges, 266190 markings/sec, 170 secs
lola: 91455219 markings, 137763134 edges, 41669 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((1 <= p25)) AND F ((1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((1 <= p25)) AND F ((1 <= p25))))
lola: processed formula length: 39
lola: 55 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p20 <= p24))) OR (X (F ((p20 <= p24))) OR G ((1 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p21))
lola: processed formula length: 14
lola: 55 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: 965 markings, 965 edges
lola: ========================================
lola: subprocess 4 will run for 674 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p20 <= p24)))
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 ((p20 <= p24)))
lola: processed formula length: 20
lola: 55 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: add low 25
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: 2731 markings, 3058 edges
lola: ========================================
lola: subprocess 5 will run for 843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p20 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p20 <= p24)))
lola: processed formula length: 20
lola: 55 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 674 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (F ((p25 + 1 <= p14))) AND (G ((p0 + 1 <= p6)) OR (p10 <= 1))) OR (G (F ((p5 <= p7))) AND F ((X (F ((p25 + 1 <= p14))) AND (G ((p0 + 1 <= p6)) OR (p10 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 674 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p10 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 <= 1)
lola: processed formula length: 10
lola: 55 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: subprocess 5 will run for 843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p0 + 1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p0 + 1 <= p6))
lola: processed formula length: 18
lola: 55 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: 965 markings, 965 edges
lola: ========================================
lola: subprocess 6 will run for 1124 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p5 <= p7)))
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 ((p5 <= p7)))
lola: processed formula length: 18
lola: 55 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: 620174 markings, 1278264 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p20) OR X ((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p20)
lola: processed formula length: 10
lola: 55 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: subprocess 6 will run for 1124 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p8))
lola: processed formula length: 13
lola: 55 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: 167 markings, 167 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 1124 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (F ((3 <= p2))) AND (G ((3 <= p2)) OR (p2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F ((3 <= p2))) AND (G ((3 <= p2)) OR (p2 <= 2)))))
lola: processed formula length: 60
lola: 55 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: 165 markings, 165 edges
lola: ========================================
lola: subprocess 7 will run for 1686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p24 + 1 <= p12)))
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 ((p24 + 1 <= p12)))
lola: processed formula length: 24
lola: 55 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: add low 24
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: 165 markings, 166 edges
lola: ========================================
lola: subprocess 8 will run for 3373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((p10 <= p5)) AND ((2 <= p4) OR (p10 <= p5)))) OR (G ((2 <= p8)) AND F (G ((F ((p10 <= p5)) AND ((2 <= p4) OR (p10 <= p5))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((p10 <= p5)) AND ((2 <= p4) OR (p10 <= p5)))) OR (G ((2 <= p8)) AND F (G ((F ((p10 <= p5)) AND ((2 <= p4) OR (p10 <= p5))))))))
lola: processed formula length: 138
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 24 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: 1582 markings, 2837 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G ((G ((G ((p2 <= 1)) AND (p13 + 1 <= p18))) AND (p13 + 1 <= p18))) OR ((p9 + 1 <= p22) AND (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((G ((G ((p2 <= 1)) AND (p13 + 1 <= p18))) AND (p13 + 1 <= p18))) OR ((p9 + 1 <= p22) AND (1 <= p15))))
lola: processed formula length: 109
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 3613711 markings, 5451963 edges, 722742 markings/sec, 0 secs
lola: 7282541 markings, 10978112 edges, 733766 markings/sec, 5 secs
lola: 10828574 markings, 16319388 edges, 709207 markings/sec, 10 secs
lola: 14270670 markings, 21503962 edges, 688419 markings/sec, 15 secs
lola: 17467497 markings, 26319182 edges, 639365 markings/sec, 20 secs
lola: 20846562 markings, 31408899 edges, 675813 markings/sec, 25 secs
lola: 24149014 markings, 36383200 edges, 660490 markings/sec, 30 secs
lola: 27305851 markings, 41138228 edges, 631367 markings/sec, 35 secs
lola: 30725058 markings, 46288443 edges, 683841 markings/sec, 40 secs
lola: 33874688 markings, 51032580 edges, 629926 markings/sec, 45 secs
lola: 37262810 markings, 56135875 edges, 677624 markings/sec, 50 secs
lola: 40466044 markings, 60960689 edges, 640647 markings/sec, 55 secs
lola: 43781176 markings, 65954115 edges, 663026 markings/sec, 60 secs
lola: 46926546 markings, 70691808 edges, 629074 markings/sec, 65 secs
lola: 50121995 markings, 75505019 edges, 639090 markings/sec, 70 secs
lola: 53393255 markings, 80432321 edges, 654252 markings/sec, 75 secs
lola: 56616999 markings, 85288124 edges, 644749 markings/sec, 80 secs
lola: 59709265 markings, 89945868 edges, 618453 markings/sec, 85 secs
lola: 63000175 markings, 94902743 edges, 658182 markings/sec, 90 secs
lola: 66093883 markings, 99562665 edges, 618742 markings/sec, 95 secs
lola: 69245368 markings, 104309571 edges, 630297 markings/sec, 100 secs
lola: 72227087 markings, 108800732 edges, 596344 markings/sec, 105 secs
lola: 74901531 markings, 112830498 edges, 534889 markings/sec, 110 secs
lola: 76473642 markings, 115197187 edges, 314422 markings/sec, 115 secs
lola: 78984016 markings, 118980821 edges, 502075 markings/sec, 120 secs
lola: 81530397 markings, 122813873 edges, 509276 markings/sec, 125 secs
lola: 81678997 markings, 123037731 edges, 29720 markings/sec, 130 secs
lola: 83415537 markings, 125653390 edges, 347308 markings/sec, 135 secs
lola: 84905575 markings, 127897742 edges, 298008 markings/sec, 140 secs
lola: 85192192 markings, 128329424 edges, 57323 markings/sec, 145 secs
lola: 87707233 markings, 132117697 edges, 503008 markings/sec, 150 secs
lola: 87707233 markings, 132117697 edges, 0 markings/sec, 155 secs
lola: 90158344 markings, 135809764 edges, 490222 markings/sec, 160 secs
lola: 90257203 markings, 135958699 edges, 19772 markings/sec, 165 secs
lola: 91613263 markings, 138001194 edges, 271212 markings/sec, 170 secs
lola: 91616974 markings, 138006832 edges, 742 markings/sec, 175 secs
lola: 91617053 markings, 138006964 edges, 16 markings/sec, 180 secs
lola: 91617154 markings, 138007064 edges, 20 markings/sec, 185 secs
lola: 91617213 markings, 138007153 edges, 12 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no unknown yes yes no no no
lola:
preliminary result: no no no unknown yes yes no no no
lola: memory consumption: 3416 KB
lola: time consumption: 414 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="CloudOpsManagement-PT-00320by00160"
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 CloudOpsManagement-PT-00320by00160, 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 r168-smll-158987806700417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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