Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r170-oct2-162089287100085.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is PolyORBLF-COL-S06J04T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287100085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 24K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 09:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 09:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 12:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 154K May 5 16:51 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-S06J04T04-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-15

=== Now, execution of the tool begins

BK_START 1621377384314

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 22:36:25] [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]
[2021-05-18 22:36:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 22:36:25] [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.
[2021-05-18 22:36:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 705 ms
[2021-05-18 22:36:26] [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,

[2021-05-18 22:36:26] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2021-05-18 22:36:26] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2021-05-18 22:36:26] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2021-05-18 22:36:26] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2021-05-18 22:36:26] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2021-05-18 22:36:26] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2021-05-18 22:36:26] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 80 ms.
[2021-05-18 22:36:26] [INFO ] Computed order based on color domains.
[2021-05-18 22:36:26] [INFO ] Unfolded HLPN to a Petri net with 454 places and 1614 transitions in 34 ms.
[2021-05-18 22:36:26] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 88 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 519 resets, run finished after 633 ms. (steps per millisecond=157 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0]
[2021-05-18 22:36:27] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2021-05-18 22:36:27] [INFO ] Computed 50 place invariants in 99 ms
[2021-05-18 22:36:27] [INFO ] [Real]Absence check using 19 positive place invariants in 96 ms returned unsat
[2021-05-18 22:36:27] [INFO ] [Real]Absence check using 19 positive place invariants in 25 ms returned sat
[2021-05-18 22:36:27] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 36 ms returned unsat
[2021-05-18 22:36:28] [INFO ] [Real]Absence check using 19 positive place invariants in 117 ms returned sat
[2021-05-18 22:36:28] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 25 ms returned unsat
[2021-05-18 22:36:28] [INFO ] [Real]Absence check using 19 positive place invariants in 30 ms returned unsat
[2021-05-18 22:36:28] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned unsat
[2021-05-18 22:36:28] [INFO ] [Real]Absence check using 19 positive place invariants in 36 ms returned unsat
[2021-05-18 22:36:28] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2021-05-18 22:36:28] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned unsat
[2021-05-18 22:36:28] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2021-05-18 22:36:28] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 23 ms returned unsat
[2021-05-18 22:36:28] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned unsat
[2021-05-18 22:36:28] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned unsat
[2021-05-18 22:36:28] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned unsat
[2021-05-18 22:36:29] [INFO ] [Real]Absence check using 19 positive place invariants in 34 ms returned unsat
[2021-05-18 22:36:29] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned unsat
[2021-05-18 22:36:29] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2021-05-18 22:36:29] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 24 ms returned unsat
[2021-05-18 22:36:29] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned unsat
[2021-05-18 22:36:29] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2021-05-18 22:36:29] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned unsat
[2021-05-18 22:36:29] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2021-05-18 22:36:29] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 29 ms returned unsat
Successfully simplified 17 atomic propositions for a total of 21 simplifications.
[2021-05-18 22:36:29] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-18 22:36:29] [INFO ] Flatten gal took : 267 ms
FORMULA PolyORBLF-COL-S06J04T04-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 22:36:29] [INFO ] Applying decomposition
[2021-05-18 22:36:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 22:36:30] [INFO ] Flatten gal took : 174 ms
[2021-05-18 22:36:30] [INFO ] Decomposing Gal with order
[2021-05-18 22:36:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 22:36:30] [INFO ] Removed a total of 8427 redundant transitions.
[2021-05-18 22:36:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 22:36:30] [INFO ] Flatten gal took : 439 ms
[2021-05-18 22:36:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 63 ms.
[2021-05-18 22:36:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S06J04T04-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 22:36:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2021-05-18 22:36:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 24 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-COL-S06J04T04 @ 3570 seconds

FORMULA PolyORBLF-COL-S06J04T04-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PolyORBLF-COL-S06J04T04-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S06J04T04-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S06J04T04-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S06J04T04-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3445
rslt: Output for LTLCardinality @ PolyORBLF-COL-S06J04T04

{
"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 May 18 22:36:31 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 575
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(X (F ((p134 + 1 <= p83))) U (X (G ((1 <= p68 + p67 + p66 + p69))) OR F ((p134 + 1 <= p83))))",
"processed_size": 93,
"rewrites": 34
},
"result":
{
"edges": 36,
"markings": 36,
"produced_by": "LTL model checker",
"value": false
},
"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": 690
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 29,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 29,
"visible_transitions": 0
},
"processed": "X ((X (X (G ((p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= 2)))) U (p137 + p138 + p139 + p140 + p141 + 1 <= p179 + p180 + p181 + p182)))",
"processed_size": 212,
"rewrites": 34
},
"result":
{
"edges": 1668,
"markings": 1028,
"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": 862
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (F ((p368 + p369 + p370 + p371 <= p242 + p243 + p244 + p245)))",
"processed_size": 64,
"rewrites": 34
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1150
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (X (X (((p6 + p7 + p8 + p9 <= p376 + p377 + p378 + p379) OR (p334 + p335 + p336 + p337 <= p393)))))",
"processed_size": 102,
"rewrites": 34
},
"result":
{
"edges": 138,
"markings": 69,
"produced_by": "LTL model checker",
"value": true
},
"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": 1725
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p65 + p64 + p63 + p62)))",
"processed_size": 36,
"rewrites": 34
},
"result":
{
"edges": 313456,
"markings": 192590,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "F ((G ((p83 <= 0)) OR G (((p251 <= 0) AND F ((p210 + p211 + p212 + p213 <= p400 + p401 + p402 + p403 + p404 + p405))))))",
"processed_size": 120,
"rewrites": 34
},
"result":
{
"edges": 3086,
"markings": 2509,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"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": 49076,
"runtime": 125.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F(*)) U (X(G(**)) OR F(*))) : X((X(X(G(**))) U **)) : G(F(**)) : F((G(*) OR G((* AND F(**))))) : X(F(**)) : X(X(X(**)))"
},
"net":
{
"arcs": 9892,
"conflict_clusters": 159,
"places": 454,
"places_significant": 404,
"singleton_clusters": 0,
"transitions": 1614
},
"result":
{
"preliminary_value": "no no no no yes yes ",
"value": "no no no no yes yes "
},
"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: 2068/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 14528
lola: finding significant places
lola: 454 places, 1614 transitions, 404 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= p380 + p381 + p382 + p383)
lola: (NOT(X (G ((p83 <= p134)))) U (G (X ((1 <= p68 + p67 + p66 + p69))) OR NOT(G ((p83 <= p134))))) : X ((X (X (G (G ((p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= 2))))) U (p137 + p138 + p139 + p140 + p141 + 1 <= p179 + p180 + p181 + p182))) : G (X ((F (((p252 + 1 <= p202))) U F ((X (X ((p202 <= p252))) U (1 <= p65 + p64 + p63 + p62)))))) : NOT(G ((F ((1 <= p83)) AND (F ((1 <= p251)) OR G (NOT(G (X (F ((p210 + p211 + p212 + p213 <= p400 + p401 + p402 + p403 + p404 + p405)))))))))) : F (X ((p368 + p369 + p370 + p371 <= p242 + p243 + p244 + p245))) : (((p334 + p335 + p336 + p337 <= p393) U ((0 <= 0) U (0 <= 0))) AND X (X (X (((p6 + p7 + p8 + p9 <= p376 + p377 + p378 + p379) OR (p334 + p335 + p336 + p337 <= p393))))))
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:166
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p134 + 1 <= p83))) U (X (G ((1 <= p68 + p67 + p66 + p69))) OR F ((p134 + 1 <= p83))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((p134 + 1 <= p83))) U (X (G ((1 <= p68 + p67 + p66 + p69))) OR F ((p134 + 1 <= p83))))
lola: processed formula length: 93
lola: 34 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: 36 markings, 36 edges
lola: ========================================
lola: subprocess 1 will run for 690 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (G ((p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= 2)))) U (p137 + p138 + p139 + p140 + p141 + 1 <= p179 + p180 + p181 + p182)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (G ((p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= 2)))) U (p137 + p138 + p139 + p140 + p141 + 1 <= p179 + p180 + p181 + p182)))
lola: processed formula length: 212
lola: 34 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: 1028 markings, 1668 edges
lola: ========================================
lola: subprocess 2 will run for 862 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p368 + p369 + p370 + p371 <= p242 + p243 + p244 + p245)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p368 + p369 + p370 + p371 <= p242 + p243 + p244 + p245)))
lola: processed formula length: 64
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 1150 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (((p6 + p7 + p8 + p9 <= p376 + p377 + p378 + p379) OR (p334 + p335 + p336 + p337 <= p393)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (((p6 + p7 + p8 + p9 <= p376 + p377 + p378 + p379) OR (p334 + p335 + p336 + p337 <= p393)))))
lola: processed formula length: 102
lola: 34 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: 69 markings, 138 edges
lola: ========================================
lola: subprocess 4 will run for 1725 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p65 + p64 + p63 + p62)))
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 ((1 <= p65 + p64 + p63 + p62)))
lola: processed formula length: 36
lola: 34 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: 192590 markings, 313456 edges
lola: ========================================
lola: subprocess 5 will run for 3446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p83 <= 0)) OR G (((p251 <= 0) AND F ((p210 + p211 + p212 + p213 <= p400 + p401 + p402 + p403 + p404 + p405))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p83 <= 0)) OR G (((p251 <= 0) AND F ((p210 + p211 + p212 + p213 <= p400 + p401 + p402 + p403 + p404 + p405))))))
lola: processed formula length: 120
lola: 34 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: 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: 2509 markings, 3086 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes yes
lola:
preliminary result: no no no no yes yes
lola: memory consumption: 49076 KB
lola: time consumption: 125 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-S06J04T04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is PolyORBLF-COL-S06J04T04, 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 r170-oct2-162089287100085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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