About the Execution of ITS-LoLa for PolyORBLF-COL-S06J06T04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.200 | 3600000.00 | 191066.00 | 77.90 | FFTFFFFFFFTTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871800387.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PolyORBLF-COL-S06J06T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871800387
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 5.0K Apr 12 05:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 12 05:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 11 05:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 05:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 10 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 9 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 154K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591149260880
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 01:54:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 01:54:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 01:54:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 01:54:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 640 ms
[2020-06-03 01:54:23] [INFO ] sort/places :
D4->DisablePollingE,DisablePollingB,Insert_Source_B,P_1119,P_2579,
Threads->AwakeTasks,IdleTasks,NotifyEventJobQueuedE,QueueJobE,P_2321,TryAllocateOneTaskE,TryAllocateOneTaskB,P_2318,EnablePollingE,EnablePollingB,FetchJobB,ScheduleTaskE_Check,ScheduleTaskB,Abort_Check_Sources_E,Abort_Check_Sources_B,NotifyEventSourceAddedB,Insert_Source_E,NotifyEventSourceAddedE,P_1113,ProcessingEvt,P_1155,nyo,P_1158,P_1159,P_1160,NotifyEventEndOfCheckSourcesB,NotifyEventEndOfCheckSourcesE,Check_Sources_B,Check_Sources_E,Idle,NotifyEventJobCompletedE,NotifyEventJobCompletedB,RunE,RunB,Perform_Work_E,Try_Check_Sources_B,Try_Check_Sources_E,P_1617,ScheduleTaskE_Idle,
D6->CreatedJobs,
Jobs->P_1725,P_1724,P_1712,AvailableJobId,
Dot->cJobCnt,JobCnt,cBlockedTasks,PollingAbort,cPollingAbort,BlockedTasks,MarkerWrite,P_1727,P_1726,MarkerRead,P_1717,P_1716,CanInjectEvent,SigAbort,NoSigAbort,P_1093,P_1095,P_1097,P_1099,cSources,cIsMonitoring,IsMonitoring,cIdleTasks,ORB_Lock,
Sources->DataOnSrc,PlaceSources,ModifiedSrc,AbourtToModifySrc,
D1->NotifyEventJobQueuedB,QueueJobB,FetchJobE,ScheduleTaskE_Work,
[2020-06-03 01:54:23] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2020-06-03 01:54:23] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2020-06-03 01:54:23] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2020-06-03 01:54:23] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2020-06-03 01:54:23] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2020-06-03 01:54:23] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2020-06-03 01:54:23] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 25 ms.
[2020-06-03 01:54:23] [INFO ] Computed order based on color domains.
[2020-06-03 01:54:23] [INFO ] Unfolded HLPN to a Petri net with 506 places and 1774 transitions in 39 ms.
[2020-06-03 01:54:23] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 92 ms.
Incomplete random walk after 100000 steps, including 426 resets, run finished after 638 ms. (steps per millisecond=156 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1]
[2020-06-03 01:54:23] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2020-06-03 01:54:23] [INFO ] Computed 54 place invariants in 112 ms
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive place invariants in 30 ms returned sat
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 22 ms returned unsat
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 20 ms returned unsat
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 31 ms returned unsat
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 33 ms returned unsat
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 19 ms returned unsat
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 24 ms returned unsat
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 28 ms returned sat
[2020-06-03 01:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:26] [INFO ] [Real]Absence check using state equation in 1828 ms returned sat
[2020-06-03 01:54:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:54:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 21 ms returned sat
[2020-06-03 01:54:26] [INFO ] [Nat]Absence check using 17 positive and 37 generalized place invariants in 36 ms returned unsat
[2020-06-03 01:54:26] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned unsat
[2020-06-03 01:54:26] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2020-06-03 01:54:27] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 34 ms returned unsat
[2020-06-03 01:54:27] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2020-06-03 01:54:27] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 26 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 11 simplifications.
[2020-06-03 01:54:27] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 01:54:27] [INFO ] Flatten gal took : 315 ms
[2020-06-03 01:54:27] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 01:54:27] [INFO ] Flatten gal took : 173 ms
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 01:54:27] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 01:54:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PolyORBLF-COL-S06J06T04 @ 3570 seconds
check_solution: Variable C29 = -0.152176141739 is below its lower bound 0
check_solution: Variable C689 = -0.152176141739 is below its lower bound 0
check_solution: Variable C1349 = -0.152176141739 is below its lower bound 0
check_solution: Variable C2009 = -0.152176141739 is below its lower bound 0
check_solution: Constraint R1 = 6.92883986826e-310 is above its equality of -10
check_solution: Constraint R8 = 5.62753283874e-311 is above its equality of -1
check_solution: Constraint R9 = 4.67900072019e-311 is above its equality of -1
check_solution: Constraint R10 = 1.35807730712e-311 is above its equality of -1
check_solution: Constraint R11 = 4.52621702343e-311 is above its equality of -1
check_solution: Constraint R12 = 1.2052936103e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 13.8769 (rel. error 10.4713)
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3401
rslt: Output for CTLCardinality @ 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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 01:54:28 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 284
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 310
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 53,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 53,
"visible_transitions": 0
},
"processed": "((p442 <= 1) OR (p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + 1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194))",
"processed_size": 386,
"rewrites": 22
},
"result":
{
"edges": 637024,
"markings": 327059,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 884
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 340
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "AF(((p152 <= p370 + p371 + p372 + p373) AND EX((2 <= p378 + p379 + p380 + p381))))",
"processed_size": 82,
"rewrites": 21
},
"net":
{
"conflict_clusters": 169,
"singleton_clusters": 0
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 378
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 44,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 44,
"visible_transitions": 0
},
"processed": "A(EX((p412 + p413 + p414 + p415 <= p287 + p288 + p289 + p290)) U ((p195 + 1 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125) AND (p386 + p387 + p388 + p389 + 1 <= p160 + p161 + p162 + p163 + p164 + p165 + p166)))",
"processed_size": 333,
"rewrites": 21
},
"net":
{
"conflict_clusters": 169,
"singleton_clusters": 0
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 425
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(AF((p99 + 1 <= p285)))",
"processed_size": 25,
"rewrites": 21
},
"net":
{
"conflict_clusters": 169,
"singleton_clusters": 0
},
"result":
{
"edges": 215,
"markings": 216,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 486
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "A (G (((1 <= p407 + p406 + p405 + p404) AND (p408 + p409 + p410 + p411 <= p272 + p273 + p274 + p275))))",
"processed_size": 103,
"rewrites": 21
},
"result":
{
"edges": 65,
"markings": 66,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 567
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(p239 <= p160 + p161 + p162 + p163 + p164 + p165 + p166)",
"processed_size": 56,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 681
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "A (((p432 + p433 + p434 + p435 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) U (p272 + p273 + p274 + p275 + 1 <= p412 + p413 + p414 + p415)))",
"processed_size": 265,
"rewrites": 24
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 36
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 681
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p357 + 1 <= p285)",
"processed_size": 18,
"rewrites": 23
},
"result":
{
"edges": 226219,
"markings": 78873,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 851
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 851
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "((p408 + p409 + p410 + p411 + 1 <= p428 + p429 + p430 + p431) OR (1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194))",
"processed_size": 267,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1134
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "A (((p378 + p379 + p380 + p381 + 1 <= p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41) R (p86 + p87 + p88 + p89 <= 2)))",
"processed_size": 237,
"rewrites": 24
},
"result":
{
"edges": 503,
"markings": 246,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 172
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1134
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1134
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "((2 <= p428 + p429 + p430 + p431) OR ((p432 + p433 + p434 + p435 <= p443) AND ((2 <= p100) OR (p420 + p421 + p422 + p423 <= p398 + p399 + p400 + p401 + p402 + p403))))",
"processed_size": 169,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1702
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(p386 + p387 + p388 + p389 + 1 <= p357)",
"processed_size": 39,
"rewrites": 22
},
"result":
{
"edges": 21,
"markings": 16,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 866
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3404
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": "A (G ((p287 + p288 + p289 + p290 <= p398 + p399 + p400 + p401 + p402 + p403)))",
"processed_size": 78,
"rewrites": 21
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1702
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1702
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(p6 + p7 + p8 + p9 <= p1)",
"processed_size": 25,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3404
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"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": 29,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 29,
"visible_transitions": 0
},
"processed": "EG(AF((p1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194)))",
"processed_size": 209,
"rewrites": 21
},
"net":
{
"conflict_clusters": 169,
"singleton_clusters": 0
},
"result":
{
"edges": 282198,
"markings": 259920,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3402
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3402
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E (G (((p195 <= p217) OR (p444 + p445 + p446 + p447 + p448 + p449 <= p420 + p421 + p422 + p423))))",
"processed_size": 99,
"rewrites": 20
},
"result":
{
"edges": 131,
"markings": 132,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 146
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E (G (((p195 <= p217) OR (p444 + p445 + p446 + p447 + p448 + p449 <= p420 + p421 + p422 + p423))))",
"processed_size": 99,
"rewrites": 20
},
"result":
{
"edges": 131,
"markings": 132,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 146
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"formula":
{
"count":
{
"A": 1,
"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": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "A (((p438 + p439 + p440 + p441 <= p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505) U (p370 + p371 + p372 + p373 <= p86 + p87 + p88 + p89)))",
"processed_size": 285,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 44
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 61104,
"runtime": 168.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((E(X(**)) U **)) : A(X(A(F(**)))) : (** OR A((* R *))) : (** OR A((** U **))) : (A(G(**)) OR (A(F(**)) AND **)) : A(F(A(G(**)))) : A(F((** AND E(X(**))))) : A(G(**)) : (A((** U **)) AND (E(G(**)) OR A(F(**)))) : TRUE : E(X(A(F(**)))) : (** OR E(G(A(F(**)))))"
},
"net":
{
"arcs": 10564,
"conflict_clusters": 169,
"places": 506,
"places_significant": 452,
"singleton_clusters": 0,
"transitions": 1774
},
"result":
{
"preliminary_value": "no no yes no no no no no yes yes no yes ",
"value": "no no yes no no no no no yes yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 CTLCardinality.xml
lola: A ((E (X ((p412 + p413 + p414 + p415 <= p287 + p288 + p289 + p290))) U ((p195 + 1 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125) AND (p386 + p387 + p388 + p389 + 1 <= p160 + p161 + p162 + p163 + p164 + p165 + p166)))) : A (X (A (F (((2 <= p442) AND (p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 <= p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314)))))) : (((p408 + p409 + p410 + p411 + 1 <= p428 + p429 + p430 + p431) OR (1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194)) OR NOT(E (((p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p378 + p379 + p380 + p381) U (3 <= p86 + p87 + p88 + p89))))) : ((p239 <= p160 + p161 + p162 + p163 + p164 + p165 + p166) OR A (((p432 + p433 + p434 + p435 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) U (p272 + p273 + p274 + p275 + 1 <= p412 + p413 + p414 + p415)))) : (A (G (A (G ((p287 + p288 + p289 + p290 <= p398 + p399 + p400 + p401 + p402 + p403))))) OR (A (F ((p357 <= p386 + p387 + p388 + p389))) AND ((2 <= p428 + p429 + p430 + p431) OR ((p432 + p433 + p434 + p435 <= p443) AND ((2 <= p100) OR (p420 + p421 + p422 + p423 <= p398 + p399 + p400 + p401 + p402 + p403)))))) : A (((0 <= 0) U A (G ((p285 <= p357))))) : A (F (((p152 <= p370 + p371 + p372 + p373) AND E (X ((2 <= p378 + p379 + p380 + p381)))))) : A (G (A (G (((1 <= p407 + p406 + p405 + p404) AND (p408 + p409 + p410 + p411 <= p272 + p273 + p274 + p275)))))) : ((A (((p6 + p7 + p8 + p9 <= p268 + p269 + p270 + p271) U (0 <= 0))) AND A (((p438 + p439 + p440 + p441 <= p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505) U (p370 + p371 + p372 + p373 <= p86 + p87 + p88 + p89)))) AND (E (G (((p195 <= p217) OR (p444 + p445 + p446 + p447 + p448 + p449 <= p420 + p421 + p422 + p423)))) OR A (F ((p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + 1 <= p81 + p80 + p79 + p78))))) : (E (G ((0 <= 0))) OR E (((p408 + p409 + p410 + p411 <= p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p67 + p68 + p69 + p70 + p71 + p72 + p73) U (1 <= 0)))) : E (X (A (F ((p99 + 1 <= p285))))) : ((p6 + p7 + p8 + p9 <= p1) OR E (G (A (F ((p1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((2 <= p442) AND (p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 <= 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 eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p442 <= 1) OR (p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + 1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194))
lola: processed formula length: 386
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p442) AND (p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 <= 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: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: 141430 markings, 255080 edges, 28286 markings/sec, 0 secs || sara is running 0 secs
lola: 282863 markings, 526408 edges, 28287 markings/sec, 5 secs || sara is running 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 327059 markings, 637024 edges
lola: ========================================
lola: subprocess 2 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p152 <= p370 + p371 + p372 + p373) AND E (X ((2 <= p378 + p379 + p380 + p381))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(((p152 <= p370 + p371 + p372 + p373) AND EX((2 <= p378 + p379 + p380 + p381))))
lola: processed formula length: 82
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 37 markings, 36 edges
lola: ========================================
lola: subprocess 3 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((p412 + p413 + p414 + p415 <= p287 + p288 + p289 + p290))) U ((p195 + 1 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125) AND (p386 + p387 + p388 + p389 + 1 <= p160 + p161 + p162 + p163 + p164 + p165 + p166))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EX((p412 + p413 + p414 + p415 <= p287 + p288 + p289 + p290)) U ((p195 + 1 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125) AND (p386 + p387 + p388 + p389 + 1 <= p160 + p161 + p162 + p163 + p164 + p165 + p166)))
lola: processed formula length: 333
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 37 markings, 36 edges
lola: ========================================
lola: subprocess 4 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((p99 + 1 <= p285)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF((p99 + 1 <= p285)))
lola: processed formula length: 25
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 216 markings, 215 edges
lola: ========================================
lola: subprocess 5 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p407 + p406 + p405 + p404) AND (p408 + p409 + p410 + p411 <= p272 + p273 + p274 + p275))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p407 + p406 + p405 + p404) AND (p408 + p409 + p410 + p411 <= p272 + p273 + p274 + p275))))
lola: processed formula length: 103
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p407 + p406 + p405 + p404 <= 0) OR (p272 + p273 + p274 + p275 + 1 <= p408 + p409 + p410 + p411))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 66 markings, 65 edges
lola: ========================================
lola: subprocess 6 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p239 <= p160 + p161 + p162 + p163 + p164 + p165 + p166) OR A (((p432 + p433 + p434 + p435 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) U (p272 + p273 + p274 + p275 + 1 <= p412 + p413 + p414 + p415))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p239 <= p160 + p161 + p162 + p163 + p164 + p165 + p166)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p239 <= p160 + p161 + p162 + p163 + p164 + p165 + p166)
lola: processed formula length: 56
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p432 + p433 + p434 + p435 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) U (p272 + p273 + p274 + p275 + 1 <= p412 + p413 + p414 + p415)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p432 + p433 + p434 + p435 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) U (p272 + p273 + p274 + p275 + 1 <= p412 + p413 + p414 + p415)))
lola: processed formula length: 265
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p432 + p433 + p434 + p435 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 21 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p285 <= p357)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p357 + 1 <= p285)
lola: processed formula length: 18
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p357 + 1 <= p285)
lola: state equation task get result unparse finished id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p285 <= p357)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: write sara problem file to CTLCardinality-7-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: try reading problem file CTLCardinality-7-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 78873 markings, 226219 edges
lola: ========================================
lola: subprocess 8 will run for 851 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p408 + p409 + p410 + p411 + 1 <= p428 + p429 + p430 + p431) OR (1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194)) OR A (((p378 + p379 + p380 + p381 + 1 <= p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 851 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p408 + p409 + p410 + p411 + 1 <= p428 + p429 + p430 + p431) OR (1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p408 + p409 + p410 + p411 + 1 <= p428 + p429 + p430 + p431) OR (1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194))
lola: processed formula length: 267
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 1134 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p378 + p379 + p380 + p381 + 1 <= p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41) R (p86 + p87 + p88 + p89 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((p378 + p379 + p380 + p381 + 1 <= p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41) R (p86 + p87 + p88 + p89 <= 2)))
lola: processed formula length: 237
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p86 + p87 + p88 + p89)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 246 markings, 503 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 1134 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p287 + p288 + p289 + p290 <= p398 + p399 + p400 + p401 + p402 + p403))) OR (A (F ((p357 <= p386 + p387 + p388 + p389))) AND ((2 <= p428 + p429 + p430 + p431) OR ((p432 + p433 + p434 + p435 <= p443) AND ((2 <= p100) OR (p420 + p421 + p422 + p423 <= p398 + p399 + p400 + p401 + p402 + p403))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1134 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p428 + p429 + p430 + p431) OR ((p432 + p433 + p434 + p435 <= p443) AND ((2 <= p100) OR (p420 + p421 + p422 + p423 <= p398 + p399 + p400 + p401 + p402 + p403))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p428 + p429 + p430 + p431) OR ((p432 + p433 + p434 + p435 <= p443) AND ((2 <= p100) OR (p420 + p421 + p422 + p423 <= p398 + p399 + p400 + p401 + p402 + p403))))
lola: processed formula length: 169
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 1702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p357 <= p386 + p387 + p388 + p389)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p386 + p387 + p388 + p389 + 1 <= p357)
lola: processed formula length: 39
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p357 <= p386 + p387 + p388 + p389)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 16 markings, 21 edges
lola: ========================================
lola: subprocess 11 will run for 3404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p287 + p288 + p289 + p290 <= p398 + p399 + p400 + p401 + p402 + p403)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p287 + p288 + p289 + p290 <= p398 + p399 + p400 + p401 + p402 + p403)))
lola: processed formula length: 78
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p398 + p399 + p400 + p401 + p402 + p403 + 1 <= p287 + p288 + p289 + p290)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 1702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p6 + p7 + p8 + p9 <= p1) OR E (G (A (F ((p1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p6 + p7 + p8 + p9 <= p1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p6 + p7 + p8 + p9 <= p1)
lola: processed formula length: 25
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 3404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((p1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194)))
lola: processed formula length: 209
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 259920 markings, 282198 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 3402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p438 + p439 + p440 + p441 <= p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505) U (p370 + p371 + p372 + p373 <= p86 + p87 + p88 + p89))) AND (E (G (((p195 <= p217) OR (p444 + p445 + p446 + p447 + p448 + p449 <= p420 + p421 + p422 + p423)))) OR A (F ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p195 <= p217) OR (p444 + p445 + p446 + p447 + p448 + p449 <= p420 + p421 + p422 + p423))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p195 <= p217) OR (p444 + p445 + p446 + p447 + p448 + p449 <= p420 + p421 + p422 + p423))))
lola: processed formula length: 99
lola: 20 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p217 + 1 <= p195) AND (p420 + p421 + p422 + p423 + 1 <= p444 + p445 + p446 + p447 + p448 + p449))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 132 markings, 131 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (((p438 + p439 + p440 + p441 <= p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505) U (p370 + p371 + p372 + p373 <= p86 + p87 + p88 + p89))) AND (E (G (((p195 <= p217) OR (p444 + p445 + p446 + p447 + p448 + p449 <= p420 + p421 + p422 + p423)))) OR A (F ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G (((p195 <= p217) OR (p444 + p445 + p446 + p447 + p448 + p449 <= p420 + p421 + p422 + p423))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p195 <= p217) OR (p444 + p445 + p446 + p447 + p448 + p449 <= p420 + p421 + p422 + p423))))
lola: processed formula length: 99
lola: 20 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p217 + 1 <= p195) AND (p420 + p421 + p422 + p423 + 1 <= p444 + p445 + p446 + p447 + p448 + p449))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 132 markings, 131 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((p438 + p439 + p440 + p441 <= p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505) U (p370 + p371 + p372 + p373 <= p86 + p87 + p88 + p89)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p438 + p439 + p440 + p441 <= p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505) U (p370 + p371 + p372 + p373 <= p86 + p87 + p88 + p89)))
lola: processed formula length: 285
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: 0
lola: formula 0: (p438 + p439 + p440 + p441 <= p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no no yes yes no yes
lola:
preliminary result: no no yes no no no no no yes yes no yes
lola: memory consumption: 61104 KB
lola: time consumption: 168 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="CTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is PolyORBLF-COL-S06J06T04, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871800387"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;