About the Execution of ITS-LoLa for PolyORBLF-COL-S02J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15758.460 | 3600000.00 | 271556.00 | 1669.90 | FFFTTTFTFTFFFFFT | 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-158987871600291.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-S02J06T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871600291
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 4.9K Apr 12 05:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 12 05:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 11 04:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 04:56 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:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 17:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 17:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:22 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-S02J06T06-CTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591140847903
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:34:09] [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-02 23:34:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:34:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 23:34:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 550 ms
[2020-06-02 23:34:10] [INFO ] sort/places :
D4->DisablePollingE,DisablePollingB,Insert_Source_B,P_1119,P_2579,
Threads->AwakeTasks,IdleTasks,NotifyEventJobQueuedE,QueueJobE,P_2321,TryAllocateOneTaskE,TryAllocateOneTaskB,P_2318,EnablePollingE,EnablePollingB,FetchJobB,ScheduleTaskE_Check,ScheduleTaskB,Abort_Check_Sources_E,Abort_Check_Sources_B,NotifyEventSourceAddedB,Insert_Source_E,NotifyEventSourceAddedE,P_1113,ProcessingEvt,P_1155,nyo,P_1158,P_1159,P_1160,NotifyEventEndOfCheckSourcesB,NotifyEventEndOfCheckSourcesE,Check_Sources_B,Check_Sources_E,Idle,NotifyEventJobCompletedE,NotifyEventJobCompletedB,RunE,RunB,Perform_Work_E,Try_Check_Sources_B,Try_Check_Sources_E,P_1617,ScheduleTaskE_Idle,
D6->CreatedJobs,
Jobs->P_1725,P_1724,P_1712,AvailableJobId,
Dot->cJobCnt,JobCnt,cBlockedTasks,PollingAbort,cPollingAbort,BlockedTasks,MarkerWrite,P_1727,P_1726,MarkerRead,P_1717,P_1716,CanInjectEvent,SigAbort,NoSigAbort,P_1093,P_1095,P_1097,P_1099,cSources,cIsMonitoring,IsMonitoring,cIdleTasks,ORB_Lock,
Sources->DataOnSrc,PlaceSources,ModifiedSrc,AbourtToModifySrc,
D1->NotifyEventJobQueuedB,QueueJobB,FetchJobE,ScheduleTaskE_Work,
[2020-06-02 23:34:10] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2020-06-02 23:34:10] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2020-06-02 23:34:10] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2020-06-02 23:34:10] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2020-06-02 23:34:10] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2020-06-02 23:34:10] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2020-06-02 23:34:10] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 33 ms.
[2020-06-02 23:34:10] [INFO ] Computed order based on color domains.
[2020-06-02 23:34:10] [INFO ] Unfolded HLPN to a Petri net with 536 places and 968 transitions in 27 ms.
[2020-06-02 23:34:10] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 77 ms.
Incomplete random walk after 100000 steps, including 20 resets, run finished after 923 ms. (steps per millisecond=108 ) properties seen :[1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1]
[2020-06-02 23:34:11] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2020-06-02 23:34:11] [INFO ] Computed 50 place invariants in 115 ms
[2020-06-02 23:34:11] [INFO ] [Real]Absence check using 17 positive place invariants in 41 ms returned sat
[2020-06-02 23:34:11] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 37 ms returned sat
[2020-06-02 23:34:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:34:12] [INFO ] [Real]Absence check using state equation in 1210 ms returned sat
[2020-06-02 23:34:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:34:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 35 ms returned sat
[2020-06-02 23:34:13] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 95 ms returned unsat
[2020-06-02 23:34:13] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned unsat
[2020-06-02 23:34:13] [INFO ] [Real]Absence check using 17 positive place invariants in 39 ms returned sat
[2020-06-02 23:34:13] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 52 ms returned unsat
[2020-06-02 23:34:13] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2020-06-02 23:34:13] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 21 ms returned unsat
[2020-06-02 23:34:13] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2020-06-02 23:34:13] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 25 ms returned unsat
[2020-06-02 23:34:13] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned unsat
[2020-06-02 23:34:13] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2020-06-02 23:34:13] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 24 ms returned unsat
[2020-06-02 23:34:14] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2020-06-02 23:34:14] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 31 ms returned sat
[2020-06-02 23:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:34:15] [INFO ] [Real]Absence check using state equation in 1385 ms returned sat
[2020-06-02 23:34:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:34:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-06-02 23:34:15] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 35 ms returned sat
[2020-06-02 23:34:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:34:21] [INFO ] [Nat]Absence check using state equation in 5673 ms returned sat
[2020-06-02 23:34:21] [INFO ] State equation strengthened by 78 read => feed constraints.
[2020-06-02 23:34:21] [INFO ] [Nat]Added 78 Read/Feed constraints in 119 ms returned sat
[2020-06-02 23:34:21] [INFO ] Deduced a trap composed of 73 places in 393 ms
[2020-06-02 23:34:22] [INFO ] Deduced a trap composed of 73 places in 159 ms
[2020-06-02 23:34:22] [INFO ] Deduced a trap composed of 73 places in 137 ms
[2020-06-02 23:34:22] [INFO ] Deduced a trap composed of 73 places in 116 ms
[2020-06-02 23:34:22] [INFO ] Deduced a trap composed of 73 places in 54 ms
[2020-06-02 23:34:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1343 ms
[2020-06-02 23:34:22] [INFO ] Computed and/alt/rep : 966/12574/954 causal constraints in 103 ms.
[2020-06-02 23:34:33] [INFO ] Added : 115 causal constraints over 23 iterations in 10644 ms. Result :unknown
[2020-06-02 23:34:33] [INFO ] [Real]Absence check using 17 positive place invariants in 41 ms returned sat
[2020-06-02 23:34:33] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 40 ms returned sat
[2020-06-02 23:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:34:34] [INFO ] [Real]Absence check using state equation in 1314 ms returned sat
[2020-06-02 23:34:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:34:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2020-06-02 23:34:35] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 25 ms returned sat
[2020-06-02 23:34:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:34:36] [INFO ] [Nat]Absence check using state equation in 1229 ms returned sat
[2020-06-02 23:34:36] [INFO ] [Nat]Added 78 Read/Feed constraints in 350 ms returned sat
[2020-06-02 23:34:37] [INFO ] Deduced a trap composed of 97 places in 393 ms
[2020-06-02 23:34:37] [INFO ] Deduced a trap composed of 232 places in 321 ms
[2020-06-02 23:34:37] [INFO ] Deduced a trap composed of 83 places in 332 ms
[2020-06-02 23:34:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1292 ms
[2020-06-02 23:34:38] [INFO ] Computed and/alt/rep : 966/12574/954 causal constraints in 109 ms.
[2020-06-02 23:34:54] [INFO ] Added : 385 causal constraints over 77 iterations in 17032 ms. Result :unknown
[2020-06-02 23:34:55] [INFO ] [Real]Absence check using 17 positive place invariants in 39 ms returned sat
[2020-06-02 23:34:55] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 51 ms returned sat
[2020-06-02 23:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:34:56] [INFO ] [Real]Absence check using state equation in 1185 ms returned sat
[2020-06-02 23:34:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:34:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 30 ms returned sat
[2020-06-02 23:34:56] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 37 ms returned sat
[2020-06-02 23:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:34:57] [INFO ] [Nat]Absence check using state equation in 1447 ms returned sat
[2020-06-02 23:34:58] [INFO ] [Nat]Added 78 Read/Feed constraints in 131 ms returned sat
[2020-06-02 23:34:58] [INFO ] Deduced a trap composed of 67 places in 417 ms
[2020-06-02 23:34:59] [INFO ] Deduced a trap composed of 304 places in 427 ms
[2020-06-02 23:34:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1112 ms
[2020-06-02 23:34:59] [INFO ] Computed and/alt/rep : 966/12574/954 causal constraints in 118 ms.
[2020-06-02 23:35:05] [INFO ] Added : 115 causal constraints over 23 iterations in 6138 ms. Result :sat
[2020-06-02 23:35:05] [INFO ] Deduced a trap composed of 73 places in 118 ms
[2020-06-02 23:35:07] [INFO ] Deduced a trap composed of 74 places in 112 ms
[2020-06-02 23:35:09] [INFO ] Deduced a trap composed of 292 places in 398 ms
[2020-06-02 23:35:10] [INFO ] Deduced a trap composed of 289 places in 410 ms
[2020-06-02 23:35:11] [INFO ] Deduced a trap composed of 73 places in 111 ms
[2020-06-02 23:35:12] [INFO ] Deduced a trap composed of 15 places in 376 ms
[2020-06-02 23:35:12] [INFO ] Deduced a trap composed of 262 places in 340 ms
[2020-06-02 23:35:14] [INFO ] Deduced a trap composed of 73 places in 114 ms
[2020-06-02 23:35:16] [INFO ] Deduced a trap composed of 336 places in 378 ms
[2020-06-02 23:35:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:35:16] [INFO ] Deduced a trap composed of 73 places in 312 ms
[2020-06-02 23:35:16] [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 (> (+ s15 s27 s28 s29 s30 s31 s32 s33 s63 s75 s76 s77 s78 s79 s80 s81 s111 s129 s135 s141 s152 s153 s164 s165 s198 s199 s200 s201 s202 s203 s204 s237 s250 s256 s265 s271 s281 s288 s289 s299 s305 s322 s329 s330 s355 s361 s367 s373 s379 s385 s391 s397 s403 s409 s417 s423 s429 s435 s441 s447 s453 s459 s467 s478 s479 s489 s501 s502 s503 s504 s505 s506 s507) 0)") while checking expression at index 9
[2020-06-02 23:35:16] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2020-06-02 23:35:16] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 25 ms returned sat
[2020-06-02 23:35:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:35:17] [INFO ] [Real]Absence check using state equation in 1139 ms returned sat
[2020-06-02 23:35:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:35:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 35 ms returned sat
[2020-06-02 23:35:18] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 3 ms returned unsat
[2020-06-02 23:35:18] [INFO ] [Real]Absence check using 17 positive place invariants in 31 ms returned sat
[2020-06-02 23:35:18] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 5 ms returned unsat
[2020-06-02 23:35:18] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2020-06-02 23:35:18] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 22 ms returned unsat
[2020-06-02 23:35:18] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2020-06-02 23:35:18] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 2 ms returned unsat
[2020-06-02 23:35:18] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2020-06-02 23:35:18] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 34 ms returned sat
[2020-06-02 23:35:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:35:19] [INFO ] [Real]Absence check using state equation in 1307 ms returned sat
[2020-06-02 23:35:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:35:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-06-02 23:35:19] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 35 ms returned sat
[2020-06-02 23:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:35:21] [INFO ] [Nat]Absence check using state equation in 1371 ms returned sat
[2020-06-02 23:35:21] [INFO ] [Nat]Added 78 Read/Feed constraints in 345 ms returned sat
[2020-06-02 23:35:21] [INFO ] Computed and/alt/rep : 966/12574/954 causal constraints in 144 ms.
[2020-06-02 23:35:28] [INFO ] Added : 130 causal constraints over 26 iterations in 6500 ms. Result :sat
[2020-06-02 23:35:28] [INFO ] Deduced a trap composed of 73 places in 79 ms
[2020-06-02 23:35:28] [INFO ] Deduced a trap composed of 74 places in 122 ms
[2020-06-02 23:35:29] [INFO ] Deduced a trap composed of 73 places in 70 ms
[2020-06-02 23:35:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1016 ms
[2020-06-02 23:35:29] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2020-06-02 23:35:29] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 5 ms returned unsat
[2020-06-02 23:35:29] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned unsat
[2020-06-02 23:35:29] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned unsat
[2020-06-02 23:35:29] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2020-06-02 23:35:29] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 46 ms returned sat
[2020-06-02 23:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:35:30] [INFO ] [Real]Absence check using state equation in 1270 ms returned sat
[2020-06-02 23:35:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:35:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2020-06-02 23:35:31] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 22 ms returned unsat
[2020-06-02 23:35:31] [INFO ] [Real]Absence check using 17 positive place invariants in 35 ms returned sat
[2020-06-02 23:35:31] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 20 ms returned unsat
[2020-06-02 23:35:31] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2020-06-02 23:35:31] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 29 ms returned unsat
[2020-06-02 23:35:31] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-06-02 23:35:31] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 61 ms returned sat
[2020-06-02 23:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:35:32] [INFO ] [Real]Absence check using state equation in 1462 ms returned sat
[2020-06-02 23:35:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:35:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2020-06-02 23:35:33] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 33 ms returned sat
[2020-06-02 23:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:35:34] [INFO ] [Nat]Absence check using state equation in 1899 ms returned sat
[2020-06-02 23:35:35] [INFO ] [Nat]Added 78 Read/Feed constraints in 134 ms returned sat
[2020-06-02 23:35:35] [INFO ] Deduced a trap composed of 74 places in 61 ms
[2020-06-02 23:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2020-06-02 23:35:35] [INFO ] Computed and/alt/rep : 966/12574/954 causal constraints in 77 ms.
[2020-06-02 23:35:52] [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: Broken pipe (=> (> t627 0) (and (and (> t675 0) (< o675 o627)) (and (> t432 0) (< o432 o627)) (and (> t433 0) (< o433 o627))))") while checking expression at index 21
Successfully simplified 17 atomic propositions for a total of 17 simplifications.
[2020-06-02 23:35:53] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-02 23:35:53] [INFO ] Flatten gal took : 360 ms
[2020-06-02 23:35:53] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-02 23:35:53] [INFO ] Flatten gal took : 226 ms
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:35:53] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 47 ms.
[2020-06-02 23:35:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 23 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PolyORBLF-COL-S02J06T06 @ 3570 seconds
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3496
rslt: Output for CTLCardinality @ PolyORBLF-COL-S02J06T06
{
"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": "Tue Jun 2 23:35:54 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 62,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 62,
"visible_transitions": 0
},
"processed": "AF((((1 <= p140 + p141 + p142 + p143 + p144 + p145) OR (p440 + p441 + p442 + p443 + p444 + p445 + 1 <= p378 + p379 + p380 + p381 + p382 + p383)) OR AX((p262 + p263 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232))))",
"processed_size": 463,
"rewrites": 15
},
"net":
{
"conflict_clusters": 199,
"singleton_clusters": 0
},
"result":
{
"edges": 1746,
"markings": 1746,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p176 <= 0)",
"processed_size": 11,
"rewrites": 16
},
"result":
{
"edges": 37615,
"markings": 23580,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 84
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 73,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 73,
"visible_transitions": 0
},
"processed": "E (G (((p402 + p403 + p404 + p405 + p406 + p407 <= p147) OR (p8 + p9 + p13 + p12 + p11 + p10 + 1 <= p452 + p453 + p454 + p455 + p456 + p457) OR ((p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 <= p92 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))))",
"processed_size": 497,
"rewrites": 14
},
"result":
{
"edges": 5096415,
"markings": 4230396,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 384
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 582
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "AF(EG((3 <= p321 + p322 + p323 + p324 + p325 + p326)))",
"processed_size": 54,
"rewrites": 15
},
"net":
{
"conflict_clusters": 199,
"singleton_clusters": 0
},
"result":
{
"edges": 614,
"markings": 307,
"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": 699
},
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "AF(EG((p236 + p237 + p238 + p239 + p240 + p241 + 1 <= p14 + p15 + p16 + p17 + p18 + p19)))",
"processed_size": 90,
"rewrites": 15
},
"net":
{
"conflict_clusters": 199,
"singleton_clusters": 0
},
"result":
{
"edges": 634,
"markings": 316,
"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": 874
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 50,
"visible_transitions": 0
},
"processed": "EG((AG((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 <= p464)) OR ((p116 + p117 + p118 + p119 + p120 + p121 <= p353) AND (p116 + p117 + p118 + p119 + p120 + p121 <= 2))))",
"processed_size": 417,
"rewrites": 15
},
"net":
{
"conflict_clusters": 199,
"singleton_clusters": 0
},
"result":
{
"edges": 17862,
"markings": 12291,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1165
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1165
},
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(NOT DEADLOCK OR (p339 + p341 + p343 + p345 + p347 + p349 + p351 + p352 + p350 + p348 + p346 + p344 + p342 + p340 <= p2 + p3 + p4 + p5 + p6 + p7))",
"processed_size": 146,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1748
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "A (G (((p396 + p397 + p398 + p399 + p400 + p401 <= p298 + p299 + p300 + p301 + p302 + p303) OR (2 <= p418 + p419 + p420 + p421 + p417 + p416))))",
"processed_size": 145,
"rewrites": 15
},
"result":
{
"edges": 178,
"markings": 179,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1748
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1748
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((p255 + p256 + p257 + p258 + p259 + p260 <= p149) AND ((2 <= p472) OR (p353 <= p384 + p385 + p386 + p387 + p388 + p389)))",
"processed_size": 123,
"rewrites": 13
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3496
},
"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": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "A (G ((p440 + p441 + p442 + p443 + p444 + p445 + 1 <= p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p487 + p486)))",
"processed_size": 138,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3496
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3496
},
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "((p66 + p65 + p64 + p63 + p62 + p67 <= 1) OR (p440 + p441 + p442 + p443 + p444 + p445 <= 2))",
"processed_size": 93,
"rewrites": 16
},
"result":
{
"edges": 679,
"markings": 679,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 144
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "E (G ((p133 + p132 + p131 + p130 + p129 + p128 <= p339 + p341 + p343 + p345 + p347 + p349 + p351 + p352 + p350 + p348 + p346 + p344 + p342 + p340)))",
"processed_size": 148,
"rewrites": 14
},
"result":
{
"edges": 580,
"markings": 580,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 180
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 30048,
"runtime": 74.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G((A(G(**)) OR **))) : (A(G(**)) AND (NODEADLOCK OR **)) : E(G(**)) : A(F(**)) : A(F((** OR A(X(**))))) : (E((** U **)) AND (E(F(*)) AND A(F(**)))) : A(F(E(G(**)))) : A(F(E(G(**)))) : (E(G(**)) OR (A(G(**)) OR **))"
},
"net":
{
"arcs": 4194,
"conflict_clusters": 199,
"places": 536,
"places_significant": 486,
"singleton_clusters": 0,
"transitions": 968
},
"result":
{
"preliminary_value": "no no yes yes yes no no no yes ",
"value": "no no yes yes yes no no 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: 1504/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 17152
lola: finding significant places
lola: 536 places, 968 transitions, 486 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: LP says that atomic proposition is always false: (2 <= p276)
lola: LP says that atomic proposition is always false: (2 <= p304 + p305 + p306 + p307 + p308 + p309)
lola: LP says that atomic proposition is always false: (2 <= p242 + p243 + p244 + p245 + p246 + p247 + p248)
lola: LP says that atomic proposition is always true: (3 <= p310 + p311 + p312 + p313 + p314 + p315 + p316)
lola: E (G ((A (G ((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 <= p464))) OR ((p116 + p117 + p118 + p119 + p120 + p121 <= p353) AND (p116 + p117 + p118 + p119 + p120 + p121 <= 2))))) : (A (G (((p396 + p397 + p398 + p399 + p400 + p401 <= p298 + p299 + p300 + p301 + p302 + p303) OR (2 <= p418 + p419 + p420 + p421 + p417 + p416)))) AND (E (X ((0 <= 0))) OR (p339 + p341 + p343 + p345 + p347 + p349 + p351 + p352 + p350 + p348 + p346 + p344 + p342 + p340 <= p2 + p3 + p4 + p5 + p6 + p7))) : E (G (((p402 + p403 + p404 + p405 + p406 + p407 <= p147) OR (p8 + p9 + p13 + p12 + p11 + p10 + 1 <= p452 + p453 + p454 + p455 + p456 + p457) OR ((p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 <= p92 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))) : (E (G ((1 <= 0))) OR A (F ((1 <= p176)))) : A (F ((((1 <= p140 + p141 + p142 + p143 + p144 + p145) OR (p440 + p441 + p442 + p443 + p444 + p445 + 1 <= p378 + p379 + p380 + p381 + p382 + p383)) OR A (X ((p262 + p263 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232)))))) : ((E (((p372 + p373 + p374 + p375 + p376 + p377 <= p428 + p429 + p430 + p431 + p432 + p433) U ((1 <= p464) OR (p110 + p111 + p112 + p113 + p114 + p115 <= p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p61)))) AND NOT(A (G ((p458 + p459 + p460 + p461 + p462 + p463 <= p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p61))))) AND A (F (((2 <= p66 + p65 + p64 + p63 + p62 + p67) AND (3 <= p440 + p441 + p442 + p443 + p444 + p445))))) : A (((0 <= 0) U E (G ((3 <= p321 + p322 + p323 + p324 + p325 + p326))))) : A (F (E (G ((p236 + p237 + p238 + p239 + p240 + p241 + 1 <= p14 + p15 + p16 + p17 + p18 + p19))))) : ((E (G ((p133 + p132 + p131 + p130 + p129 + p128 <= p339 + p341 + p343 + p345 + p347 + p349 + p351 + p352 + p350 + p348 + p346 + p344 + p342 + p340))) OR A (G ((p440 + p441 + p442 + p443 + p444 + p445 + 1 <= p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p487 + p486)))) OR ((p255 + p256 + p257 + p258 + p259 + p260 <= p149) AND ((2 <= p472) OR (p353 <= p384 + p385 + p386 + p387 + p388 + p389))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p140 + p141 + p142 + p143 + p144 + p145) OR (p440 + p441 + p442 + p443 + p444 + p445 + 1 <= p378 + p379 + p380 + p381 + p382 + p383)) OR A (X ((p262 + p263 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((1 <= p140 + p141 + p142 + p143 + p144 + p145) OR (p440 + p441 + p442 + p443 + p444 + p445 + 1 <= p378 + p379 + p380 + p381 + p382 + p383)) OR AX((p262 + p263 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p... (shortened)
lola: processed formula length: 463
lola: 15 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1746 markings, 1746 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p176)))
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: (p176 <= 0)
lola: processed formula length: 11
lola: 16 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: (1 <= p176)
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: 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 23580 markings, 37615 edges
lola: ========================================
lola: subprocess 2 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p402 + p403 + p404 + p405 + p406 + p407 <= p147) OR (p8 + p9 + p13 + p12 + p11 + p10 + 1 <= p452 + p453 + p454 + p455 + p456 + p457) OR ((p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 <= p92 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p402 + p403 + p404 + p405 + p406 + p407 <= p147) OR (p8 + p9 + p13 + p12 + p11 + p10 + 1 <= p452 + p453 + p454 + p455 + p456 + p457) OR ((p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 <= p92 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p... (shortened)
lola: processed formula length: 497
lola: 14 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: ((p147 + 1 <= p402 + p403 + p404 + p405 + p406 + p407) AND (p452 + p453 + p454 + p455 + p456 + p457 <= p8 + p9 + p13 + p12 + p11 + p10) AND ((p92 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: 294202 markings, 346139 edges, 58840 markings/sec, 0 secs || sara is running 0 secs
lola: 627050 markings, 754449 edges, 66570 markings/sec, 5 secs || sara is running 5 secs
lola: 958992 markings, 1168415 edges, 66388 markings/sec, 10 secs || sara is running 10 secs
lola: 1286498 markings, 1567651 edges, 65501 markings/sec, 15 secs || sara is running 15 secs
lola: 1605984 markings, 1946675 edges, 63897 markings/sec, 20 secs || sara is running 20 secs
lola: 1879160 markings, 2253240 edges, 54635 markings/sec, 25 secs || sara is running 25 secs
lola: 2159111 markings, 2580618 edges, 55990 markings/sec, 30 secs || sara is running 30 secs
lola: 2458350 markings, 2929478 edges, 59848 markings/sec, 35 secs || sara is running 35 secs
lola: 2762530 markings, 3285297 edges, 60836 markings/sec, 40 secs || sara is running 40 secs
lola: 3113921 markings, 3713898 edges, 70278 markings/sec, 45 secs || sara is running 45 secs
lola: 3472161 markings, 4154935 edges, 71648 markings/sec, 50 secs || sara is running 50 secs
lola: 3825771 markings, 4585227 edges, 70722 markings/sec, 55 secs || sara is running 55 secs
lola: 4188004 markings, 5028285 edges, 72447 markings/sec, 60 secs || sara is running 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 4230396 markings, 5096415 edges
lola: ========================================
lola: subprocess 3 will run for 582 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((3 <= p321 + p322 + p323 + p324 + p325 + p326)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((3 <= p321 + p322 + p323 + p324 + p325 + p326)))
lola: processed formula length: 54
lola: 15 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 307 markings, 614 edges
lola: ========================================
lola: subprocess 4 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p236 + p237 + p238 + p239 + p240 + p241 + 1 <= p14 + p15 + p16 + p17 + p18 + p19)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((p236 + p237 + p238 + p239 + p240 + p241 + 1 <= p14 + p15 + p16 + p17 + p18 + p19)))
lola: processed formula length: 90
lola: 15 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 316 markings, 634 edges
lola: ========================================
lola: subprocess 5 will run for 874 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G ((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 <= p464))) OR ((p116 + p117 + p118 + p119 + p120 + p121 <= p353) AND (p116 + p117 + p118 + p11... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AG((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 <= p464)) OR ((p116 + p117 + p118 + p119 + p120 + p121 <= p353) AND (p116 + p117 + p118 + p119 + p12... (shortened)
lola: processed formula length: 417
lola: 15 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 12291 markings, 17862 edges
lola: ========================================
lola: subprocess 6 will run for 1165 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p396 + p397 + p398 + p399 + p400 + p401 <= p298 + p299 + p300 + p301 + p302 + p303) OR (2 <= p418 + p419 + p420 + p421 + p417 + p416)))) AND (NOT DEADLOCK OR (p339 + p341 + p343 + p345 + p347 + p349 + p351 + p352 + p350 + p348 + p346 + p344 + p342 + p340 <= p2 + p3 + p4 + p5 + p6 + p7)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 1165 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT DEADLOCK OR (p339 + p341 + p343 + p345 + p347 + p349 + p351 + p352 + p350 + p348 + p346 + p344 + p342 + p340 <= p2 + p3 + p4 + p5 + p6 + p7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (NOT DEADLOCK OR (p339 + p341 + p343 + p345 + p347 + p349 + p351 + p352 + p350 + p348 + p346 + p344 + p342 + p340 <= p2 + p3 + p4 + p5 + p6 + p7))
lola: processed formula length: 146
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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 7 will run for 1748 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p396 + p397 + p398 + p399 + p400 + p401 <= p298 + p299 + p300 + p301 + p302 + p303) OR (2 <= p418 + p419 + p420 + p421 + p417 + p416))))
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 (((p396 + p397 + p398 + p399 + p400 + p401 <= p298 + p299 + p300 + p301 + p302 + p303) OR (2 <= p418 + p419 + p420 + p421 + p417 + p416))))
lola: processed formula length: 145
lola: 15 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: ((p298 + p299 + p300 + p301 + p302 + p303 + 1 <= p396 + p397 + p398 + p399 + p400 + p401) AND (p418 + p419 + p420 + p421 + p417 + p416 <= 1))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 179 markings, 178 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 1748 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p133 + p132 + p131 + p130 + p129 + p128 <= p339 + p341 + p343 + p345 + p347 + p349 + p351 + p352 + p350 + p348 + p346 + p344 + p342 + p340))) OR (A (G ((p440 + p441 + p442 + p443 + p444 + p445 + 1 <= p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p487 + p486))) OR ((p255 + p256 + p257 + p258 + p259 + p260 <= p149) AND ((2 <= p472) OR (p353 <= p384 + p385 + p386 + p3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1748 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p255 + p256 + p257 + p258 + p259 + p260 <= p149) AND ((2 <= p472) OR (p353 <= p384 + p385 + p386 + p387 + p388 + p389)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p255 + p256 + p257 + p258 + p259 + p260 <= p149) AND ((2 <= p472) OR (p353 <= p384 + p385 + p386 + p387 + p388 + p389)))
lola: processed formula length: 123
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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 8 will run for 3496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p440 + p441 + p442 + p443 + p444 + p445 + 1 <= p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p487 + p486)))
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 ((p440 + p441 + p442 + p443 + p444 + p445 + 1 <= p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p487 + p486)))
lola: processed formula length: 138
lola: 15 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
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: (p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p487 + p486 <= p440 + p441 + p442 + p443 + p444 + p445)
lola: state equation task get result unparse finished id 0
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: subprocess 8 will run for 3496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p372 + p373 + p374 + p375 + p376 + p377 <= p428 + p429 + p430 + p431 + p432 + p433) U ((1 <= p464) OR (p110 + p111 + p112 + p113 + p114 + p115 <= p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p66 + p65 + p64 + p63 + p62 + p67) AND (3 <= p440 + p441 + p442 + p443 + p444 + p445))))
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: ((p66 + p65 + p64 + p63 + p62 + p67 <= 1) OR (p440 + p441 + p442 + p443 + p444 + p445 <= 2))
lola: processed formula length: 93
lola: 16 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: ((2 <= p66 + p65 + p64 + p63 + p62 + p67) AND (3 <= p440 + p441 + p442 + p443 + p444 + p445))
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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 679 markings, 679 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G ((p133 + p132 + p131 + p130 + p129 + p128 <= p339 + p341 + p343 + p345 + p347 + p349 + p351 + p352 + p350 + p348 + p346 + p344 + p342 + p340))) OR (A (G ((p440 + p441 + p442 + p443 + p444 + p445 + 1 <= p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p487 + p486))) OR ((p255 + p256 + p257 + p258 + p259 + p260 <= p149) AND ((2 <= p472) OR (p353 <= p384 + p385 + p386 + p3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G ((p133 + p132 + p131 + p130 + p129 + p128 <= p339 + p341 + p343 + p345 + p347 + p349 + p351 + p352 + p350 + p348 + p346 + p344 + p342 + p340)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p133 + p132 + p131 + p130 + p129 + p128 <= p339 + p341 + p343 + p345 + p347 + p349 + p351 + p352 + p350 + p348 + p346 + p344 + p342 + p340)))
lola: processed formula length: 148
lola: 14 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: (p339 + p341 + p343 + p345 + p347 + p349 + p351 + p352 + p350 + p348 + p346 + p344 + p342 + p340 + 1 <= p133 + p132 + p131 + p130 + p129 + p128)
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 / EG
lola: The predicate is possibly preserved.
lola: 580 markings, 580 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes yes no no no yes
lola:
preliminary result: no no yes yes yes no no no yes
lola: memory consumption: 30048 KB
lola: time consumption: 74 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-S02J06T06"
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-S02J06T06, 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-158987871600291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 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 ;