About the Execution of ITS-LoLa for PolyORBLF-COL-S02J04T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.650 | 3600000.00 | 888546.00 | 2777.90 | FFFFFFTTFTFTTTTT | 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-158987871600286.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-S02J04T10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871600286
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.8K Apr 12 05:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 05:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 04:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 11 04:55 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 3.8K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.0K Apr 10 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 9 17:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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-S02J04T10-ReachabilityCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1591140215252
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:23:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 23:23:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:23:36] [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:23:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 593 ms
[2020-06-02 23:23:37] [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:23:37] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2020-06-02 23:23:37] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2020-06-02 23:23:37] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2020-06-02 23:23:37] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2020-06-02 23:23:37] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2020-06-02 23:23:37] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2020-06-02 23:23:37] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 22 ms.
[2020-06-02 23:23:37] [INFO ] Computed order based on color domains.
[2020-06-02 23:23:37] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1412 transitions in 25 ms.
[2020-06-02 23:23:37] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 63 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 110 ms. (steps per millisecond=90 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1]
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-02 23:23:38] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2020-06-02 23:23:38] [INFO ] Computed 54 place invariants in 68 ms
[2020-06-02 23:23:38] [INFO ] [Real]Absence check using 15 positive place invariants in 38 ms returned sat
[2020-06-02 23:23:38] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 42 ms returned sat
[2020-06-02 23:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:23:40] [INFO ] [Real]Absence check using state equation in 2198 ms returned sat
[2020-06-02 23:23:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:23:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 42 ms returned sat
[2020-06-02 23:23:40] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 89 ms returned unsat
[2020-06-02 23:23:41] [INFO ] [Real]Absence check using 15 positive place invariants in 40 ms returned sat
[2020-06-02 23:23:41] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 57 ms returned unsat
[2020-06-02 23:23:41] [INFO ] [Real]Absence check using 15 positive place invariants in 36 ms returned unsat
[2020-06-02 23:23:41] [INFO ] [Real]Absence check using 15 positive place invariants in 32 ms returned sat
[2020-06-02 23:23:41] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 7 ms returned unsat
[2020-06-02 23:23:41] [INFO ] [Real]Absence check using 15 positive place invariants in 30 ms returned sat
[2020-06-02 23:23:41] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 56 ms returned sat
[2020-06-02 23:23:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:23:44] [INFO ] [Real]Absence check using state equation in 2544 ms returned sat
[2020-06-02 23:23:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:23:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 34 ms returned sat
[2020-06-02 23:23:44] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 57 ms returned sat
[2020-06-02 23:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:23:48] [INFO ] [Nat]Absence check using state equation in 3798 ms returned sat
[2020-06-02 23:23:48] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-06-02 23:23:48] [INFO ] [Nat]Added 130 Read/Feed constraints in 612 ms returned sat
[2020-06-02 23:23:49] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 153 ms.
[2020-06-02 23:23:49] [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 (=> (> t5 0) (or (and (> t605 0) (< o605 o5)) (and (> t615 0) (< o615 o5))))") while checking expression at index 4
[2020-06-02 23:23:49] [INFO ] [Real]Absence check using 15 positive place invariants in 36 ms returned sat
[2020-06-02 23:23:49] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 58 ms returned sat
[2020-06-02 23:23:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:23:51] [INFO ] [Real]Absence check using state equation in 2136 ms returned sat
[2020-06-02 23:23:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:23:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 43 ms returned sat
[2020-06-02 23:23:51] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 64 ms returned sat
[2020-06-02 23:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:23:54] [INFO ] [Nat]Absence check using state equation in 2245 ms returned sat
[2020-06-02 23:23:55] [INFO ] [Nat]Added 130 Read/Feed constraints in 985 ms returned sat
[2020-06-02 23:23:55] [INFO ] Deduced a trap composed of 65 places in 229 ms
[2020-06-02 23:23:56] [INFO ] Deduced a trap composed of 65 places in 216 ms
[2020-06-02 23:23:56] [INFO ] Deduced a trap composed of 65 places in 148 ms
[2020-06-02 23:23:56] [INFO ] Deduced a trap composed of 65 places in 160 ms
[2020-06-02 23:23:56] [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 (> (+ s30 s72 s73 s74 s75 s76 s90 s132 s133 s134 s135 s136 s150 s180 s190 s200 s222 s223 s242 s243 s299 s300 s301 s302 s303 s320 s335 s345 s358 s368 s382 s400 s401 s412 s422 s441 s459 s460 s482 s492 s502 s512 s522 s532 s542 s552 s562 s572 s584 s594 s604 s614 s624 s634 s644 s654 s666 s688 s689 s700 s742 s743 s744 s745 s746) 0)") while checking expression at index 5
[2020-06-02 23:23:56] [INFO ] [Real]Absence check using 15 positive place invariants in 32 ms returned sat
[2020-06-02 23:23:56] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 55 ms returned sat
[2020-06-02 23:23:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:24:00] [INFO ] [Real]Absence check using state equation in 3778 ms returned sat
[2020-06-02 23:24:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:24:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 38 ms returned sat
[2020-06-02 23:24:01] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 59 ms returned sat
[2020-06-02 23:24:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:24:03] [INFO ] [Nat]Absence check using state equation in 2763 ms returned sat
[2020-06-02 23:24:04] [INFO ] [Nat]Added 130 Read/Feed constraints in 727 ms returned sat
[2020-06-02 23:24:05] [INFO ] Deduced a trap composed of 397 places in 508 ms
[2020-06-02 23:24:05] [INFO ] Deduced a trap composed of 65 places in 522 ms
[2020-06-02 23:24:06] [INFO ] Deduced a trap composed of 65 places in 431 ms
[2020-06-02 23:24:06] [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 (> (+ s26 s52 s53 s54 s55 s56 s86 s112 s113 s114 s115 s116 s146 s176 s186 s196 s214 s215 s234 s235 s279 s280 s281 s282 s283 s316 s331 s341 s354 s364 s378 s392 s393 s408 s418 s437 s451 s452 s478 s488 s498 s508 s518 s528 s538 s548 s558 s568 s580 s590 s600 s610 s620 s630 s640 s650 s662 s680 s681 s696 s722 s723 s724 s725 s726) 0)") while checking expression at index 6
[2020-06-02 23:24:06] [INFO ] [Real]Absence check using 15 positive place invariants in 30 ms returned sat
[2020-06-02 23:24:06] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 56 ms returned sat
[2020-06-02 23:24:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:24:08] [INFO ] [Real]Absence check using state equation in 2697 ms returned sat
[2020-06-02 23:24:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:24:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 37 ms returned sat
[2020-06-02 23:24:09] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 59 ms returned sat
[2020-06-02 23:24:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:24:12] [INFO ] [Nat]Absence check using state equation in 3520 ms returned sat
[2020-06-02 23:24:13] [INFO ] [Nat]Added 130 Read/Feed constraints in 365 ms returned sat
[2020-06-02 23:24:13] [INFO ] Deduced a trap composed of 65 places in 93 ms
[2020-06-02 23:24:13] [INFO ] Deduced a trap composed of 66 places in 67 ms
[2020-06-02 23:24:13] [INFO ] Deduced a trap composed of 65 places in 89 ms
[2020-06-02 23:24:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 639 ms
[2020-06-02 23:24:13] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 121 ms.
[2020-06-02 23:24:14] [INFO ] Added : 5 causal constraints over 1 iterations in 301 ms. Result :(error "Failed to check-sat")
[2020-06-02 23:24:14] [INFO ] [Real]Absence check using 15 positive place invariants in 33 ms returned sat
[2020-06-02 23:24:14] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 28 ms returned unsat
[2020-06-02 23:24:14] [INFO ] [Real]Absence check using 15 positive place invariants in 27 ms returned unsat
[2020-06-02 23:24:14] [INFO ] [Real]Absence check using 15 positive place invariants in 34 ms returned sat
[2020-06-02 23:24:14] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 51 ms returned sat
[2020-06-02 23:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:24:16] [INFO ] [Real]Absence check using state equation in 2309 ms returned sat
[2020-06-02 23:24:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:24:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 29 ms returned sat
[2020-06-02 23:24:17] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 41 ms returned sat
[2020-06-02 23:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:24:19] [INFO ] [Nat]Absence check using state equation in 2216 ms returned sat
[2020-06-02 23:24:21] [INFO ] [Nat]Added 130 Read/Feed constraints in 2612 ms returned sat
[2020-06-02 23:24:22] [INFO ] Deduced a trap composed of 66 places in 128 ms
[2020-06-02 23:24:22] [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 (> (+ s4 s14 s24 s42 s43 s44 s45 s46 s84 s102 s103 s104 s105 s106 s144 s174 s184 s194 s210 s211 s230 s231 s269 s270 s271 s272 s273 s314 s329 s339 s352 s362 s376 s388 s389 s406 s416 s435 s447 s448 s476 s486 s496 s506 s516 s526 s536 s546 s556 s566 s588 s598 s608 s618 s628 s638 s648 s660 s676 s677 s694 s712 s713 s714 s715 s716) 0)") while checking expression at index 10
[2020-06-02 23:24:22] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2020-06-02 23:24:22] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 30 ms returned unsat
[2020-06-02 23:24:22] [INFO ] [Real]Absence check using 15 positive place invariants in 34 ms returned sat
[2020-06-02 23:24:22] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 56 ms returned sat
[2020-06-02 23:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:24:24] [INFO ] [Real]Absence check using state equation in 2416 ms returned sat
[2020-06-02 23:24:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:24:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 33 ms returned sat
[2020-06-02 23:24:24] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 52 ms returned sat
[2020-06-02 23:24:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:24:27] [INFO ] [Nat]Absence check using state equation in 2423 ms returned sat
[2020-06-02 23:24:28] [INFO ] [Nat]Added 130 Read/Feed constraints in 1335 ms returned sat
[2020-06-02 23:24:28] [INFO ] Deduced a trap composed of 65 places in 69 ms
[2020-06-02 23:24:29] [INFO ] Deduced a trap composed of 65 places in 106 ms
[2020-06-02 23:24:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:24:30] [INFO ] Deduced a trap composed of 2 places in 635 ms
[2020-06-02 23:24:30] [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 (> (+ s370 s373) 0)") while checking expression at index 12
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 197 out of 752 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 750 transition count 1352
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 690 transition count 1352
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 122 place count 690 transition count 1292
Deduced a syphon composed of 60 places in 6 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 242 place count 630 transition count 1292
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 282 place count 610 transition count 1272
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 302 place count 610 transition count 1252
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 322 place count 590 transition count 1252
Applied a total of 322 rules in 243 ms. Remains 590 /752 variables (removed 162) and now considering 1252/1412 (removed 160) transitions.
[2020-06-02 23:24:30] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
// Phase 1: matrix 1232 rows 590 cols
[2020-06-02 23:24:30] [INFO ] Computed 52 place invariants in 68 ms
[2020-06-02 23:24:33] [INFO ] Dead Transitions using invariants and state equation in 3101 ms returned [632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751]
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions :[751, 750, 749, 748, 747, 746, 745, 744, 743, 742, 741, 740, 739, 738, 737, 736, 735, 734, 733, 732, 731, 730, 729, 728, 727, 726, 725, 724, 723, 722, 721, 720, 719, 718, 717, 716, 715, 714, 713, 712, 711, 710, 709, 708, 707, 706, 705, 704, 703, 702, 701, 700, 699, 698, 697, 696, 695, 694, 693, 692, 691, 690, 689, 688, 687, 686, 685, 684, 683, 682, 681, 680, 679, 678, 677, 676, 675, 674, 673, 672, 671, 670, 669, 668, 667, 666, 665, 664, 663, 662, 661, 660, 659, 658, 657, 656, 655, 654, 653, 652, 641, 640, 639, 638, 637, 636, 635, 634, 633, 632]
Starting structural reductions, iteration 1 : 590/752 places, 1142/1412 transitions.
Reduce places removed 0 places and 20 transitions.
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 0 places and 20 transitions.
Applied a total of 0 rules in 58 ms. Remains 590 /590 variables (removed 0) and now considering 1102/1142 (removed 40) transitions.
Finished structural reductions, in 2 iterations. Remains : 590/752 places, 1102/1412 transitions.
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Incomplete random walk after 1000000 steps, including 277 resets, run finished after 5014 ms. (steps per millisecond=199 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 123 resets, run finished after 2828 ms. (steps per millisecond=353 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 132 resets, run finished after 2499 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 222 resets, run finished after 2575 ms. (steps per millisecond=388 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 293 resets, run finished after 2566 ms. (steps per millisecond=389 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 105 resets, run finished after 2022 ms. (steps per millisecond=494 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 130 resets, run finished after 2467 ms. (steps per millisecond=405 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 3515668 steps, run timeout after 30001 ms. (steps per millisecond=117 ) properties seen :[0, 0, 0, 0, 0, 0]
Probabilistic random walk after 3515668 steps, saw 1235268 distinct states, run finished after 30002 ms. (steps per millisecond=117 ) properties seen :[0, 0, 0, 0, 0, 0]
[2020-06-02 23:25:23] [INFO ] Flow matrix only has 1082 transitions (discarded 20 similar events)
// Phase 1: matrix 1082 rows 568 cols
[2020-06-02 23:25:23] [INFO ] Computed 52 place invariants in 13 ms
[2020-06-02 23:25:23] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2020-06-02 23:25:24] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 41 ms returned unsat
[2020-06-02 23:25:24] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2020-06-02 23:25:24] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 51 ms returned unsat
[2020-06-02 23:25:24] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned sat
[2020-06-02 23:25:24] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 44 ms returned sat
[2020-06-02 23:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:25:25] [INFO ] [Real]Absence check using state equation in 1447 ms returned sat
[2020-06-02 23:25:25] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-06-02 23:25:25] [INFO ] [Real]Added 130 Read/Feed constraints in 56 ms returned sat
[2020-06-02 23:25:26] [INFO ] Deduced a trap composed of 67 places in 366 ms
[2020-06-02 23:25:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 426 ms
[2020-06-02 23:25:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:25:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2020-06-02 23:25:26] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 29 ms returned sat
[2020-06-02 23:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:25:28] [INFO ] [Nat]Absence check using state equation in 1923 ms returned sat
[2020-06-02 23:25:28] [INFO ] [Nat]Added 130 Read/Feed constraints in 333 ms returned sat
[2020-06-02 23:25:29] [INFO ] Deduced a trap composed of 229 places in 505 ms
[2020-06-02 23:25:29] [INFO ] Deduced a trap composed of 50 places in 376 ms
[2020-06-02 23:25:29] [INFO ] Deduced a trap composed of 47 places in 339 ms
[2020-06-02 23:25:30] [INFO ] Deduced a trap composed of 245 places in 279 ms
[2020-06-02 23:25:30] [INFO ] Deduced a trap composed of 238 places in 290 ms
[2020-06-02 23:25:30] [INFO ] Deduced a trap composed of 229 places in 288 ms
[2020-06-02 23:25:31] [INFO ] Deduced a trap composed of 47 places in 371 ms
[2020-06-02 23:25:31] [INFO ] Deduced a trap composed of 47 places in 284 ms
[2020-06-02 23:25:32] [INFO ] Deduced a trap composed of 47 places in 338 ms
[2020-06-02 23:25:32] [INFO ] Deduced a trap composed of 48 places in 277 ms
[2020-06-02 23:25:32] [INFO ] Deduced a trap composed of 47 places in 241 ms
[2020-06-02 23:25:32] [INFO ] Deduced a trap composed of 47 places in 235 ms
[2020-06-02 23:25:33] [INFO ] Deduced a trap composed of 47 places in 238 ms
[2020-06-02 23:25:33] [INFO ] Deduced a trap composed of 47 places in 235 ms
[2020-06-02 23:25:33] [INFO ] Deduced a trap composed of 256 places in 239 ms
[2020-06-02 23:25:33] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5211 ms
[2020-06-02 23:25:33] [INFO ] Computed and/alt/rep : 1100/20488/1080 causal constraints in 48 ms.
[2020-06-02 23:25:54] [INFO ] Added : 680 causal constraints over 136 iterations in 20349 ms.(timeout) Result :sat
[2020-06-02 23:25:54] [INFO ] Deduced a trap composed of 47 places in 50 ms
[2020-06-02 23:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
Attempting to minimize the solution found.
Minimization took 168 ms.
[2020-06-02 23:25:54] [INFO ] [Real]Absence check using 12 positive place invariants in 27 ms returned sat
[2020-06-02 23:25:54] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 40 ms returned sat
[2020-06-02 23:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:25:56] [INFO ] [Real]Absence check using state equation in 1532 ms returned sat
[2020-06-02 23:25:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:25:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2020-06-02 23:25:56] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 30 ms returned sat
[2020-06-02 23:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:25:57] [INFO ] [Nat]Absence check using state equation in 1370 ms returned sat
[2020-06-02 23:25:58] [INFO ] [Nat]Added 130 Read/Feed constraints in 272 ms returned sat
[2020-06-02 23:25:58] [INFO ] Deduced a trap composed of 47 places in 288 ms
[2020-06-02 23:25:58] [INFO ] Deduced a trap composed of 47 places in 348 ms
[2020-06-02 23:25:59] [INFO ] Deduced a trap composed of 47 places in 353 ms
[2020-06-02 23:25:59] [INFO ] Deduced a trap composed of 288 places in 329 ms
[2020-06-02 23:26:00] [INFO ] Deduced a trap composed of 287 places in 303 ms
[2020-06-02 23:26:00] [INFO ] Deduced a trap composed of 267 places in 310 ms
[2020-06-02 23:26:00] [INFO ] Deduced a trap composed of 48 places in 373 ms
[2020-06-02 23:26:01] [INFO ] Deduced a trap composed of 48 places in 301 ms
[2020-06-02 23:26:01] [INFO ] Deduced a trap composed of 102 places in 277 ms
[2020-06-02 23:26:02] [INFO ] Deduced a trap composed of 47 places in 294 ms
[2020-06-02 23:26:02] [INFO ] Deduced a trap composed of 277 places in 361 ms
[2020-06-02 23:26:03] [INFO ] Deduced a trap composed of 47 places in 399 ms
[2020-06-02 23:26:03] [INFO ] Deduced a trap composed of 277 places in 375 ms
[2020-06-02 23:26:04] [INFO ] Deduced a trap composed of 130 places in 370 ms
[2020-06-02 23:26:04] [INFO ] Deduced a trap composed of 296 places in 369 ms
[2020-06-02 23:26:05] [INFO ] Deduced a trap composed of 261 places in 357 ms
[2020-06-02 23:26:05] [INFO ] Deduced a trap composed of 288 places in 359 ms
[2020-06-02 23:26:06] [INFO ] Deduced a trap composed of 248 places in 370 ms
[2020-06-02 23:26:06] [INFO ] Deduced a trap composed of 259 places in 344 ms
[2020-06-02 23:26:06] [INFO ] Deduced a trap composed of 264 places in 342 ms
[2020-06-02 23:26:07] [INFO ] Deduced a trap composed of 23 places in 366 ms
[2020-06-02 23:26:07] [INFO ] Deduced a trap composed of 247 places in 341 ms
[2020-06-02 23:26:08] [INFO ] Deduced a trap composed of 261 places in 325 ms
[2020-06-02 23:26:08] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 10061 ms
[2020-06-02 23:26:08] [INFO ] Computed and/alt/rep : 1100/20488/1080 causal constraints in 69 ms.
[2020-06-02 23:26:28] [INFO ] Added : 655 causal constraints over 131 iterations in 20381 ms.(timeout) Result :sat
[2020-06-02 23:26:29] [INFO ] Deduced a trap composed of 47 places in 304 ms
[2020-06-02 23:26:29] [INFO ] Deduced a trap composed of 48 places in 304 ms
[2020-06-02 23:26:29] [INFO ] Deduced a trap composed of 25 places in 271 ms
[2020-06-02 23:26:30] [INFO ] Deduced a trap composed of 48 places in 331 ms
[2020-06-02 23:26:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1837 ms
Attempting to minimize the solution found.
Minimization took 98 ms.
[2020-06-02 23:26:30] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2020-06-02 23:26:30] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2020-06-02 23:26:30] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 36 ms returned unsat
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 510000 steps, including 1000 resets, run finished after 2018 ms. (steps per millisecond=252 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 442600 steps, including 1000 resets, run finished after 1525 ms. (steps per millisecond=290 ) properties seen :[0, 0] could not realise parikh vector
Support contains 92 out of 568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 568/568 places, 1102/1102 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 568 transition count 1092
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 558 transition count 1092
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 80 place count 528 transition count 1062
Applied a total of 80 rules in 78 ms. Remains 528 /568 variables (removed 40) and now considering 1062/1102 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 528/568 places, 1062/1102 transitions.
Incomplete random walk after 1000000 steps, including 281 resets, run finished after 3410 ms. (steps per millisecond=293 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 256 resets, run finished after 2268 ms. (steps per millisecond=440 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 292 resets, run finished after 1850 ms. (steps per millisecond=540 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 3853638 steps, run timeout after 30001 ms. (steps per millisecond=128 ) properties seen :[0, 0]
Probabilistic random walk after 3853638 steps, saw 1248576 distinct states, run finished after 30001 ms. (steps per millisecond=128 ) properties seen :[0, 0]
[2020-06-02 23:27:12] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-06-02 23:27:12] [INFO ] Computed 52 place invariants in 12 ms
[2020-06-02 23:27:12] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2020-06-02 23:27:12] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 45 ms returned sat
[2020-06-02 23:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:27:13] [INFO ] [Real]Absence check using state equation in 1440 ms returned sat
[2020-06-02 23:27:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:27:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2020-06-02 23:27:13] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 46 ms returned sat
[2020-06-02 23:27:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:27:15] [INFO ] [Nat]Absence check using state equation in 1477 ms returned sat
[2020-06-02 23:27:15] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-06-02 23:27:15] [INFO ] [Nat]Added 130 Read/Feed constraints in 222 ms returned sat
[2020-06-02 23:27:15] [INFO ] Deduced a trap composed of 211 places in 391 ms
[2020-06-02 23:27:16] [INFO ] Deduced a trap composed of 44 places in 386 ms
[2020-06-02 23:27:16] [INFO ] Deduced a trap composed of 222 places in 378 ms
[2020-06-02 23:27:17] [INFO ] Deduced a trap composed of 43 places in 403 ms
[2020-06-02 23:27:17] [INFO ] Deduced a trap composed of 44 places in 394 ms
[2020-06-02 23:27:18] [INFO ] Deduced a trap composed of 235 places in 371 ms
[2020-06-02 23:27:18] [INFO ] Deduced a trap composed of 45 places in 164 ms
[2020-06-02 23:27:18] [INFO ] Deduced a trap composed of 45 places in 163 ms
[2020-06-02 23:27:19] [INFO ] Deduced a trap composed of 43 places in 231 ms
[2020-06-02 23:27:19] [INFO ] Deduced a trap composed of 43 places in 105 ms
[2020-06-02 23:27:19] [INFO ] Deduced a trap composed of 44 places in 72 ms
[2020-06-02 23:27:19] [INFO ] Deduced a trap composed of 44 places in 42 ms
[2020-06-02 23:27:19] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3966 ms
[2020-06-02 23:27:19] [INFO ] Computed and/alt/rep : 1060/20488/1040 causal constraints in 91 ms.
[2020-06-02 23:27:39] [INFO ] Added : 555 causal constraints over 111 iterations in 20224 ms.(timeout) Result :sat
[2020-06-02 23:27:39] [INFO ] Deduced a trap composed of 43 places in 30 ms
[2020-06-02 23:27:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
Attempting to minimize the solution found.
Minimization took 177 ms.
[2020-06-02 23:27:40] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2020-06-02 23:27:40] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 43 ms returned sat
[2020-06-02 23:27:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:27:41] [INFO ] [Real]Absence check using state equation in 1558 ms returned sat
[2020-06-02 23:27:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:27:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2020-06-02 23:27:42] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 44 ms returned sat
[2020-06-02 23:27:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:27:43] [INFO ] [Nat]Absence check using state equation in 1234 ms returned sat
[2020-06-02 23:27:43] [INFO ] [Nat]Added 130 Read/Feed constraints in 339 ms returned sat
[2020-06-02 23:27:43] [INFO ] Deduced a trap composed of 43 places in 274 ms
[2020-06-02 23:27:44] [INFO ] Deduced a trap composed of 43 places in 358 ms
[2020-06-02 23:27:44] [INFO ] Deduced a trap composed of 43 places in 345 ms
[2020-06-02 23:27:45] [INFO ] Deduced a trap composed of 71 places in 249 ms
[2020-06-02 23:27:45] [INFO ] Deduced a trap composed of 44 places in 40 ms
[2020-06-02 23:27:45] [INFO ] Deduced a trap composed of 43 places in 24 ms
[2020-06-02 23:27:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1777 ms
[2020-06-02 23:27:45] [INFO ] Computed and/alt/rep : 1060/20488/1040 causal constraints in 104 ms.
[2020-06-02 23:28:06] [INFO ] Added : 645 causal constraints over 129 iterations in 20704 ms.(timeout) Result :sat
[2020-06-02 23:28:06] [INFO ] Deduced a trap composed of 43 places in 77 ms
[2020-06-02 23:28:06] [INFO ] Deduced a trap composed of 43 places in 55 ms
[2020-06-02 23:28:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 694 ms
Attempting to minimize the solution found.
Minimization took 208 ms.
Incomplete Parikh walk after 410700 steps, including 1000 resets, run finished after 1601 ms. (steps per millisecond=256 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 640400 steps, including 1000 resets, run finished after 1961 ms. (steps per millisecond=326 ) properties seen :[0, 0] could not realise parikh vector
Support contains 92 out of 528 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 528/528 places, 1062/1062 transitions.
Applied a total of 0 rules in 16 ms. Remains 528 /528 variables (removed 0) and now considering 1062/1062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 528/528 places, 1062/1062 transitions.
Starting structural reductions, iteration 0 : 528/528 places, 1062/1062 transitions.
Applied a total of 0 rules in 15 ms. Remains 528 /528 variables (removed 0) and now considering 1062/1062 (removed 0) transitions.
[2020-06-02 23:28:10] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-06-02 23:28:10] [INFO ] Computed 52 place invariants in 12 ms
[2020-06-02 23:28:11] [INFO ] Implicit Places using invariants in 804 ms returned []
[2020-06-02 23:28:11] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-06-02 23:28:11] [INFO ] Computed 52 place invariants in 12 ms
[2020-06-02 23:28:12] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-06-02 23:28:20] [INFO ] Implicit Places using invariants and state equation in 8889 ms returned []
Implicit Place search using SMT with State Equation took 9693 ms to find 0 implicit places.
[2020-06-02 23:28:20] [INFO ] Redundant transitions in 100 ms returned []
[2020-06-02 23:28:20] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-06-02 23:28:20] [INFO ] Computed 52 place invariants in 25 ms
[2020-06-02 23:28:23] [INFO ] Dead Transitions using invariants and state equation in 2470 ms returned []
Finished structural reductions, in 1 iterations. Remains : 528/528 places, 1062/1062 transitions.
Incomplete random walk after 100000 steps, including 24 resets, run finished after 501 ms. (steps per millisecond=199 ) properties seen :[0, 0]
[2020-06-02 23:28:23] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-06-02 23:28:23] [INFO ] Computed 52 place invariants in 17 ms
[2020-06-02 23:28:23] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2020-06-02 23:28:23] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 47 ms returned sat
[2020-06-02 23:28:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:28:25] [INFO ] [Real]Absence check using state equation in 1421 ms returned sat
[2020-06-02 23:28:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:28:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 25 ms returned sat
[2020-06-02 23:28:25] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 39 ms returned sat
[2020-06-02 23:28:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:28:26] [INFO ] [Nat]Absence check using state equation in 1214 ms returned sat
[2020-06-02 23:28:26] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-06-02 23:28:26] [INFO ] [Nat]Added 130 Read/Feed constraints in 215 ms returned sat
[2020-06-02 23:28:26] [INFO ] Deduced a trap composed of 211 places in 278 ms
[2020-06-02 23:28:27] [INFO ] Deduced a trap composed of 44 places in 329 ms
[2020-06-02 23:28:27] [INFO ] Deduced a trap composed of 222 places in 241 ms
[2020-06-02 23:28:28] [INFO ] Deduced a trap composed of 43 places in 308 ms
[2020-06-02 23:28:28] [INFO ] Deduced a trap composed of 44 places in 252 ms
[2020-06-02 23:28:28] [INFO ] Deduced a trap composed of 235 places in 348 ms
[2020-06-02 23:28:29] [INFO ] Deduced a trap composed of 45 places in 132 ms
[2020-06-02 23:28:29] [INFO ] Deduced a trap composed of 45 places in 159 ms
[2020-06-02 23:28:29] [INFO ] Deduced a trap composed of 43 places in 89 ms
[2020-06-02 23:28:29] [INFO ] Deduced a trap composed of 43 places in 65 ms
[2020-06-02 23:28:29] [INFO ] Deduced a trap composed of 44 places in 48 ms
[2020-06-02 23:28:29] [INFO ] Deduced a trap composed of 44 places in 44 ms
[2020-06-02 23:28:29] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3040 ms
[2020-06-02 23:28:29] [INFO ] Computed and/alt/rep : 1060/20488/1040 causal constraints in 56 ms.
[2020-06-02 23:28:45] [INFO ] Added : 485 causal constraints over 97 iterations in 15426 ms. Result :unknown
[2020-06-02 23:28:45] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2020-06-02 23:28:45] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 28 ms returned sat
[2020-06-02 23:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:28:46] [INFO ] [Real]Absence check using state equation in 1186 ms returned sat
[2020-06-02 23:28:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:28:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2020-06-02 23:28:46] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 31 ms returned sat
[2020-06-02 23:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:28:47] [INFO ] [Nat]Absence check using state equation in 1083 ms returned sat
[2020-06-02 23:28:47] [INFO ] [Nat]Added 130 Read/Feed constraints in 344 ms returned sat
[2020-06-02 23:28:48] [INFO ] Deduced a trap composed of 43 places in 370 ms
[2020-06-02 23:28:48] [INFO ] Deduced a trap composed of 43 places in 359 ms
[2020-06-02 23:28:49] [INFO ] Deduced a trap composed of 43 places in 364 ms
[2020-06-02 23:28:49] [INFO ] Deduced a trap composed of 71 places in 331 ms
[2020-06-02 23:28:49] [INFO ] Deduced a trap composed of 44 places in 44 ms
[2020-06-02 23:28:49] [INFO ] Deduced a trap composed of 43 places in 33 ms
[2020-06-02 23:28:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2029 ms
[2020-06-02 23:28:50] [INFO ] Computed and/alt/rep : 1060/20488/1040 causal constraints in 89 ms.
[2020-06-02 23:29:06] [INFO ] Added : 600 causal constraints over 120 iterations in 16492 ms. Result :(error "Failed to check-sat")
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 528 transition count 1042
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 518 transition count 1082
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 518 transition count 1072
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 60 place count 508 transition count 1072
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 508 transition count 1060
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 84 place count 496 transition count 1060
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 124 place count 496 transition count 1020
Applied a total of 124 rules in 126 ms. Remains 496 /528 variables (removed 32) and now considering 1020/1062 (removed 42) transitions.
// Phase 1: matrix 1020 rows 496 cols
[2020-06-02 23:29:06] [INFO ] Computed 52 place invariants in 15 ms
[2020-06-02 23:29:06] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2020-06-02 23:29:06] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 36 ms returned sat
[2020-06-02 23:29:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:29:07] [INFO ] [Real]Absence check using state equation in 1131 ms returned sat
[2020-06-02 23:29:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:29:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2020-06-02 23:29:08] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 43 ms returned sat
[2020-06-02 23:29:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:29:09] [INFO ] [Nat]Absence check using state equation in 1138 ms returned sat
[2020-06-02 23:29:09] [INFO ] Deduced a trap composed of 199 places in 335 ms
[2020-06-02 23:29:09] [INFO ] Deduced a trap composed of 186 places in 299 ms
[2020-06-02 23:29:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 747 ms
[2020-06-02 23:29:10] [INFO ] Computed and/alt/rep : 1019/18799/1019 causal constraints in 51 ms.
[2020-06-02 23:29:30] [INFO ] Added : 560 causal constraints over 112 iterations in 20288 ms.(timeout) Result :sat
[2020-06-02 23:29:30] [INFO ] Deduced a trap composed of 40 places in 187 ms
[2020-06-02 23:29:30] [INFO ] Deduced a trap composed of 41 places in 153 ms
[2020-06-02 23:29:31] [INFO ] Deduced a trap composed of 40 places in 106 ms
[2020-06-02 23:29:31] [INFO ] Deduced a trap composed of 41 places in 101 ms
[2020-06-02 23:29:31] [INFO ] Deduced a trap composed of 41 places in 100 ms
[2020-06-02 23:29:32] [INFO ] Deduced a trap composed of 40 places in 340 ms
[2020-06-02 23:29:33] [INFO ] Deduced a trap composed of 40 places in 342 ms
[2020-06-02 23:29:33] [INFO ] Deduced a trap composed of 40 places in 327 ms
[2020-06-02 23:29:34] [INFO ] Deduced a trap composed of 41 places in 335 ms
[2020-06-02 23:29:35] [INFO ] Deduced a trap composed of 217 places in 347 ms
[2020-06-02 23:29:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5780 ms
Attempting to minimize the solution found.
Minimization took 187 ms.
[2020-06-02 23:29:36] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2020-06-02 23:29:36] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 45 ms returned sat
[2020-06-02 23:29:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:29:37] [INFO ] [Real]Absence check using state equation in 1352 ms returned sat
[2020-06-02 23:29:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:29:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2020-06-02 23:29:37] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 33 ms returned sat
[2020-06-02 23:29:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:29:38] [INFO ] [Nat]Absence check using state equation in 1037 ms returned sat
[2020-06-02 23:29:39] [INFO ] Deduced a trap composed of 206 places in 341 ms
[2020-06-02 23:29:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2020-06-02 23:29:39] [INFO ] Computed and/alt/rep : 1019/18799/1019 causal constraints in 52 ms.
[2020-06-02 23:29:59] [INFO ] Added : 640 causal constraints over 128 iterations in 20218 ms.(timeout) Result :sat
[2020-06-02 23:29:59] [INFO ] Deduced a trap composed of 40 places in 180 ms
[2020-06-02 23:30:00] [INFO ] Deduced a trap composed of 40 places in 154 ms
[2020-06-02 23:30:00] [INFO ] Deduced a trap composed of 40 places in 118 ms
[2020-06-02 23:30:00] [INFO ] Deduced a trap composed of 41 places in 95 ms
[2020-06-02 23:30:01] [INFO ] Deduced a trap composed of 41 places in 101 ms
[2020-06-02 23:30:01] [INFO ] Deduced a trap composed of 41 places in 74 ms
[2020-06-02 23:30:01] [INFO ] Deduced a trap composed of 41 places in 45 ms
[2020-06-02 23:30:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2182 ms
Attempting to minimize the solution found.
Minimization took 166 ms.
[2020-06-02 23:30:01] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2020-06-02 23:30:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 26 ms.
[2020-06-02 23:30:02] [INFO ] Flatten gal took : 302 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ PolyORBLF-COL-S02J04T10 @ 3570 seconds
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3339
rslt: Output for ReachabilityCardinality @ PolyORBLF-COL-S02J04T10
{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 23:30:02 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "E (F (((p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 <= 1))))",
"processed_size": 84,
"rewrites": 1
},
"result":
{
"edges": 13907304,
"markings": 10533516,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3340
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 81,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 81,
"visible_transitions": 0
},
"processed": "E (F ((((p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 <= p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378) AND (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 <= p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358)) OR ((p482 + 1 <= p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429) AND (1 <= p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439)))))",
"processed_size": 604,
"rewrites": 1
},
"result":
{
"edges": 258,
"markings": 259,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 26768,
"runtime": 231.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 5150,
"conflict_clusters": 81,
"places": 528,
"places_significant": 476,
"singleton_clusters": 0,
"transitions": 1062
},
"result":
{
"preliminary_value": "yes yes ",
"value": "yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1590/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16896
lola: finding significant places
lola: 528 places, 1062 transitions, 476 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (3 <= p172)
lola: E (F ((((p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 <= p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378) AND (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 <= p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358)) OR ((p482 + 1 <= p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429) AND (1 <= p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439))))) : E (F (((p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 <= 1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 <= 1))))
lola: processed formula length: 84
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 <= 1))
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 ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 243252 markings, 293588 edges, 48650 markings/sec, 0 secs
lola: sara is running 5 secs || 472411 markings, 570924 edges, 45832 markings/sec, 5 secs
lola: sara is running 10 secs || 709895 markings, 866011 edges, 47497 markings/sec, 10 secs
lola: sara is running 15 secs || 945480 markings, 1162692 edges, 47117 markings/sec, 15 secs
lola: sara is running 20 secs || 1184002 markings, 1464323 edges, 47704 markings/sec, 20 secs
lola: sara is running 25 secs || 1424287 markings, 1770508 edges, 48057 markings/sec, 25 secs
lola: sara is running 30 secs || 1663800 markings, 2076927 edges, 47903 markings/sec, 30 secs
lola: sara is running 35 secs || 1902814 markings, 2384358 edges, 47803 markings/sec, 35 secs
lola: sara is running 40 secs || 2140787 markings, 2694409 edges, 47595 markings/sec, 40 secs
lola: sara is running 45 secs || 2378585 markings, 3002628 edges, 47560 markings/sec, 45 secs
lola: sara is running 50 secs || 2616518 markings, 3314636 edges, 47587 markings/sec, 50 secs
lola: sara is running 55 secs || 2853585 markings, 3627312 edges, 47413 markings/sec, 55 secs
lola: sara is running 60 secs || 3090387 markings, 3940023 edges, 47360 markings/sec, 60 secs
lola: sara is running 65 secs || 3327425 markings, 4252335 edges, 47408 markings/sec, 65 secs
lola: sara is running 70 secs || 3563607 markings, 4563239 edges, 47236 markings/sec, 70 secs
lola: sara is running 75 secs || 3799043 markings, 4874164 edges, 47087 markings/sec, 75 secs
lola: sara is running 80 secs || 4035163 markings, 5186812 edges, 47224 markings/sec, 80 secs
lola: sara is running 85 secs || 4270692 markings, 5500545 edges, 47106 markings/sec, 85 secs
lola: sara is running 90 secs || 4505806 markings, 5812770 edges, 47023 markings/sec, 90 secs
lola: sara is running 95 secs || 4741386 markings, 6126538 edges, 47116 markings/sec, 95 secs
lola: sara is running 100 secs || 4976021 markings, 6438893 edges, 46927 markings/sec, 100 secs
lola: sara is running 105 secs || 5210809 markings, 6751677 edges, 46958 markings/sec, 105 secs
lola: sara is running 110 secs || 5445544 markings, 7064246 edges, 46947 markings/sec, 110 secs
lola: sara is running 115 secs || 5679542 markings, 7374428 edges, 46800 markings/sec, 115 secs
lola: sara is running 120 secs || 5913648 markings, 7687803 edges, 46821 markings/sec, 120 secs
lola: sara is running 125 secs || 6147590 markings, 8001687 edges, 46788 markings/sec, 125 secs
lola: sara is running 130 secs || 6381393 markings, 8315553 edges, 46761 markings/sec, 130 secs
lola: sara is running 135 secs || 6615588 markings, 8629619 edges, 46839 markings/sec, 135 secs
lola: sara is running 140 secs || 6828012 markings, 8914398 edges, 42485 markings/sec, 140 secs
lola: sara is running 145 secs || 7055619 markings, 9218610 edges, 45521 markings/sec, 145 secs
lola: sara is running 150 secs || 7288920 markings, 9531315 edges, 46660 markings/sec, 150 secs
lola: sara is running 155 secs || 7523632 markings, 9845211 edges, 46942 markings/sec, 155 secs
lola: sara is running 160 secs || 7757449 markings, 10158740 edges, 46763 markings/sec, 160 secs
lola: sara is running 165 secs || 7991174 markings, 10474126 edges, 46745 markings/sec, 165 secs
lola: sara is running 170 secs || 8225353 markings, 10789224 edges, 46836 markings/sec, 170 secs
lola: sara is running 175 secs || 8459136 markings, 11104083 edges, 46757 markings/sec, 175 secs
lola: sara is running 180 secs || 8675963 markings, 11395716 edges, 43365 markings/sec, 180 secs
lola: sara is running 185 secs || 8897872 markings, 11695537 edges, 44382 markings/sec, 185 secs
lola: sara is running 190 secs || 9125944 markings, 12002202 edges, 45614 markings/sec, 190 secs
lola: sara is running 195 secs || 9358357 markings, 12316382 edges, 46483 markings/sec, 195 secs
lola: sara is running 200 secs || 9591260 markings, 12631943 edges, 46581 markings/sec, 200 secs
lola: sara is running 205 secs || 9823914 markings, 12946424 edges, 46531 markings/sec, 205 secs
lola: sara is running 210 secs || 10057039 markings, 13262457 edges, 46625 markings/sec, 210 secs
lola: sara is running 215 secs || 10288816 markings, 13575236 edges, 46355 markings/sec, 215 secs
lola: sara is running 220 secs || 10521103 markings, 13889864 edges, 46457 markings/sec, 220 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10533516 markings, 13907304 edges
lola: ========================================
lola: subprocess 1 will run for 3340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 <= p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378) AND (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 <= p349 + p350 + p351 + p352 + p353 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 <= p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378) AND (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 <= p349 + p350 + p351 + p352 + p353 + ... (shortened)
lola: processed formula length: 604
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 <= p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378) AND (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 <= p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358)) OR ((p482 + 1 <= p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429) AND (1 <= p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 259 markings, 258 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes
lola:
preliminary result: yes yes
lola: memory consumption: 26768 KB
lola: time consumption: 231 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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-S02J04T10"
export BK_EXAMINATION="ReachabilityCardinality"
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-S02J04T10, examination is ReachabilityCardinality"
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-158987871600286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T10.tgz
mv PolyORBLF-COL-S02J04T10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;