fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r176-tajo-158987872100575
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for PolyORBNT-COL-S05J40

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.290 3600000.00 400942.00 297.10 FTFFFFTTFTFFTFT? 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-158987872100575.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 PolyORBNT-COL-S05J40, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872100575
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 4.1K Apr 12 06:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 06:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 11 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:46 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:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 10 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 9 18:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 18:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 93K 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 PolyORBNT-COL-S05J40-ReachabilityFireability-00
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-01
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-02
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-03
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-04
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-05
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-06
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-07
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-08
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-09
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-10
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-11
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-12
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-13
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-14
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591165113866

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:18:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 06:18:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:18:38] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 06:18:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1404 ms
[2020-06-03 06:18:39] [INFO ] sort/places :
D4->place_482,
Threads->FetchJobB,QueueJobE,NotifyEventJobQueuedE,NotifyEventEndOfCheckSourcesE,NotifyEventEndOfCheckSourcesB,place_523,place_522,place_521,place_520,place_518,place_500,Check_Sources_E,Check_Sources_B,place_782,place_787,Perform_Work_E,Schedule_Task_B,Try_Check_Sources_E,Try_Check_Sources_B,
D5->Schedule_Task_E,
D6->CreatedJobs,
Jobs->f3,f2,f1,AvailableJobId,
Dot->block,mo3,mo2,mo1,mi3,mi2,mi1,cSources,place_462,place_460,place_458,place_456,CanInjectEvent,JobCnt,cJobCnt,
Sources->ModifiedSrc,DataOnSrc,TheSour,
D1->FetchJobE,QueueJobB,NotifyEventJobQueuedB,Perform_Work_B,

