Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871600265.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PolyORBLF-COL-S02J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871600265
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 4.1K Apr 12 05:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 05:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 04:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 04:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J04T06-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-15

=== Now, execution of the tool begins

BK_START 1591139065467

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:04:27] [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-02 23:04:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:04:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 23:04:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 613 ms
[2020-06-02 23:04:27] [INFO ] sort/places :
D4->DisablePollingE,DisablePollingB,Insert_Source_B,P_1119,P_2579,
Threads->AwakeTasks,IdleTasks,NotifyEventJobQueuedE,QueueJobE,P_2321,TryAllocateOneTaskE,TryAllocateOneTaskB,P_2318,EnablePollingE,EnablePollingB,FetchJobB,ScheduleTaskE_Check,ScheduleTaskB,Abort_Check_Sources_E,Abort_Check_Sources_B,NotifyEventSourceAddedB,Insert_Source_E,NotifyEventSourceAddedE,P_1113,ProcessingEvt,P_1155,nyo,P_1158,P_1159,P_1160,NotifyEventEndOfCheckSourcesB,NotifyEventEndOfCheckSourcesE,Check_Sources_B,Check_Sources_E,Idle,NotifyEventJobCompletedE,NotifyEventJobCompletedB,RunE,RunB,Perform_Work_E,Try_Check_Sources_B,Try_Check_Sources_E,P_1617,ScheduleTaskE_Idle,
D6->CreatedJobs,
Jobs->P_1725,P_1724,P_1712,AvailableJobId,
Dot->cJobCnt,JobCnt,cBlockedTasks,PollingAbort,cPollingAbort,BlockedTasks,MarkerWrite,P_1727,P_1726,MarkerRead,P_1717,P_1716,CanInjectEvent,SigAbort,NoSigAbort,P_1093,P_1095,P_1097,P_1099,cSources,cIsMonitoring,IsMonitoring,cIdleTasks,ORB_Lock,
Sources->DataOnSrc,PlaceSources,ModifiedSrc,AbourtToModifySrc,
D1->NotifyEventJobQueuedB,QueueJobB,FetchJobE,ScheduleTaskE_Work,

[2020-06-02 23:04:27] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2020-06-02 23:04:27] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2020-06-02 23:04:27] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2020-06-02 23:04:27] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2020-06-02 23:04:27] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2020-06-02 23:04:27] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2020-06-02 23:04:27] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 23 ms.
[2020-06-02 23:04:27] [INFO ] Computed order based on color domains.
[2020-06-02 23:04:27] [INFO ] Unfolded HLPN to a Petri net with 476 places and 824 transitions in 23 ms.
[2020-06-02 23:04:27] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 52 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 34 resets, run finished after 371 ms. (steps per millisecond=269 ) properties seen :[1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0]
[2020-06-02 23:04:28] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2020-06-02 23:04:28] [INFO ] Computed 46 place invariants in 61 ms
[2020-06-02 23:04:28] [INFO ] [Real]Absence check using 12 positive place invariants in 38 ms returned sat
[2020-06-02 23:04:28] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 23 ms returned unsat
[2020-06-02 23:04:28] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned unsat
[2020-06-02 23:04:28] [INFO ] [Real]Absence check using 12 positive place invariants in 32 ms returned unsat
[2020-06-02 23:04:29] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned unsat
[2020-06-02 23:04:29] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned unsat
[2020-06-02 23:04:29] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned unsat
[2020-06-02 23:04:29] [INFO ] [Real]Absence check using 12 positive place invariants in 48 ms returned sat
[2020-06-02 23:04:29] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 14 ms returned unsat
[2020-06-02 23:04:29] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2020-06-02 23:04:29] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 55 ms returned unsat
[2020-06-02 23:04:29] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned unsat
[2020-06-02 23:04:29] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2020-06-02 23:04:29] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 46 ms returned sat
[2020-06-02 23:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:04:30] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2020-06-02 23:04:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:04:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2020-06-02 23:04:30] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 30 ms returned sat
[2020-06-02 23:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:04:32] [INFO ] [Nat]Absence check using state equation in 1338 ms returned sat
[2020-06-02 23:04:32] [INFO ] State equation strengthened by 78 read => feed constraints.
[2020-06-02 23:04:32] [INFO ] [Nat]Added 78 Read/Feed constraints in 350 ms returned sat
[2020-06-02 23:04:32] [INFO ] Deduced a trap composed of 65 places in 154 ms
[2020-06-02 23:04:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 417 ms
[2020-06-02 23:04:33] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 92 ms.
[2020-06-02 23:04:42] [INFO ] Added : 120 causal constraints over 24 iterations in 9054 ms. Result :unknown
[2020-06-02 23:04:42] [INFO ] [Real]Absence check using 12 positive place invariants in 34 ms returned sat
[2020-06-02 23:04:42] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 35 ms returned unsat
[2020-06-02 23:04:42] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2020-06-02 23:04:42] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 33 ms returned unsat
[2020-06-02 23:04:42] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned unsat
[2020-06-02 23:04:42] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned unsat
[2020-06-02 23:04:42] [INFO ] [Real]Absence check using 12 positive place invariants in 33 ms returned sat
[2020-06-02 23:04:42] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 33 ms returned unsat
Successfully simplified 14 atomic propositions for a total of 17 simplifications.
[2020-06-02 23:04:42] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-02 23:04:42] [INFO ] Flatten gal took : 131 ms
FORMULA PolyORBLF-COL-S02J04T06-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:04:42] [INFO ] Applying decomposition
[2020-06-02 23:04:42] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-02 23:04:42] [INFO ] Flatten gal took : 88 ms
[2020-06-02 23:04:43] [INFO ] Decomposing Gal with order
[2020-06-02 23:04:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 23:04:43] [INFO ] Removed a total of 2177 redundant transitions.
[2020-06-02 23:04:43] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-02 23:04:43] [INFO ] Flatten gal took : 172 ms
[2020-06-02 23:04:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 30 ms.
[2020-06-02 23:04:43] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA PolyORBLF-COL-S02J04T06-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:04:43] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-02 23:04:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-COL-S02J04T06 @ 3570 seconds

