About the Execution of 2020-gold for PolyORBLF-COL-S06J06T04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4305.848 | 3600000.00 | 284768.00 | 259.90 | TFTFTFFTFFFFFFFF | normal |
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-162089287100097.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-S06J06T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287100097
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K 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.7K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 09:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 09:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:17 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-S06J06T04-00
FORMULA_NAME PolyORBLF-COL-S06J06T04-01
FORMULA_NAME PolyORBLF-COL-S06J06T04-02
FORMULA_NAME PolyORBLF-COL-S06J06T04-03
FORMULA_NAME PolyORBLF-COL-S06J06T04-04
FORMULA_NAME PolyORBLF-COL-S06J06T04-05
FORMULA_NAME PolyORBLF-COL-S06J06T04-06
FORMULA_NAME PolyORBLF-COL-S06J06T04-07
FORMULA_NAME PolyORBLF-COL-S06J06T04-08
FORMULA_NAME PolyORBLF-COL-S06J06T04-09
FORMULA_NAME PolyORBLF-COL-S06J06T04-10
FORMULA_NAME PolyORBLF-COL-S06J06T04-11
FORMULA_NAME PolyORBLF-COL-S06J06T04-12
FORMULA_NAME PolyORBLF-COL-S06J06T04-13
FORMULA_NAME PolyORBLF-COL-S06J06T04-14
FORMULA_NAME PolyORBLF-COL-S06J06T04-15
=== Now, execution of the tool begins
BK_START 1621378680610
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 22:58:03] [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:58:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 22:58:03] [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:58:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1457 ms
[2021-05-18 22:58:05] [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:58:05] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2021-05-18 22:58:05] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2021-05-18 22:58:05] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2021-05-18 22:58:05] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2021-05-18 22:58:05] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2021-05-18 22:58:05] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2021-05-18 22:58:05] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 97 ms.
[2021-05-18 22:58:05] [INFO ] Computed order based on color domains.
[2021-05-18 22:58:05] [INFO ] Unfolded HLPN to a Petri net with 506 places and 1774 transitions in 73 ms.
[2021-05-18 22:58:05] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 145 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 480 resets, run finished after 593 ms. (steps per millisecond=168 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1]
[2021-05-18 22:58:06] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2021-05-18 22:58:06] [INFO ] Computed 54 place invariants in 202 ms
[2021-05-18 22:58:07] [INFO ] [Real]Absence check using 17 positive place invariants in 137 ms returned unsat
[2021-05-18 22:58:07] [INFO ] [Real]Absence check using 17 positive place invariants in 95 ms returned sat
[2021-05-18 22:58:07] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 53 ms returned unsat
[2021-05-18 22:58:07] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned unsat
[2021-05-18 22:58:07] [INFO ] [Real]Absence check using 17 positive place invariants in 54 ms returned unsat
[2021-05-18 22:58:07] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-18 22:58:07] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 24 ms returned unsat
[2021-05-18 22:58:08] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2021-05-18 22:58:08] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 24 ms returned unsat
[2021-05-18 22:58:08] [INFO ] [Real]Absence check using 17 positive place invariants in 84 ms returned unsat
[2021-05-18 22:58:08] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned unsat
[2021-05-18 22:58:08] [INFO ] [Real]Absence check using 17 positive place invariants in 41 ms returned sat
[2021-05-18 22:58:08] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 42 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
[2021-05-18 22:58:08] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-18 22:58:08] [INFO ] Flatten gal took : 220 ms
FORMULA PolyORBLF-COL-S06J06T04-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 22:58:08] [INFO ] Applying decomposition
[2021-05-18 22:58:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 22:58:09] [INFO ] Flatten gal took : 169 ms
[2021-05-18 22:58:09] [INFO ] Decomposing Gal with order
[2021-05-18 22:58:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 22:58:09] [INFO ] Removed a total of 8995 redundant transitions.
[2021-05-18 22:58:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 22:58:09] [INFO ] Flatten gal took : 430 ms
[2021-05-18 22:58:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 78 ms.
[2021-05-18 22:58:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S06J06T04-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 22:58:10] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-18 22:58:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 29 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-COL-S06J06T04 @ 3570 seconds
FORMULA PolyORBLF-COL-S06J06T04-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3316
rslt: Output for LTLCardinality @ PolyORBLF-COL-S06J06T04
{
"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:58:10 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 432
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 432
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "((p209 + p210 + p211 + p212 <= p153 + p154 + p155 + p156 + p157 + p158 + p159) U (p100 <= p10 + p11 + p12 + p13))",
"processed_size": 113,
"rewrites": 55
},
"result":
{
"edges": 11707550,
"markings": 5342854,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 473
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((p152 <= p217)) AND (F (((p217 + 1 <= p152) AND (p283 <= 0))) OR X ((p152 <= p217))))))",
"processed_size": 97,
"rewrites": 55
},
"result":
{
"edges": 2140,
"markings": 859,
"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": 552
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (X (G ((p420 + p421 + p422 + p423 + 1 <= p287 + p288 + p289 + p290))))",
"processed_size": 72,
"rewrites": 55
},
"result":
{
"edges": 37,
"markings": 37,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 663
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X ((F (((p6 + p7 + p8 + p9 <= p358 + p359 + p360 + p361))) OR X ((p6 + p7 + p8 + p9 <= p358 + p359 + p360 + p361))))",
"processed_size": 116,
"rewrites": 55
},
"result":
{
"edges": 37,
"markings": 37,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 829
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X (X (G ((p202 + p203 + p204 + p205 + p206 + p207 + p208 <= p432 + p433 + p434 + p435))))",
"processed_size": 89,
"rewrites": 55
},
"result":
{
"edges": 1158,
"markings": 518,
"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": 1105
},
"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": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "F (G ((p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p96 + p95 + p94 + p97)))",
"processed_size": 85,
"rewrites": 55
},
"result":
{
"edges": 39,
"markings": 38,
"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": 1658
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "((1 <= p96 + p95 + p94 + p97) U (G ((p96 + p95 + p94 + p97 <= 0)) OR (p213 + p214 + p215 + p216 + 1 <= p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314)))",
"processed_size": 271,
"rewrites": 55
},
"result":
{
"edges": 89,
"markings": 78,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3316
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "F (G (((p276 + p277 + p278 + p279 + p280 + p281 + p282 <= 1) R (F ((p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + 1 <= p390 + p391 + p392 + p393)) AND (p86 + p87 + p88 + p89 + 1 <= p232)))))",
"processed_size": 312,
"rewrites": 55
},
"result":
{
"edges": 39,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 50024,
"runtime": 254.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X((* AND (F(**) OR G(*))))) AND (** U **)) : F(G((F(**) AND (F(*) OR X(**))))) : F(G(**)) : X(X(G(*))) : X((F(**) OR X(**))) : X(X(G(**))) : F(G((* R (F(*) AND *)))) : (** U (G(*) OR **))"
},
"net":
{
"arcs": 10564,
"conflict_clusters": 169,
"places": 506,
"places_significant": 452,
"singleton_clusters": 0,
"transitions": 1774
},
"result":
{
"preliminary_value": "no no no no no no no no ",
"value": "no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2280/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16192
lola: finding significant places
lola: 506 places, 1774 transitions, 452 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 true: (2 <= p98)
lola: (X (NOT(X ((NOT(F ((p239 <= p390 + p391 + p392 + p393))) U (p10 + p11 + p12 + p13 + 1 <= p100))))) AND ((p209 + p210 + p211 + p212 <= p153 + p154 + p155 + p156 + p157 + p158 + p159) U (p100 <= p10 + p11 + p12 + p13))) : F ((X (F ((1 <= p99))) U G ((F (NOT(G (((p152 <= p217) OR (1 <= p283))))) U X ((p152 <= p217)))))) : F (G (X ((p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p96 + p95 + p94 + p97)))) : NOT(X (F (X ((p287 + p288 + p289 + p290 <= p420 + p421 + p422 + p423))))) : X ((F (((p6 + p7 + p8 + p9 <= p358 + p359 + p360 + p361))) OR X ((p6 + p7 + p8 + p9 <= p358 + p359 + p360 + p361)))) : G (NOT(F (NOT(X (X (G ((p202 + p203 + p204 + p205 + p206 + p207 + p208 <= p432 + p433 + p434 + p435)))))))) : X (F (X (X (G (NOT(((2 <= p276 + p277 + p278 + p279 + p280 + p281 + p282) U (G ((p390 + p391 + p392 + p393 <= p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267)) OR (p232 <= p86 + p87 + p88 + p89))))))))) : ((1 <= p96 + p95 + p94 + p97) U (NOT(F ((1 <= p96 + p95 + p94 + p97))) OR (p213 + p214 + p215 + p216 + 1 <= p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314)))
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:434
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: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: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: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((p100 <= p10 + p11 + p12 + p13) AND (F ((p239 <= p390 + p391 + p392 + p393)) OR G ((p100 <= p10 + p11 + p12 + p13)))))) AND ((p209 + p210 + p211 + p212 <= p153 + p154 + p155 + p156 + p157 + p158 + p159) U (p100 <= p10 + p11 + p12 + p13)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p209 + p210 + p211 + p212 <= p153 + p154 + p155 + p156 + p157 + p158 + p159) U (p100 <= p10 + p11 + p12 + p13))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p209 + p210 + p211 + p212 <= p153 + p154 + p155 + p156 + p157 + p158 + p159) U (p100 <= p10 + p11 + p12 + p13))
lola: processed formula length: 113
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 211298 markings, 379575 edges, 42260 markings/sec, 0 secs
lola: 416997 markings, 811237 edges, 41140 markings/sec, 5 secs
lola: 621388 markings, 1241573 edges, 40878 markings/sec, 10 secs
lola: 830312 markings, 1670361 edges, 41785 markings/sec, 15 secs
lola: 1006844 markings, 2086972 edges, 35306 markings/sec, 20 secs
lola: 1211748 markings, 2515899 edges, 40981 markings/sec, 25 secs
lola: 1420254 markings, 2946275 edges, 41701 markings/sec, 30 secs
lola: 1593979 markings, 3359212 edges, 34745 markings/sec, 35 secs
lola: 1802759 markings, 3793609 edges, 41756 markings/sec, 40 secs
lola: 2003631 markings, 4208791 edges, 40174 markings/sec, 45 secs
lola: 2200181 markings, 4623130 edges, 39310 markings/sec, 50 secs
lola: 2382294 markings, 5042498 edges, 36423 markings/sec, 55 secs
lola: 2584518 markings, 5467578 edges, 40445 markings/sec, 60 secs
lola: 2783514 markings, 5889397 edges, 39799 markings/sec, 65 secs
lola: 2984742 markings, 6309602 edges, 40246 markings/sec, 70 secs
lola: 3161897 markings, 6718678 edges, 35431 markings/sec, 75 secs
lola: 3359370 markings, 7132850 edges, 39495 markings/sec, 80 secs
lola: 3562280 markings, 7550245 edges, 40582 markings/sec, 85 secs
lola: 3734394 markings, 7951571 edges, 34423 markings/sec, 90 secs
lola: 3942142 markings, 8384073 edges, 41550 markings/sec, 95 secs
lola: 4147678 markings, 8809556 edges, 41107 markings/sec, 100 secs
lola: 4347088 markings, 9227882 edges, 39882 markings/sec, 105 secs
lola: 4500911 markings, 9633987 edges, 30765 markings/sec, 110 secs
lola: 4684137 markings, 10056482 edges, 36645 markings/sec, 115 secs
lola: 4859952 markings, 10471302 edges, 35163 markings/sec, 120 secs
lola: 5022125 markings, 10879823 edges, 32435 markings/sec, 125 secs
lola: 5189704 markings, 11280677 edges, 33516 markings/sec, 130 secs
lola: 5338830 markings, 11686475 edges, 29825 markings/sec, 135 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: 5342854 markings, 11707550 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p152 <= p217)) AND (F (((p217 + 1 <= p152) AND (p283 <= 0))) OR X ((p152 <= p217))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p152 <= p217)) AND (F (((p217 + 1 <= p152) AND (p283 <= 0))) OR X ((p152 <= p217))))))
lola: processed formula length: 97
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 859 markings, 2140 edges
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p420 + p421 + p422 + p423 + 1 <= p287 + p288 + p289 + p290))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p420 + p421 + p422 + p423 + 1 <= p287 + p288 + p289 + p290))))
lola: processed formula length: 72
lola: 55 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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 3 will run for 663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p6 + p7 + p8 + p9 <= p358 + p359 + p360 + p361))) OR X ((p6 + p7 + p8 + p9 <= p358 + p359 + p360 + p361))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p6 + p7 + p8 + p9 <= p358 + p359 + p360 + p361))) OR X ((p6 + p7 + p8 + p9 <= p358 + p359 + p360 + p361))))
lola: processed formula length: 116
lola: 55 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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 4 will run for 829 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p202 + p203 + p204 + p205 + p206 + p207 + p208 <= p432 + p433 + p434 + p435))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p202 + p203 + p204 + p205 + p206 + p207 + p208 <= p432 + p433 + p434 + p435))))
lola: processed formula length: 89
lola: 55 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: 518 markings, 1158 edges
lola: subprocess 5 will run for 1105 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p96 + p95 + p94 + p97)))
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 ((p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p96 + p95 + p94 + p97)))
lola: processed formula length: 85
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 38 markings, 39 edges
lola: ========================================
lola: subprocess 6 will run for 1658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p96 + p95 + p94 + p97) U (G ((p96 + p95 + p94 + p97 <= 0)) OR (p213 + p214 + p215 + p216 + 1 <= p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p96 + p95 + p94 + p97) U (G ((p96 + p95 + p94 + p97 <= 0)) OR (p213 + p214 + p215 + p216 + 1 <= p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314)))
lola: processed formula length: 271
lola: 55 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: 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: 78 markings, 89 edges
lola: ========================================
lola: subprocess 7 will run for 3316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p276 + p277 + p278 + p279 + p280 + p281 + p282 <= 1) R (F ((p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + 1 <= p390 + p391 + p392 + p393)) AND (p86 + p87 + p88 + p89 + 1 <= p232)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p276 + p277 + p278 + p279 + p280 + p281 + p282 <= 1) R (F ((p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + 1 <= p390 + p391 + p392 + p393)) AND (p86 + p87 + p88 + p89 + 1 <= p232)))))
lola: processed formula length: 312
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 38 markings, 39 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no
lola:
preliminary result: no no no no no no no no
lola: memory consumption: 50024 KB
lola: time consumption: 254 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-S06J06T04"
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-S06J06T04, 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-162089287100097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J06T04.tgz
mv PolyORBLF-COL-S06J06T04 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 '
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 ;