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-158987806700401.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-00080by00040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806700401
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 4.1K Mar 30 01:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 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 4.2K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 27 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 26 08:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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.0K 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 16K 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-00080by00040-00
FORMULA_NAME CloudOpsManagement-PT-00080by00040-01
FORMULA_NAME CloudOpsManagement-PT-00080by00040-02
FORMULA_NAME CloudOpsManagement-PT-00080by00040-03
FORMULA_NAME CloudOpsManagement-PT-00080by00040-04
FORMULA_NAME CloudOpsManagement-PT-00080by00040-05
FORMULA_NAME CloudOpsManagement-PT-00080by00040-06
FORMULA_NAME CloudOpsManagement-PT-00080by00040-07
FORMULA_NAME CloudOpsManagement-PT-00080by00040-08
FORMULA_NAME CloudOpsManagement-PT-00080by00040-09
FORMULA_NAME CloudOpsManagement-PT-00080by00040-10
FORMULA_NAME CloudOpsManagement-PT-00080by00040-11
FORMULA_NAME CloudOpsManagement-PT-00080by00040-12
FORMULA_NAME CloudOpsManagement-PT-00080by00040-13
FORMULA_NAME CloudOpsManagement-PT-00080by00040-14
FORMULA_NAME CloudOpsManagement-PT-00080by00040-15

=== Now, execution of the tool begins

BK_START 1591334073417

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

FORMULA CloudOpsManagement-PT-00080by00040-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3042
rslt: Output for LTLCardinality @ CloudOpsManagement-PT-00080by00040