FORMULA PolyORBLF-COL-S02J04T06-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3453
rslt: Output for LTLCardinality @ PolyORBLF-COL-S02J04T06

{
"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": "Tue Jun 2 23:04:44 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 55,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "X ((X (G (((p222 + p223 + p224 + p225 + p226 + p227 + 1 <= p219) OR (p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + 1 <= p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p439 + p438)))) U (p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p439 + p438 <= p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294)))",
"processed_size": 417,
"rewrites": 62
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (X (X (X (F ((p386 + p387 + p388 + p389 + p390 + p391 + 1 <= p440 + p441 + p442 + p443 + p444 + p445))))))",
"processed_size": 108,
"rewrites": 62
},
"result":
{
"edges": 305,
"markings": 305,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (G ((p273 + 1 <= p404 + p405 + p406 + p407 + p408 + p409)))",
"processed_size": 61,
"rewrites": 62
},
"result":
{
"edges": 305,
"markings": 305,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 39,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "G ((F ((p202 + p203 + p204 + p205 + p206 <= p104 + p105 + p106 + p107 + p108 + p109)) AND ((X (X (F ((p104 + p105 + p106 + p107 + p108 + p109 + 1 <= p202 + p203 + p204 + p205 + p206)))) AND (p330 + p331 + p332 + p333 + p334 + p335 <= 0)) OR X ((p202 + p203 + p204 + p205 + p206 <= p104 + p105 + p106 + p107 + p108 + p109)))))",
"processed_size": 325,
"rewrites": 62
},
"result":
{
"edges": 22171657,
"markings": 9584027,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 871
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "X (X (G ((p398 + p399 + p400 + p401 + p402 + p403 + 1 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192))))",
"processed_size": 268,
"rewrites": 62
},
"result":
{
"edges": 305,
"markings": 305,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1162
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F (G ((p213 + p214 + p215 + p216 + p217 + p218 + 1 <= p151)))",
"processed_size": 61,
"rewrites": 62
},
"result":
{
"edges": 337,
"markings": 336,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1743
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "F (G (((2 <= p54 + p50 + p51 + p52 + p53 + p55) OR (G ((1 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137)) AND F ((2 <= p54 + p50 + p51 + p52 + p53 + p55))))))",
"processed_size": 197,
"rewrites": 62
},
"result":
{
"edges": 826,
"markings": 824,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3486
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "G (F ((F ((p336 + p337 + p338 + p339 + p340 + p341 + 1 <= p228 + p229 + p230 + p231 + p232 + p233)) AND (G (F ((p336 + p337 + p338 + p339 + p340 + p341 + 1 <= p228 + p229 + p230 + p231 + p232 + p233))) OR G (F ((p417 + 1 <= p196 + p197 + p198 + p199 + p200 + p201)))))))",
"processed_size": 270,
"rewrites": 62
},
"result":
{
"edges": 5036516,
"markings": 2367808,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"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": 26444,
"runtime": 117.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X(G(*)) U **)) : X(X(X(X(F(*))))) : X(G(*)) : F(G((** OR (G(**) AND F(**))))) : G((F(**) AND ((X(X(F(*))) AND **) OR X(**)))) : F(G(*)) : G(F((F(*) AND (G(F(*)) OR G(F(*)))))) : X(X(G(*)))"
},
"net":
{
"arcs": 3570,
"conflict_clusters": 185,
"places": 476,
"places_significant": 430,
"singleton_clusters": 0,
"transitions": 824
},
"result":
{
"preliminary_value": "yes no no no no no no no ",
"value": "yes no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1300/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 15232
lola: finding significant places
lola: 476 places, 824 transitions, 430 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 (NOT(X (F (((p158 + p159 + p160 + p161 + p162 <= p234) U ((p219 <= p222 + p223 + p224 + p225 + p226 + p227) AND (p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p439 + p438 <= p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294)))))))) U X ((p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p439 + p438 <= p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294))) : X (X (NOT(X (G (X ((p440 + p441 + p442 + p443 + p444 + p445 <= p386 + p387 + p388 + p389 + p390 + p391))))))) : NOT(F (X (F (((p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 <= p193) U (p404 + p405 + p406 + p407 + p408 + p409 <= p273)))))) : F (G ((G ((1 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137)) U (2 <= p54 + p50 + p51 + p52 + p53 + p55)))) : G (((F (X (F (NOT(X ((p202 + p203 + p204 + p205 + p206 <= p104 + p105 + p106 + p107 + p108 + p109)))))) AND (p330 + p331 + p332 + p333 + p334 + p335 <= 0)) U X ((p202 + p203 + p204 + p205 + p206 <= p104 + p105 + p106 + p107 + p108 + p109)))) : NOT(X (G (F (((((p151 <= p213 + p214 + p215 + p216 + p217 + p218) AND (1 <= p195)) U (p236 + p235 <= p398 + p399 + p400 + p401 + p402 + p403)) U F ((p151 <= p213 + p214 + p215 + p216 + p217 + p218))))))) : G (NOT(X (G ((F (G (X ((p196 + p197 + p198 + p199 + p200 + p201 <= p417)))) U G ((p228 + p229 + p230 + p231 + p232 + p233 <= p336 + p337 + p338 + p339 + p340 + p341))))))) : G (NOT(X (F (X ((p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 <= p398 + p399 + p400 + p401 + p402 + p403))))))
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((p222 + p223 + p224 + p225 + p226 + p227 + 1 <= p219) OR (p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + 1 <= p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p439 + p438)))) U (p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p439 + p438 <= p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((p222 + p223 + p224 + p225 + p226 + p227 + 1 <= p219) OR (p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + 1 <= p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p439 + p438)))) U (p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p439 + p438 <= p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292... (shortened)
lola: processed formula length: 417
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (F ((p386 + p387 + p388 + p389 + p390 + p391 + 1 <= p440 + p441 + p442 + p443 + p444 + p445))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (F ((p386 + p387 + p388 + p389 + p390 + p391 + 1 <= p440 + p441 + p442 + p443 + p444 + p445))))))
lola: processed formula length: 108
lola: 62 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: 305 markings, 305 edges
lola: ========================================
lola: subprocess 2 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p273 + 1 <= p404 + p405 + p406 + p407 + p408 + p409)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p273 + 1 <= p404 + p405 + p406 + p407 + p408 + p409)))
lola: processed formula length: 61
lola: 62 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: 305 markings, 305 edges
lola: ========================================
lola: subprocess 3 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p202 + p203 + p204 + p205 + p206 <= p104 + p105 + p106 + p107 + p108 + p109)) AND ((X (X (F ((p104 + p105 + p106 + p107 + p108 + p109 + 1 <= p202 + p203 + p204 + p205 + p206)))) AND (p330 + p331 + p332 + p333 + p334 + p335 <= 0)) OR X ((p202 + p203 + p204 + p205 + p206 <= p104 + p105 + p106 + p107 + p108 + p109)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p202 + p203 + p204 + p205 + p206 <= p104 + p105 + p106 + p107 + p108 + p109)) AND ((X (X (F ((p104 + p105 + p106 + p107 + p108 + p109 + 1 <= p202 + p203 + p204 + p205 + p206)))) AND (p330 + p331 + p332 + p333 + p334 + p335 <= 0)) OR X ((p202 + p203 + p204 + p205 + p206 <= p104 + p105 + p106 + p107 + p108 + p109)))))
lola: processed formula length: 325
lola: 62 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: 687737 markings, 1439417 edges, 137547 markings/sec, 0 secs
lola: 1412712 markings, 2928849 edges, 144995 markings/sec, 5 secs
lola: 2069301 markings, 4431880 edges, 131318 markings/sec, 10 secs
lola: 2730362 markings, 5906757 edges, 132212 markings/sec, 15 secs
lola: 3419232 markings, 7388275 edges, 137774 markings/sec, 20 secs
lola: 4137708 markings, 8874932 edges, 143695 markings/sec, 25 secs
lola: 4835708 markings, 10328577 edges, 139600 markings/sec, 30 secs
lola: 5479626 markings, 11793421 edges, 128784 markings/sec, 35 secs
lola: 6057618 markings, 13311751 edges, 115598 markings/sec, 40 secs
lola: 6691519 markings, 14721369 edges, 126780 markings/sec, 45 secs
lola: 7287857 markings, 16080443 edges, 119268 markings/sec, 50 secs
lola: 7819447 markings, 17490553 edges, 106318 markings/sec, 55 secs
lola: 8312686 markings, 18982346 edges, 98648 markings/sec, 60 secs
lola: 8855524 markings, 20344749 edges, 108568 markings/sec, 65 secs
lola: 9353266 markings, 21733890 edges, 99548 markings/sec, 70 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: 9584027 markings, 22171657 edges
lola: ========================================
lola: subprocess 4 will run for 871 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p398 + p399 + p400 + p401 + p402 + p403 + 1 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p398 + p399 + p400 + p401 + p402 + p403 + 1 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192))))
lola: processed formula length: 268
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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: 305 markings, 305 edges
lola: ========================================
lola: subprocess 5 will run for 1162 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p213 + p214 + p215 + p216 + p217 + p218 + 1 <= p151)))
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 ((p213 + p214 + p215 + p216 + p217 + p218 + 1 <= p151)))
lola: processed formula length: 61
lola: 62 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 227
lola: add low 179
lola: add low 541
lola: add low 523
lola: add low 709
lola: add low 727
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: 336 markings, 337 edges
lola: ========================================
lola: subprocess 6 will run for 1743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((2 <= p54 + p50 + p51 + p52 + p53 + p55) OR (G ((1 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137)) AND F ((2 <= p54 + p50 + p51 + p52 + p53 + p55))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((2 <= p54 + p50 + p51 + p52 + p53 + p55) OR (G ((1 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137)) AND F ((2 <= p54 + p50 + p51 + p52 + p53 + p55))))))
lola: processed formula length: 197
lola: 62 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: 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: 824 markings, 826 edges
lola: ========================================
lola: subprocess 7 will run for 3486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((p336 + p337 + p338 + p339 + p340 + p341 + 1 <= p228 + p229 + p230 + p231 + p232 + p233)) AND (G (F ((p336 + p337 + p338 + p339 + p340 + p341 + 1 <= p228 + p229 + p230 + p231 + p232 + p233))) OR G (F ((p417 + 1 <= p196 + p197 + p198 + p199 + p200 + p201)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((p336 + p337 + p338 + p339 + p340 + p341 + 1 <= p228 + p229 + p230 + p231 + p232 + p233)) AND (G (F ((p336 + p337 + p338 + p339 + p340 + p341 + 1 <= p228 + p229 + p230 + p231 + p232 + p233))) OR G (F ((p417 + 1 <= p196 + p197 + p198 + p199 + p200 + p201)))))))
lola: processed formula length: 270
lola: 62 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: 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: 338268 markings, 445887 edges, 67654 markings/sec, 0 secs
lola: 717745 markings, 954156 edges, 75895 markings/sec, 5 secs
lola: 1061395 markings, 1434839 edges, 68730 markings/sec, 10 secs
lola: 1392512 markings, 1928344 edges, 66223 markings/sec, 15 secs
lola: 1753860 markings, 2948189 edges, 72270 markings/sec, 20 secs
lola: 2114178 markings, 4166547 edges, 72064 markings/sec, 25 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: 2367808 markings, 5036516 edges
lola: RESULT
lola:
SUMMARY: yes no no no no no no no
lola:
preliminary result: yes no no no no no no no
lola: ========================================
lola: memory consumption: 26444 KB
lola: time consumption: 117 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="PolyORBLF-COL-S02J04T06"
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 PolyORBLF-COL-S02J04T06, 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 r176-tajo-158987871600265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T06.tgz
mv PolyORBLF-COL-S02J04T06 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 ;