[2020-06-03 06:18:40] [INFO ] ms3 symmetric to ms4 in transition trans_489
[2020-06-03 06:18:40] [INFO ] ms4 symmetric to ms1 in transition trans_489
[2020-06-03 06:18:40] [INFO ] ms1 symmetric to ms2 in transition trans_489
[2020-06-03 06:18:40] [INFO ] ms3 symmetric to ms1 in transition trans_488
[2020-06-03 06:18:40] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2020-06-03 06:18:40] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2020-06-03 06:18:40] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 50 ms.
[2020-06-03 06:18:40] [INFO ] Computed order based on color domains.
[2020-06-03 06:18:40] [INFO ] Unfolded HLPN to a Petri net with 669 places and 975 transitions in 70 ms.
[2020-06-03 06:18:40] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 40 places in 13 ms
Reduce places removed 40 places and 40 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 193 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 686 resets, run finished after 345 ms. (steps per millisecond=28 ) properties seen :[0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0]
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 141 ms. (steps per millisecond=70 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 253 resets, run finished after 179 ms. (steps per millisecond=55 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 87 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 67 ms. (steps per millisecond=149 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 330 ms. (steps per millisecond=30 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 168 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 06:18:41] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2020-06-03 06:18:41] [INFO ] Computed 102 place invariants in 117 ms
[2020-06-03 06:18:42] [INFO ] [Real]Absence check using 95 positive place invariants in 117 ms returned sat
[2020-06-03 06:18:42] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 25 ms returned unsat
[2020-06-03 06:18:42] [INFO ] [Real]Absence check using 95 positive place invariants in 98 ms returned unsat
[2020-06-03 06:18:42] [INFO ] [Real]Absence check using 95 positive place invariants in 131 ms returned unsat
[2020-06-03 06:18:42] [INFO ] [Real]Absence check using 95 positive place invariants in 84 ms returned sat
[2020-06-03 06:18:42] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2020-06-03 06:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:18:46] [INFO ] [Real]Absence check using state equation in 3702 ms returned sat
[2020-06-03 06:18:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:18:46] [INFO ] [Real]Added 1 Read/Feed constraints in 26 ms returned sat
[2020-06-03 06:18:48] [INFO ] Deduced a trap composed of 205 places in 1481 ms
[2020-06-03 06:18:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s215 s216 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s238 s239 s240 s241 s242 s243 s244 s247 s248 s249 s251 s252 s253 s255 s263 s280 s281 s282 s283 s284 s380 s381 s382 s383 s384 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s445 s446 s447 s448 s449 s465 s466 s467 s468 s469 s475 s476 s477 s478 s479 s535 s536 s537 s538 s539 s540 s541 s542 s543 s544 s545 s546 s547 s548 s549 s550 s551 s552 s553 s554 s555 s556 s557 s558 s559 s560 s561 s562 s563 s564 s565 s566 s567 s568 s569 s570 s571 s572 s573 s574 s575 s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599 s600 s601 s602 s603 s604 s605 s606 s607 s608 s609 s610 s611 s612 s613 s614 s615 s616 s617 s618 s619 s620 s621 s622 s623 s624 s625 s628) 0)") while checking expression at index 3
[2020-06-03 06:18:48] [INFO ] [Real]Absence check using 95 positive place invariants in 49 ms returned unsat
[2020-06-03 06:18:48] [INFO ] [Real]Absence check using 95 positive place invariants in 89 ms returned unsat
[2020-06-03 06:18:49] [INFO ] [Real]Absence check using 95 positive place invariants in 235 ms returned sat
[2020-06-03 06:18:49] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 78 ms returned unsat
[2020-06-03 06:18:49] [INFO ] [Real]Absence check using 95 positive place invariants in 97 ms returned sat
[2020-06-03 06:18:49] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 32 ms returned sat
[2020-06-03 06:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:18:53] [INFO ] [Real]Absence check using state equation in 3814 ms returned sat
[2020-06-03 06:18:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:18:53] [INFO ] [Nat]Absence check using 95 positive place invariants in 107 ms returned sat
[2020-06-03 06:18:53] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 21 ms returned sat
[2020-06-03 06:18:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:18:55] [INFO ] [Nat]Absence check using state equation in 2049 ms returned sat
[2020-06-03 06:18:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2020-06-03 06:18:55] [INFO ] Computed and/alt/rep : 929/20282/925 causal constraints in 155 ms.
[2020-06-03 06:18:58] [INFO ] Added : 38 causal constraints over 8 iterations in 2235 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 55 ms.
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 5300 steps, including 232 resets, run finished after 66 ms. (steps per millisecond=80 ) properties seen :[0, 0] could not realise parikh vector
Support contains 56 out of 629 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 624 transition count 890
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 95 place count 579 transition count 890
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 95 place count 579 transition count 847
Deduced a syphon composed of 43 places in 4 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 181 place count 536 transition count 847
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 535 transition count 846
Applied a total of 183 rules in 310 ms. Remains 535 /629 variables (removed 94) and now considering 846/935 (removed 89) transitions.
[2020-06-03 06:18:58] [INFO ] Flow matrix only has 842 transitions (discarded 4 similar events)
// Phase 1: matrix 842 rows 535 cols
[2020-06-03 06:18:58] [INFO ] Computed 97 place invariants in 119 ms
[2020-06-03 06:19:03] [INFO ] Dead Transitions using invariants and state equation in 4632 ms returned [515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 556, 557, 558, 559, 560, 562, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 591, 592, 593, 594, 595, 597, 600, 601, 602, 603, 604, 605, 607, 610, 614, 615, 616, 617, 618, 619, 620, 622, 625, 629, 634]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[634, 629, 625, 622, 620, 619, 618, 617, 616, 615, 614, 610, 607, 605, 604, 603, 602, 601, 600, 597, 595, 594, 593, 592, 591, 589, 588, 587, 586, 585, 584, 583, 582, 581, 580, 579, 578, 577, 576, 575, 574, 573, 572, 571, 570, 569, 568, 567, 566, 565, 562, 560, 559, 558, 557, 556, 554, 553, 552, 551, 550, 549, 548, 547, 546, 545, 544, 543, 542, 541, 540, 539, 538, 537, 536, 534, 533, 532, 531, 530, 529, 528, 527, 526, 525, 524, 523, 522, 521, 520, 519, 518, 517, 516, 515]
Starting structural reductions, iteration 1 : 535/629 places, 751/935 transitions.
Applied a total of 0 rules in 66 ms. Remains 535 /535 variables (removed 0) and now considering 751/751 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 535/629 places, 751/935 transitions.
Incomplete random walk after 1000000 steps, including 65413 resets, run finished after 3761 ms. (steps per millisecond=265 ) properties seen :[1, 0]
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7984 resets, run finished after 3225 ms. (steps per millisecond=310 ) properties seen :[0]
[2020-06-03 06:19:10] [INFO ] Flow matrix only has 747 transitions (discarded 4 similar events)
// Phase 1: matrix 747 rows 535 cols
[2020-06-03 06:19:10] [INFO ] Computed 97 place invariants in 24 ms
[2020-06-03 06:19:10] [INFO ] [Real]Absence check using 90 positive place invariants in 111 ms returned sat
[2020-06-03 06:19:10] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 51 ms returned sat
[2020-06-03 06:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:19:13] [INFO ] [Real]Absence check using state equation in 3010 ms returned sat
[2020-06-03 06:19:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:19:13] [INFO ] [Real]Added 1 Read/Feed constraints in 21 ms returned sat
[2020-06-03 06:19:14] [INFO ] Deduced a trap composed of 180 places in 808 ms
[2020-06-03 06:19:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 866 ms
[2020-06-03 06:19:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:19:15] [INFO ] [Nat]Absence check using 90 positive place invariants in 572 ms returned sat
[2020-06-03 06:19:15] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 46 ms returned sat
[2020-06-03 06:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:19:18] [INFO ] [Nat]Absence check using state equation in 2725 ms returned sat
[2020-06-03 06:19:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 45 ms returned sat
[2020-06-03 06:19:19] [INFO ] Deduced a trap composed of 119 places in 1076 ms
[2020-06-03 06:19:21] [INFO ] Deduced a trap composed of 159 places in 2021 ms
[2020-06-03 06:19:22] [INFO ] Deduced a trap composed of 166 places in 369 ms
[2020-06-03 06:19:22] [INFO ] Deduced a trap composed of 180 places in 390 ms
[2020-06-03 06:19:23] [INFO ] Deduced a trap composed of 168 places in 498 ms
[2020-06-03 06:19:23] [INFO ] Deduced a trap composed of 166 places in 546 ms
[2020-06-03 06:19:24] [INFO ] Deduced a trap composed of 157 places in 1125 ms
[2020-06-03 06:19:26] [INFO ] Deduced a trap composed of 162 places in 408 ms
[2020-06-03 06:19:28] [INFO ] Deduced a trap composed of 163 places in 1732 ms
[2020-06-03 06:19:29] [INFO ] Deduced a trap composed of 171 places in 606 ms
[2020-06-03 06:19:30] [INFO ] Deduced a trap composed of 162 places in 1101 ms
[2020-06-03 06:19:30] [INFO ] Deduced a trap composed of 168 places in 402 ms
[2020-06-03 06:19:31] [INFO ] Deduced a trap composed of 171 places in 467 ms
[2020-06-03 06:19:31] [INFO ] Deduced a trap composed of 165 places in 349 ms
[2020-06-03 06:19:33] [INFO ] Deduced a trap composed of 177 places in 1365 ms
[2020-06-03 06:19:33] [INFO ] Deduced a trap composed of 168 places in 552 ms
[2020-06-03 06:19:36] [INFO ] Deduced a trap composed of 168 places in 2614 ms
[2020-06-03 06:19:37] [INFO ] Deduced a trap composed of 168 places in 353 ms
[2020-06-03 06:19:37] [INFO ] Deduced a trap composed of 174 places in 377 ms
[2020-06-03 06:19:38] [INFO ] Deduced a trap composed of 180 places in 443 ms
[2020-06-03 06:19:38] [INFO ] Deduced a trap composed of 183 places in 637 ms
[2020-06-03 06:19:39] [INFO ] Deduced a trap composed of 177 places in 540 ms
[2020-06-03 06:19:41] [INFO ] Deduced a trap composed of 171 places in 1582 ms
[2020-06-03 06:19:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:20:00] [INFO ] Deduced a trap composed of 6 places in 873 ms
[2020-06-03 06:20:00] [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 (> (+ s267 s268 s269 s270 s271 s481) 0)") while checking expression at index 0
Support contains 54 out of 535 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 535/535 places, 751/751 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 535 transition count 750
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 750
Applied a total of 2 rules in 24 ms. Remains 534 /535 variables (removed 1) and now considering 750/751 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 534/535 places, 750/751 transitions.
Incomplete random walk after 1000000 steps, including 69486 resets, run finished after 3090 ms. (steps per millisecond=323 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 7952 resets, run finished after 3230 ms. (steps per millisecond=309 ) properties seen :[0]
Interrupted probabilistic random walk after 7565768 steps, run timeout after 30001 ms. (steps per millisecond=252 ) properties seen :[0]
Probabilistic random walk after 7565768 steps, saw 2436037 distinct states, run finished after 30002 ms. (steps per millisecond=252 ) properties seen :[0]
[2020-06-03 06:20:36] [INFO ] Flow matrix only has 746 transitions (discarded 4 similar events)
// Phase 1: matrix 746 rows 534 cols
[2020-06-03 06:20:36] [INFO ] Computed 97 place invariants in 24 ms
[2020-06-03 06:20:37] [INFO ] [Real]Absence check using 90 positive place invariants in 68 ms returned sat
[2020-06-03 06:20:37] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 22 ms returned sat
[2020-06-03 06:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:20:39] [INFO ] [Real]Absence check using state equation in 2202 ms returned sat
[2020-06-03 06:20:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:20:39] [INFO ] [Real]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-06-03 06:20:40] [INFO ] Deduced a trap composed of 183 places in 877 ms
[2020-06-03 06:20:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 950 ms
[2020-06-03 06:20:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:20:40] [INFO ] [Nat]Absence check using 90 positive place invariants in 73 ms returned sat
[2020-06-03 06:20:40] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 33 ms returned sat
[2020-06-03 06:20:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:20:43] [INFO ] [Nat]Absence check using state equation in 2885 ms returned sat
[2020-06-03 06:20:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 60 ms returned sat
[2020-06-03 06:20:45] [INFO ] Deduced a trap composed of 119 places in 1812 ms
[2020-06-03 06:20:50] [INFO ] Deduced a trap composed of 163 places in 4533 ms
[2020-06-03 06:20:50] [INFO ] Deduced a trap composed of 184 places in 346 ms
[2020-06-03 06:20:51] [INFO ] Deduced a trap composed of 165 places in 590 ms
[2020-06-03 06:20:53] [INFO ] Deduced a trap composed of 181 places in 1964 ms
[2020-06-03 06:20:53] [INFO ] Deduced a trap composed of 174 places in 460 ms
[2020-06-03 06:20:54] [INFO ] Deduced a trap composed of 169 places in 329 ms
[2020-06-03 06:20:54] [INFO ] Deduced a trap composed of 193 places in 517 ms
[2020-06-03 06:20:55] [INFO ] Deduced a trap composed of 183 places in 512 ms
[2020-06-03 06:20:57] [INFO ] Deduced a trap composed of 181 places in 2250 ms
[2020-06-03 06:21:02] [INFO ] Deduced a trap composed of 180 places in 4465 ms
[2020-06-03 06:21:02] [INFO ] Deduced a trap composed of 210 places in 413 ms
[2020-06-03 06:21:03] [INFO ] Deduced a trap composed of 187 places in 1002 ms
[2020-06-03 06:21:05] [INFO ] Deduced a trap composed of 160 places in 1255 ms
[2020-06-03 06:21:07] [INFO ] Deduced a trap composed of 174 places in 1689 ms
[2020-06-03 06:21:10] [INFO ] Deduced a trap composed of 175 places in 2105 ms
[2020-06-03 06:21:11] [INFO ] Deduced a trap composed of 159 places in 723 ms
[2020-06-03 06:21:15] [INFO ] Deduced a trap composed of 183 places in 3315 ms
[2020-06-03 06:21:18] [INFO ] Deduced a trap composed of 174 places in 3733 ms
[2020-06-03 06:21:20] [INFO ] Deduced a trap composed of 178 places in 694 ms
[2020-06-03 06:21:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:21:25] [INFO ] Deduced a trap composed of 6 places in 489 ms
[2020-06-03 06:21:25] [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 (> (+ s316 s317 s318 s319 s320 s490) 0)") while checking expression at index 0
Support contains 54 out of 534 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 534/534 places, 750/750 transitions.
Applied a total of 0 rules in 56 ms. Remains 534 /534 variables (removed 0) and now considering 750/750 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 534/534 places, 750/750 transitions.
Starting structural reductions, iteration 0 : 534/534 places, 750/750 transitions.
Applied a total of 0 rules in 25 ms. Remains 534 /534 variables (removed 0) and now considering 750/750 (removed 0) transitions.
[2020-06-03 06:21:25] [INFO ] Flow matrix only has 746 transitions (discarded 4 similar events)
// Phase 1: matrix 746 rows 534 cols
[2020-06-03 06:21:26] [INFO ] Computed 97 place invariants in 15 ms
[2020-06-03 06:21:27] [INFO ] Implicit Places using invariants in 1414 ms returned []
[2020-06-03 06:21:27] [INFO ] Flow matrix only has 746 transitions (discarded 4 similar events)
// Phase 1: matrix 746 rows 534 cols
[2020-06-03 06:21:27] [INFO ] Computed 97 place invariants in 40 ms
[2020-06-03 06:21:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:21:32] [INFO ] Implicit Places using invariants and state equation in 5528 ms returned []
Implicit Place search using SMT with State Equation took 6960 ms to find 0 implicit places.
[2020-06-03 06:21:33] [INFO ] Redundant transitions in 116 ms returned []
[2020-06-03 06:21:33] [INFO ] Flow matrix only has 746 transitions (discarded 4 similar events)
// Phase 1: matrix 746 rows 534 cols
[2020-06-03 06:21:33] [INFO ] Computed 97 place invariants in 28 ms
[2020-06-03 06:21:34] [INFO ] Dead Transitions using invariants and state equation in 1765 ms returned []
Finished structural reductions, in 1 iterations. Remains : 534/534 places, 750/750 transitions.
Incomplete random walk after 100000 steps, including 6857 resets, run finished after 455 ms. (steps per millisecond=219 ) properties seen :[0]
[2020-06-03 06:21:35] [INFO ] Flow matrix only has 746 transitions (discarded 4 similar events)
// Phase 1: matrix 746 rows 534 cols
[2020-06-03 06:21:35] [INFO ] Computed 97 place invariants in 14 ms
[2020-06-03 06:21:35] [INFO ] [Real]Absence check using 90 positive place invariants in 60 ms returned sat
[2020-06-03 06:21:35] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 20 ms returned sat
[2020-06-03 06:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:21:36] [INFO ] [Real]Absence check using state equation in 954 ms returned sat
[2020-06-03 06:21:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:21:36] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-03 06:21:39] [INFO ] Deduced a trap composed of 183 places in 3061 ms
[2020-06-03 06:21:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3117 ms
[2020-06-03 06:21:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:21:39] [INFO ] [Nat]Absence check using 90 positive place invariants in 57 ms returned sat
[2020-06-03 06:21:39] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 22 ms returned sat
[2020-06-03 06:21:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:21:40] [INFO ] [Nat]Absence check using state equation in 1132 ms returned sat
[2020-06-03 06:21:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2020-06-03 06:21:44] [INFO ] Deduced a trap composed of 119 places in 3281 ms
[2020-06-03 06:21:49] [INFO ] Deduced a trap composed of 163 places in 4889 ms
[2020-06-03 06:21:49] [INFO ] Deduced a trap composed of 184 places in 309 ms
[2020-06-03 06:21:50] [INFO ] Deduced a trap composed of 165 places in 373 ms
[2020-06-03 06:21:50] [INFO ] Deduced a trap composed of 181 places in 301 ms
[2020-06-03 06:21:51] [INFO ] Deduced a trap composed of 174 places in 405 ms
[2020-06-03 06:21:51] [INFO ] Deduced a trap composed of 169 places in 304 ms
[2020-06-03 06:21:51] [INFO ] Deduced a trap composed of 193 places in 361 ms
[2020-06-03 06:21:52] [INFO ] Deduced a trap composed of 183 places in 268 ms
[2020-06-03 06:21:52] [INFO ] Deduced a trap composed of 181 places in 345 ms
[2020-06-03 06:21:53] [INFO ] Deduced a trap composed of 180 places in 364 ms
[2020-06-03 06:21:53] [INFO ] Deduced a trap composed of 210 places in 385 ms
[2020-06-03 06:21:54] [INFO ] Deduced a trap composed of 187 places in 507 ms
[2020-06-03 06:21:54] [INFO ] Deduced a trap composed of 160 places in 293 ms
[2020-06-03 06:21:55] [INFO ] Deduced a trap composed of 174 places in 404 ms
[2020-06-03 06:21:56] [INFO ] Deduced a trap composed of 175 places in 610 ms
[2020-06-03 06:21:57] [INFO ] Deduced a trap composed of 159 places in 367 ms
[2020-06-03 06:21:58] [INFO ] Deduced a trap composed of 183 places in 361 ms
[2020-06-03 06:21:58] [INFO ] Deduced a trap composed of 174 places in 352 ms
[2020-06-03 06:21:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:22:00] [INFO ] Deduced a trap composed of 6 places in 418 ms
[2020-06-03 06:22:00] [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 (> (+ s316 s317 s318 s319 s320 s490) 0)") while checking expression at index 0
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 534 transition count 746
Applied a total of 4 rules in 18 ms. Remains 534 /534 variables (removed 0) and now considering 746/750 (removed 4) transitions.
// Phase 1: matrix 746 rows 534 cols
[2020-06-03 06:22:00] [INFO ] Computed 97 place invariants in 11 ms
[2020-06-03 06:22:00] [INFO ] [Real]Absence check using 90 positive place invariants in 51 ms returned sat
[2020-06-03 06:22:00] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 20 ms returned sat
[2020-06-03 06:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:22:01] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2020-06-03 06:22:01] [INFO ] Deduced a trap composed of 187 places in 706 ms
[2020-06-03 06:22:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 907 ms
[2020-06-03 06:22:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:22:02] [INFO ] [Nat]Absence check using 90 positive place invariants in 272 ms returned sat
[2020-06-03 06:22:02] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 23 ms returned sat
[2020-06-03 06:22:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:22:03] [INFO ] [Nat]Absence check using state equation in 1525 ms returned sat
[2020-06-03 06:22:04] [INFO ] Deduced a trap composed of 185 places in 331 ms
[2020-06-03 06:22:04] [INFO ] Deduced a trap composed of 177 places in 340 ms
[2020-06-03 06:22:05] [INFO ] Deduced a trap composed of 165 places in 412 ms
[2020-06-03 06:22:06] [INFO ] Deduced a trap composed of 177 places in 857 ms
[2020-06-03 06:22:14] [INFO ] Deduced a trap composed of 162 places in 8463 ms
[2020-06-03 06:22:14] [INFO ] Deduced a trap composed of 165 places in 301 ms
[2020-06-03 06:22:15] [INFO ] Deduced a trap composed of 165 places in 463 ms
[2020-06-03 06:22:15] [INFO ] Deduced a trap composed of 165 places in 394 ms
[2020-06-03 06:22:16] [INFO ] Deduced a trap composed of 177 places in 401 ms
[2020-06-03 06:22:16] [INFO ] Deduced a trap composed of 177 places in 330 ms
[2020-06-03 06:22:17] [INFO ] Deduced a trap composed of 177 places in 336 ms
[2020-06-03 06:22:17] [INFO ] Deduced a trap composed of 180 places in 511 ms
[2020-06-03 06:22:18] [INFO ] Deduced a trap composed of 177 places in 529 ms
[2020-06-03 06:22:19] [INFO ] Deduced a trap composed of 177 places in 525 ms
[2020-06-03 06:22:19] [INFO ] Deduced a trap composed of 162 places in 480 ms
[2020-06-03 06:22:20] [INFO ] Deduced a trap composed of 165 places in 292 ms
[2020-06-03 06:22:20] [INFO ] Deduced a trap composed of 171 places in 275 ms
[2020-06-03 06:22:20] [INFO ] Deduced a trap composed of 171 places in 277 ms
[2020-06-03 06:22:21] [INFO ] Deduced a trap composed of 180 places in 535 ms
[2020-06-03 06:22:22] [INFO ] Deduced a trap composed of 186 places in 516 ms
[2020-06-03 06:22:22] [INFO ] Deduced a trap composed of 156 places in 299 ms
[2020-06-03 06:22:23] [INFO ] Deduced a trap composed of 171 places in 410 ms
[2020-06-03 06:22:23] [INFO ] Deduced a trap composed of 159 places in 281 ms
[2020-06-03 06:22:24] [INFO ] Deduced a trap composed of 180 places in 416 ms
[2020-06-03 06:22:24] [INFO ] Deduced a trap composed of 171 places in 348 ms
[2020-06-03 06:22:24] [INFO ] Deduced a trap composed of 173 places in 283 ms
[2020-06-03 06:22:25] [INFO ] Deduced a trap composed of 171 places in 312 ms
[2020-06-03 06:22:25] [INFO ] Deduced a trap composed of 177 places in 289 ms
[2020-06-03 06:22:26] [INFO ] Deduced a trap composed of 165 places in 530 ms
[2020-06-03 06:22:27] [INFO ] Deduced a trap composed of 174 places in 296 ms
[2020-06-03 06:22:27] [INFO ] Deduced a trap composed of 177 places in 329 ms
[2020-06-03 06:22:27] [INFO ] Deduced a trap composed of 168 places in 270 ms
[2020-06-03 06:22:28] [INFO ] Deduced a trap composed of 165 places in 281 ms
[2020-06-03 06:22:28] [INFO ] Deduced a trap composed of 174 places in 307 ms
[2020-06-03 06:22:29] [INFO ] Deduced a trap composed of 174 places in 315 ms
[2020-06-03 06:22:29] [INFO ] Deduced a trap composed of 174 places in 307 ms
[2020-06-03 06:22:29] [INFO ] Deduced a trap composed of 171 places in 289 ms
[2020-06-03 06:22:30] [INFO ] Deduced a trap composed of 162 places in 320 ms
[2020-06-03 06:22:30] [INFO ] Deduced a trap composed of 165 places in 397 ms
[2020-06-03 06:22:31] [INFO ] Deduced a trap composed of 168 places in 412 ms
[2020-06-03 06:22:31] [INFO ] Deduced a trap composed of 177 places in 584 ms
[2020-06-03 06:22:35] [INFO ] Deduced a trap composed of 165 places in 3788 ms
[2020-06-03 06:22:41] [INFO ] Deduced a trap composed of 168 places in 5277 ms
[2020-06-03 06:22:41] [INFO ] Deduced a trap composed of 186 places in 284 ms
[2020-06-03 06:22:41] [INFO ] Deduced a trap composed of 171 places in 302 ms
[2020-06-03 06:22:42] [INFO ] Deduced a trap composed of 162 places in 304 ms
[2020-06-03 06:22:42] [INFO ] Deduced a trap composed of 156 places in 279 ms
[2020-06-03 06:22:42] [INFO ] Deduced a trap composed of 162 places in 280 ms
[2020-06-03 06:22:43] [INFO ] Deduced a trap composed of 159 places in 275 ms
[2020-06-03 06:22:43] [INFO ] Deduced a trap composed of 165 places in 299 ms
[2020-06-03 06:22:44] [INFO ] Deduced a trap composed of 171 places in 331 ms
[2020-06-03 06:22:44] [INFO ] Deduced a trap composed of 177 places in 292 ms
[2020-06-03 06:22:45] [INFO ] Deduced a trap composed of 177 places in 290 ms
[2020-06-03 06:22:45] [INFO ] Deduced a trap composed of 168 places in 305 ms
[2020-06-03 06:22:46] [INFO ] Deduced a trap composed of 156 places in 297 ms
[2020-06-03 06:22:46] [INFO ] Deduced a trap composed of 159 places in 320 ms
[2020-06-03 06:22:47] [INFO ] Deduced a trap composed of 171 places in 275 ms
[2020-06-03 06:22:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s45 s57 s64 s65 s70 s71 s78 s79 s80 s83 s84 s86 s98 s105 s106 s111 s112 s119 s120 s121 s124 s125 s130 s142 s149 s150 s155 s156 s163 s164 s165 s168 s169 s171 s183 s190 s191 s196 s197 s204 s205 s206 s209 s210 s215 s227 s234 s235 s240 s241 s248 s249 s250 s253 s254 s255 s257 s258 s259 s266 s267 s276 s277 s281 s282 s286 s287 s291 s292 s296 s297 s301 s302 s306 s307 s311 s312 s316 s317 s321 s322 s326 s327 s336 s337 s341 s342 s346 s347 s351 s352 s356 s357 s361 s362 s376 s377 s381 s382 s386 s387 s391 s392 s406 s407 s411 s412 s416 s417 s421 s422 s426 s427 s431 s432 s451 s452 s456 s457 s471 s472 s477 s478 s479 s526 s528 s529 s530 s531) 0)") while checking expression at index 0
[2020-06-03 06:22:47] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 17 ms.
[2020-06-03 06:22:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
[2020-06-03 06:22:47] [INFO ] Flatten gal took : 158 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ PolyORBNT-COL-S05J40 @ 3570 seconds
vrfy: finished
info: timeLeft: 3509
rslt: Output for ReachabilityFireability @ PolyORBNT-COL-S05J40

{
"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",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 06:22:47 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 56848,
"runtime": 61.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 47,
"adisj": 1,
"aneg": 0,
"comp": 142,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 142,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 54,
"visible_transitions": 0
},
"processed": "E (F (((4 <= p256) AND ((p255 <= 0) OR (p529 <= 0) OR (p532 <= 0) OR ((1 <= p0) AND (1 <= p68) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p73) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p63) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p78) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p58) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p49) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p72) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p53) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p64) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p83) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p79) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p62) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p45) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p59) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p76) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p71) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p54) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p84) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p50) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p67) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p46) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p80) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p75) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p56) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p61) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p60) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p55) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p81) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p47) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p70) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p66) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p57) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p52) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p74) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p77) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p82) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p65) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p44) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p69) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p48) AND (1 <= p211)) OR ((1 <= p262) AND (1 <= p527) AND (1 <= p528)) OR ((1 <= p263) AND (1 <= p527) AND (1 <= p528)) OR ((1 <= p260) AND (1 <= p527) AND (1 <= p528)) OR ((1 <= p261) AND (1 <= p527) AND (1 <= p528)) OR ((1 <= p264) AND (1 <= p527) AND (1 <= p528))))))",
"processed_size": 2248,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 3814,
"conflict_clusters": 54,
"places": 534,
"places_significant": 437,
"singleton_clusters": 0,
"transitions": 750
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 190,
"problems": 49
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
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: 1284/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 17088
lola: finding significant places
lola: 534 places, 750 transitions, 437 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 ReachabilityFireability.xml
lola: E (F (((4 <= p256) AND ((p255 <= 0) OR (p529 <= 0) OR (p532 <= 0) OR ((1 <= p0) AND (1 <= p68) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p73) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p63) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p78) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p58) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p49) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p72) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p53) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p64) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p83) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p79) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p62) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p45) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p59) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p76) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p71) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p54) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p84) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p50) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p67) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p46) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p80) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p75) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p56) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p61) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p60) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p55) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p81) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p47) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p70) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p66) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p57) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p52) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p74) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p77) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p82) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p65) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p44) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p69) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p48) AND (1 <= p211)) OR ((1 <= p262) AND (1 <= p527) AND (1 <= p528)) OR ((1 <= p263) AND (1 <= p527) AND (1 <= p528)) OR ((1 <= p260) AND (1 <= p527) AND (1 <= p528)) OR ((1 <= p261) AND (1 <= p527) AND (1 <= p528)) OR ((1 <= p264) AND (1 <= p527) AND (1 <= p528))))))
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 (((4 <= p256) AND ((p255 <= 0) OR (p529 <= 0) OR (p532 <= 0) OR ((1 <= p0) AND (1 <= p68) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p73) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p63) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p78) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p58) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p49) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p72) AND (1 <= p211)) OR ... (shortened)
lola: processed formula length: 2248
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: subprocess will run for 0 seconds at most (--localtimelimit)
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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((4 <= p256) AND ((p255 <= 0) OR (p529 <= 0) OR (p532 <= 0) OR ((1 <= p0) AND (1 <= p68) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p73) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p63) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p78) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p58) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p49) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p72) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p53) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p64) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p83) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p79) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p62) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p45) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p59) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p76) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p71) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p54) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p84) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p50) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p67) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p46) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p80) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p75) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p56) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p61) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p60) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p55) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p81) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p47) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p70) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p66) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p57) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p52) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p74) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p77) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p82) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p65) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p44) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p69) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p48) AND (1 <= p211)) OR ((1 <= p262) AND (1 <= p527) AND (1 <= p528)) OR ((1 <= p263) AND (1 <= p527) AND (1 <= p528)) OR ((1 <= p260) AND (1 <= p527) AND (1 <= p528)) OR ((1 <= p261) AND (1 <= p527) AND (1 <= p528)) OR ((1 <= p264) AND (1 <= p527) AND (1 <= p528))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 190 literals and 49 conjunctive subformulas
lola: memory consumption: 56848 KB
lola: time consumption: 61 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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="PolyORBNT-COL-S05J40"
export BK_EXAMINATION="ReachabilityFireability"
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 PolyORBNT-COL-S05J40, examination is ReachabilityFireability"
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-158987872100575"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J40.tgz
mv PolyORBNT-COL-S05J40 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;