{
"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 05:14:39 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F (G ((F ((p8 <= 1)) OR (3 <= p26)))) OR (p8 <= 1)))",
"processed_size": 56,
"rewrites": 51
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 667
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"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": "X (X (X (X (G ((p1 + 1 <= p10))))))",
"processed_size": 35,
"rewrites": 51
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 834
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((G ((G ((p1 <= p7)) OR (p18 <= p26))) AND F (((p20 <= p24) AND (1 <= p25)))))",
"processed_size": 80,
"rewrites": 51
},
"result":
{
"edges": 21708282,
"markings": 14235052,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"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": 1105
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F (G ((p22 <= p9))) AND G (((X ((p22 <= 2)) R (p9 + 1 <= p22)) OR G ((p22 <= p9))))))",
"processed_size": 89,
"rewrites": 51
},
"result":
{
"edges": 40000847,
"markings": 26230589,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 4,
"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": 1636
},
"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 ((p25 + 1 <= p14)))",
"processed_size": 24,
"rewrites": 51
},
"result":
{
"edges": 45,
"markings": 45,
"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": "fairness",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3273
},
"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 ((p18 <= p20))",
"processed_size": 16,
"rewrites": 51
},
"result":
{
"edges": 774,
"markings": 689,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"child":
[

{
"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 ((p18 <= p20))",
"processed_size": 16,
"rewrites": 51
},
"result":
{
"edges": 774,
"markings": 689,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"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": 51
},
"result":
{
"edges": 46,
"markings": 45,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3520,
"runtime": 528.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((F(G((F(*) OR **))) OR **)) : (F(G(*)) OR G(**)) : (X(X(F(**))) U G((G(**) AND **))) : X(X(X(X(G(*))))) : X((G((G(**) OR **)) AND F(**))) : G(F(**)) : X((F(G(*)) AND G(((X(*) R *) OR G(*)))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "yes no unknown no no no no ",
"value": "yes no unknown 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: 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 ((X (G (F (X (G ((NOT(G ((2 <= p8))) OR (3 <= p26))))))) OR (p8 <= 1))) : (F (((p18 <= p20) U F (NOT(F ((p12 <= p24)))))) OR G ((p18 <= p20))) : (F (X (F (X ((p9 + 1 <= p22))))) U G ((G (((p22 <= p9))) AND (p22 <= p9)))) : X (NOT(F (X (X ((X (((0 <= 0) U (0 <= 0))) U F (X ((p10 <= p1))))))))) : (G (X ((G ((p1 <= p7)) OR (p18 <= p26)))) AND F (X (((p20 <= p24) AND (1 <= p25))))) : NOT(F (NOT(F ((p25 + 1 <= p14))))) : G ((NOT(X ((X ((3 <= p22)) U (p22 <= p9)))) U G (NOT(X ((p9 + 1 <= p22))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((F ((p8 <= 1)) OR (3 <= p26)))) OR (p8 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((F ((p8 <= 1)) OR (3 <= p26)))) OR (p8 <= 1)))
lola: processed formula length: 56
lola: 51 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: 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 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((p9 + 1 <= p22)))) U G ((G (((p22 <= p9))) AND (p22 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (F ((p9 + 1 <= p22)))) U G ((G (((p22 <= p9))) AND (p22 <= p9))))
lola: processed formula length: 71
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 3569889 markings, 5444439 edges, 713978 markings/sec, 0 secs
lola: 7132183 markings, 10876772 edges, 712459 markings/sec, 5 secs
lola: 10440256 markings, 15921409 edges, 661615 markings/sec, 10 secs
lola: 13645478 markings, 20809196 edges, 641044 markings/sec, 15 secs
lola: 16779496 markings, 25588414 edges, 626804 markings/sec, 20 secs
lola: 19865000 markings, 30293655 edges, 617101 markings/sec, 25 secs
lola: 22983741 markings, 35049566 edges, 623748 markings/sec, 30 secs
lola: 26108534 markings, 39814730 edges, 624959 markings/sec, 35 secs
lola: 29659927 markings, 45239963 edges, 710279 markings/sec, 40 secs
lola: 33218955 markings, 50690209 edges, 711806 markings/sec, 45 secs
lola: 36622389 markings, 55954469 edges, 680687 markings/sec, 50 secs
lola: 40027071 markings, 61220645 edges, 680936 markings/sec, 55 secs
lola: 43415537 markings, 66461777 edges, 677693 markings/sec, 60 secs
lola: 46773715 markings, 71653598 edges, 671636 markings/sec, 65 secs
lola: 50074049 markings, 76822472 edges, 660067 markings/sec, 70 secs
lola: 53177613 markings, 81608703 edges, 620713 markings/sec, 75 secs
lola: 56394427 markings, 86576277 edges, 643363 markings/sec, 80 secs
lola: 59565172 markings, 91473228 edges, 634149 markings/sec, 85 secs
lola: 62709341 markings, 96328082 edges, 628834 markings/sec, 90 secs
lola: 65842706 markings, 101162280 edges, 626673 markings/sec, 95 secs
lola: 68934801 markings, 105938839 edges, 618419 markings/sec, 100 secs
lola: 72032443 markings, 110716382 edges, 619528 markings/sec, 105 secs
lola: 75196348 markings, 115603845 edges, 632781 markings/sec, 110 secs
lola: 76597881 markings, 117759554 edges, 280307 markings/sec, 115 secs
lola: 78929550 markings, 121387748 edges, 466334 markings/sec, 120 secs
lola: 81054936 markings, 124637359 edges, 425077 markings/sec, 125 secs
lola: 83408179 markings, 128270707 edges, 470649 markings/sec, 130 secs
lola: 83579469 markings, 128531949 edges, 34258 markings/sec, 135 secs
lola: 83736686 markings, 128773015 edges, 31443 markings/sec, 140 secs
lola: 84785682 markings, 130395276 edges, 209799 markings/sec, 145 secs
lola: 87327131 markings, 134316620 edges, 508290 markings/sec, 150 secs
lola: 89578057 markings, 137792180 edges, 450185 markings/sec, 155 secs
lola: 89829615 markings, 138183859 edges, 50312 markings/sec, 160 secs
lola: 91259664 markings, 140388818 edges, 286010 markings/sec, 165 secs
lola: 91401924 markings, 140611496 edges, 28452 markings/sec, 170 secs
lola: 93045067 markings, 143148855 edges, 328629 markings/sec, 175 secs
lola: 93724921 markings, 144199934 edges, 135971 markings/sec, 180 secs
lola: 93724921 markings, 144199934 edges, 0 markings/sec, 185 secs
lola: 94041707 markings, 144687772 edges, 63357 markings/sec, 190 secs
lola: 94045792 markings, 144694010 edges, 817 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (G ((p1 + 1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (G ((p1 + 1 <= p10))))))
lola: processed formula length: 35
lola: 51 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: 45 markings, 45 edges
lola: ========================================
lola: subprocess 3 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((G ((p1 <= p7)) OR (p18 <= p26))) AND F (((p20 <= p24) AND (1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((G ((p1 <= p7)) OR (p18 <= p26))) AND F (((p20 <= p24) AND (1 <= p25)))))
lola: processed formula length: 80
lola: 51 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: 3467373 markings, 5288113 edges, 693475 markings/sec, 0 secs
lola: 6883405 markings, 10497394 edges, 683206 markings/sec, 5 secs
lola: 10116811 markings, 15428187 edges, 646681 markings/sec, 10 secs
lola: 13019975 markings, 19855362 edges, 580633 markings/sec, 15 secs
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: 14235052 markings, 21708282 edges
lola: ========================================
lola: subprocess 4 will run for 1105 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((p22 <= p9))) AND G (((X ((p22 <= 2)) R (p9 + 1 <= p22)) OR G ((p22 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((p22 <= p9))) AND G (((X ((p22 <= 2)) R (p9 + 1 <= p22)) OR G ((p22 <= p9))))))
lola: processed formula length: 89
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 3473398 markings, 5297306 edges, 694680 markings/sec, 0 secs
lola: 7105112 markings, 10835481 edges, 726343 markings/sec, 5 secs
lola: 10501240 markings, 16014400 edges, 679226 markings/sec, 10 secs
lola: 13765223 markings, 20991811 edges, 652797 markings/sec, 15 secs
lola: 16968514 markings, 25876658 edges, 640658 markings/sec, 20 secs
lola: 20067194 markings, 30601996 edges, 619736 markings/sec, 25 secs
lola: 23286349 markings, 35511051 edges, 643831 markings/sec, 30 secs
lola: 26230589 markings, 40000847 edges, 588848 markings/sec, 35 secs
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: 26230589 markings, 40000847 edges
lola: ========================================
lola: subprocess 5 will run for 1636 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p25 + 1 <= p14)))
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 ((p25 + 1 <= p14)))
lola: processed formula length: 24
lola: 51 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: 45 markings, 45 edges
lola: ========================================
lola: subprocess 6 will run for 3273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p24 + 1 <= p12))) OR G ((p18 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p18 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p18 <= p20))
lola: processed formula length: 16
lola: 51 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: 689 markings, 774 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: (X (X (F ((p9 + 1 <= p22)))) U G ((G (((p22 <= p9))) AND (p22 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (F ((p9 + 1 <= p22)))) U G ((G (((p22 <= p9))) AND (p22 <= p9))))
lola: processed formula length: 71
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 3527200 markings, 5379366 edges, 705440 markings/sec, 0 secs
lola: 7088844 markings, 10810679 edges, 712329 markings/sec, 5 secs
lola: 10438244 markings, 15918338 edges, 669880 markings/sec, 10 secs
lola: 13652698 markings, 20820201 edges, 642891 markings/sec, 15 secs
lola: 16811651 markings, 25637447 edges, 631791 markings/sec, 20 secs
lola: 19922888 markings, 30381941 edges, 622247 markings/sec, 25 secs
lola: 23114607 markings, 35249128 edges, 638344 markings/sec, 30 secs
lola: 26347819 markings, 40182205 edges, 646642 markings/sec, 35 secs
lola: 29903374 markings, 45611209 edges, 711111 markings/sec, 40 secs
lola: 33490939 markings, 51110843 edges, 717513 markings/sec, 45 secs
lola: 36927739 markings, 56426776 edges, 687360 markings/sec, 50 secs
lola: 40356902 markings, 61730801 edges, 685833 markings/sec, 55 secs
lola: 43656451 markings, 66837737 edges, 659910 markings/sec, 60 secs
lola: 47163163 markings, 72257282 edges, 701342 markings/sec, 65 secs
lola: 50509040 markings, 77496027 edges, 669175 markings/sec, 70 secs
lola: 53842591 markings, 82637709 edges, 666710 markings/sec, 75 secs
lola: 57117241 markings, 87694426 edges, 654930 markings/sec, 80 secs
lola: 60346969 markings, 92682925 edges, 645946 markings/sec, 85 secs
lola: 63536122 markings, 97601128 edges, 637831 markings/sec, 90 secs
lola: 66714851 markings, 102512020 edges, 635746 markings/sec, 95 secs
lola: 69880222 markings, 107392795 edges, 633074 markings/sec, 100 secs
lola: 73036345 markings, 112268865 edges, 631225 markings/sec, 105 secs
lola: 76056363 markings, 116922696 edges, 604004 markings/sec, 110 secs
lola: 77254528 markings, 118780192 edges, 239633 markings/sec, 115 secs
lola: 79844036 markings, 122767960 edges, 517902 markings/sec, 120 secs
lola: 82464094 markings, 126813694 edges, 524012 markings/sec, 125 secs
lola: 82583904 markings, 126996391 edges, 23962 markings/sec, 130 secs
lola: 82583904 markings, 126996391 edges, 0 markings/sec, 135 secs
lola: 84697801 markings, 130259331 edges, 422779 markings/sec, 140 secs
lola: 85647591 markings, 131722982 edges, 189958 markings/sec, 145 secs
lola: 85647591 markings, 131722982 edges, 0 markings/sec, 150 secs
lola: 86431231 markings, 132934872 edges, 156728 markings/sec, 155 secs
lola: 88386308 markings, 135953692 edges, 391015 markings/sec, 160 secs
lola: 88386308 markings, 135953692 edges, 0 markings/sec, 165 secs
lola: 90772947 markings, 139638480 edges, 477328 markings/sec, 170 secs
lola: 91106533 markings, 140151990 edges, 66717 markings/sec, 175 secs
lola: 92445729 markings, 142222013 edges, 267839 markings/sec, 180 secs
lola: 93875431 markings, 144434229 edges, 285940 markings/sec, 185 secs
lola: 93875431 markings, 144434229 edges, 0 markings/sec, 190 secs
lola: 93940667 markings, 144533706 edges, 13047 markings/sec, 195 secs
lola: 94032073 markings, 144673097 edges, 18281 markings/sec, 200 secs
lola: 94038973 markings, 144683620 edges, 1380 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G ((p24 + 1 <= p12))) OR G ((p18 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((p18 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p18 <= p20))
lola: processed formula length: 16
lola: 51 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: 689 markings, 774 edges
lola: ========================================
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: 51 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: 45 markings, 46 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: yes no unknown no no no no
lola:
preliminary result: yes no unknown no no no no
lola: ========================================
lola: memory consumption: 3520 KB
lola: time consumption: 528 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-00080by00040"
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-00080by00040, 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-158987806700401"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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