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-162089287000057.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-S02J06T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287000057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 111K 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 4.1K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 11:55 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-S02J06T10-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-15

=== Now, execution of the tool begins

BK_START 1621375713465

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 22:08:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-18 22:08:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 22:08:35] [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:08:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 614 ms
[2021-05-18 22:08:35] [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:08:35] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2021-05-18 22:08:35] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2021-05-18 22:08:35] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2021-05-18 22:08:35] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2021-05-18 22:08:35] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2021-05-18 22:08:35] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2021-05-18 22:08:35] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 27 ms.
[2021-05-18 22:08:35] [INFO ] Computed order based on color domains.
[2021-05-18 22:08:35] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1652 transitions in 30 ms.
[2021-05-18 22:08:35] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 70 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 9 resets, run finished after 611 ms. (steps per millisecond=163 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1]
[2021-05-18 22:08:36] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2021-05-18 22:08:36] [INFO ] Computed 58 place invariants in 65 ms
[2021-05-18 22:08:36] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned unsat
[2021-05-18 22:08:36] [INFO ] [Real]Absence check using 14 positive place invariants in 33 ms returned sat
[2021-05-18 22:08:36] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 44 ms returned unsat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 40 ms returned unsat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 42 ms returned unsat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned unsat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 49 ms returned unsat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 40 ms returned unsat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 45 ms returned unsat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned unsat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned unsat
[2021-05-18 22:08:37] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned unsat
[2021-05-18 22:08:38] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2021-05-18 22:08:38] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 54 ms returned sat
[2021-05-18 22:08:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:08:41] [INFO ] [Real]Absence check using state equation in 3348 ms returned sat
[2021-05-18 22:08:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:08:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 28 ms returned sat
[2021-05-18 22:08:41] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 57 ms returned sat
[2021-05-18 22:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:08:44] [INFO ] [Nat]Absence check using state equation in 3274 ms returned sat
[2021-05-18 22:08:44] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-18 22:08:47] [INFO ] [Nat]Added 130 Read/Feed constraints in 2359 ms returned sat
[2021-05-18 22:08:47] [INFO ] Deduced a trap composed of 432 places in 511 ms
[2021-05-18 22:08:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 22:09:02] [INFO ] Deduced a trap composed of 495 places in 597 ms
[2021-05-18 22:09:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s26 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s182 s183 s184 s185 s187 s188 s189 s190 s191 s196 s206 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s243 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s285 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s331 s332 s333 s334 s335 s336 s337 s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s376 s377 s378 s379 s380 s381 s382 s383 s384 s385 s393 s394 s395 s396 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s426 s427 s428 s429 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 s478 s479 s480 s481 s482 s483 s484 s485 s486 s487 s488 s489 s505 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 s528 s529 s530 s546 s547 s548 s549 s550 s551 s552 s553 s554 s555 s560 s570 s580 s590 s600 s606 s607 s608 s609 s610 s611 s612 s613 s614 s615 s616 s617 s618 s619 s620 s621 s622 s623 s624 s625 s658 s659 s660 s661 s662 s663 s664 s665 s666 s667 s668 s669 s670 s671 s672 s673 s674 s675 s676 s677 s698 s699 s700 s701 s702 s703 s704 s705 s706 s707 s708 s709 s710 s711 s712 s713 s714 s715 s716 s717 s718 s719 s720 s721 s722 s723 s724 s725 s726 s727 s730 s731 s732 s733 s734 s735 s736 s737 s738 s739 s741 s764 s765 s766 s767 s768 s769 s770 s771 s772 s773 s774 s775 s776 s777 s778 s779 s780 s781 s782 s783 s784 s785 s786 s787 s788 s789 s790 s791 s792 s793 s794 s795 s796 s797 s798 s799 s800 s801 s802 s803 s804 s805 s806 s807 s808 s809 s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835 s836 s837 s838 s839 s840 s841 s842 s843) 0)") while checking expression at index 11
[2021-05-18 22:09:02] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned unsat
[2021-05-18 22:09:02] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned unsat
[2021-05-18 22:09:02] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned unsat
[2021-05-18 22:09:02] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2021-05-18 22:09:02] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 44 ms returned unsat
[2021-05-18 22:09:02] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2021-05-18 22:09:02] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 61 ms returned sat
[2021-05-18 22:09:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:09:08] [INFO ] [Real]Absence check using state equation in 5384 ms returned sat
[2021-05-18 22:09:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:09:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2021-05-18 22:09:08] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 60 ms returned sat
[2021-05-18 22:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:09:12] [INFO ] [Nat]Absence check using state equation in 3979 ms returned sat
[2021-05-18 22:09:13] [INFO ] [Nat]Added 130 Read/Feed constraints in 969 ms returned sat
[2021-05-18 22:09:13] [INFO ] Deduced a trap composed of 73 places in 81 ms
[2021-05-18 22:09:13] [INFO ] Deduced a trap composed of 73 places in 108 ms
[2021-05-18 22:09:14] [INFO ] Deduced a trap composed of 73 places in 89 ms
[2021-05-18 22:09:14] [INFO ] Deduced a trap composed of 73 places in 462 ms
[2021-05-18 22:09:14] [INFO ] Deduced a trap composed of 73 places in 56 ms
[2021-05-18 22:09:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1583 ms
[2021-05-18 22:09:14] [INFO ] Computed and/alt/rep : 1650/32798/1630 causal constraints in 164 ms.
[2021-05-18 22:09:28] [INFO ] Added : 500 causal constraints over 100 iterations in 13318 ms. Result :unknown
[2021-05-18 22:09:28] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2021-05-18 22:09:28] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 39 ms returned unsat
Successfully simplified 16 atomic propositions for a total of 18 simplifications.
[2021-05-18 22:09:28] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-18 22:09:28] [INFO ] Flatten gal took : 272 ms
FORMULA PolyORBLF-COL-S02J06T10-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 22:09:28] [INFO ] Applying decomposition
[2021-05-18 22:09:28] [INFO ] Flatten gal took : 193 ms
[2021-05-18 22:09:28] [INFO ] Decomposing Gal with order
[2021-05-18 22:09:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 22:09:29] [INFO ] Removed a total of 4693 redundant transitions.
[2021-05-18 22:09:29] [INFO ] Flatten gal took : 283 ms
[2021-05-18 22:09:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 62 ms.
[2021-05-18 22:09:30] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2021-05-18 22:09:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-COL-S02J06T10 @ 3570 seconds

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

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

FORMULA PolyORBLF-COL-S02J06T10-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PolyORBLF-COL-S02J06T10-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J06T10-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J06T10-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3443
rslt: Output for LTLCardinality @ PolyORBLF-COL-S02J06T10

{
"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:09:30 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 491
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "G ((1 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211))",
"processed_size": 78,
"rewrites": 33
},
"result":
{
"edges": 540,
"markings": 540,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 573
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X ((p373 <= p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585))",
"processed_size": 81,
"rewrites": 33
},
"result":
{
"edges": 589,
"markings": 589,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 688
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X ((p243 <= p286)))",
"processed_size": 22,
"rewrites": 33
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 573
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G ((p439 <= p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635))",
"processed_size": 81,
"rewrites": 33
},
"result":
{
"edges": 551,
"markings": 551,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 688
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G (F ((X (G (((p497 <= 0) AND (p742 + p743 + 1 <= p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449)))) AND (p413 + 1 <= p288))))",
"processed_size": 147,
"rewrites": 33
},
"result":
{
"edges": 589,
"markings": 589,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 860
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"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 (F ((p287 <= p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425))))",
"processed_size": 89,
"rewrites": 33
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1147
},
"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": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X (F ((p245 <= p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489)))",
"processed_size": 85,
"rewrites": 33
},
"result":
{
"edges": 111216,
"markings": 63755,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1721
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1721
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "(p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + 1 <= p386 + p387 + p388 + p389 + p390 + p391 + p392)",
"processed_size": 123,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 160
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3443
},
"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": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "X (G ((p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + 1 <= p386 + p387 + p388 + p389 + p390 + p391 + p392)))",
"processed_size": 131,
"rewrites": 33
},
"result":
{
"edges": 589,
"markings": 589,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "F (G ((X ((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201)) AND (3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201))))",
"processed_size": 167,
"rewrites": 33
},
"result":
{
"edges": 591,
"markings": 590,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 59288,
"runtime": 127.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(**)) OR ((G(**) AND X(X(F(**)))) OR X(**))) : (X((X(**) U (F(*) AND **))) AND G(**)) : G(F((X(G(*)) AND *))) : X(X(F(**))) : X(F(**)) : (X(G(*)) AND F(**)) : F(G((X(**) AND **)))"
},
"net":
{
"arcs": 7182,
"conflict_clusters": 323,
"places": 844,
"places_significant": 786,
"singleton_clusters": 0,
"transitions": 1652
},
"result":
{
"preliminary_value": "yes no no yes yes no no ",
"value": "yes no no yes yes 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: 2496/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 27008
lola: finding significant places
lola: 844 places, 1652 transitions, 786 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: ((G ((1 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211)) U ((1 <= 0) U X (X ((p243 <= p286))))) OR X ((p373 <= p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585))) : (X ((X ((p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 <= p289 + p290 + p291 + p292 + p293 + p294 + p295)) U (NOT(G ((p244 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31))) AND (p289 + p290 + p291 + p292 + p293 + p294 + p295 + 1 <= p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402)))) AND G ((p439 <= p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635))) : G (NOT(X (G ((X (F (((p531 + p533 + p535 + p537 + p539 + p541 + p543 + p544 + p542 + p540 + p538 + p536 + p534 + p532 <= p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843) U X (((1 <= p497) OR (p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 <= p742 + p743)))))) OR X ((p288 <= p413))))))) : X (X (F ((p287 <= p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425)))) : ((0 <= 0) U X ((p245 <= p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489))) : (G (NOT(X ((p386 + p387 + p388 + p389 + p390 + p391 + p392 <= p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727)))) AND F ((p386 + p387 + p388 + p389 + p390 + p391 + p392 <= p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727))) : F (((0 <= 0) U G ((X ((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201)) AND (3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:528
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:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((p243 <= p286))) OR ((G ((1 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211)) AND X (X (F ((p243 <= p286))))) OR X ((p373 <= p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211))
lola: processed formula length: 78
lola: 33 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: 540 markings, 540 edges
lola: ========================================
lola: subprocess 1 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p373 <= p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p373 <= p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585))
lola: processed formula length: 81
lola: 33 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: 589 markings, 589 edges
lola: ========================================
lola: subprocess 2 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((p243 <= p286)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((p243 <= p286)))
lola: processed formula length: 22
lola: 33 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X ((p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 <= p289 + p290 + p291 + p292 + p293 + p294 + p295)) U (F ((p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + 1 <= p244)) AND (p289 + p290 + p291 + p292 + p293 + p294 + p295 + 1 <= p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402)))) AND G ((p439 <= p626 + p627 + p628 + p629 + p630 + p631 + p63... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p439 <= p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p439 <= p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635))
lola: processed formula length: 81
lola: 33 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: 551 markings, 551 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (G (((p497 <= 0) AND (p742 + p743 + 1 <= p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449)))) AND (p413 + 1 <= p288))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (G (((p497 <= 0) AND (p742 + p743 + 1 <= p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449)))) AND (p413 + 1 <= p288))))
lola: processed formula length: 147
lola: 33 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: 589 markings, 589 edges
lola: ========================================
lola: subprocess 3 will run for 860 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p287 <= p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p287 <= p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425))))
lola: processed formula length: 89
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 1147 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p245 <= p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p245 <= p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489)))
lola: processed formula length: 85
lola: 33 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: 63755 markings, 111216 edges
lola: ========================================
lola: subprocess 5 will run for 1721 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + 1 <= p386 + p387 + p388 + p389 + p390 + p391 + p392))) AND F ((p386 + p387 + p388 + p389 + p390 + p391 + p392 <= p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 1721 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p386 + p387 + p388 + p389 + p390 + p391 + p392 <= p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + 1 <= p386 + p387 + p388 + p389 + p390 + p391 + p392)
lola: processed formula length: 123
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 3443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + 1 <= p386 + p387 + p388 + p389 + p390 + p391 + p392)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + 1 <= p386 + p387 + p388 + p389 + p390 + p391 + p392)))
lola: processed formula length: 131
lola: 33 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: 589 markings, 589 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 3443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201)) AND (3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201)) AND (3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201))))
lola: processed formula length: 167
lola: 33 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: 590 markings, 591 edges
lola: RESULT
lola:
SUMMARY: yes no no yes yes no no
lola:
preliminary result: yes no no yes yes no no
lola: ========================================
lola: memory consumption: 59288 KB
lola: time consumption: 127 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-S02J06T10"
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-S02J06T10, 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-162089287000057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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