About the Execution of ITS-LoLa for PolyORBNT-COL-S05J20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15757.680 | 3600000.00 | 149571.00 | 107.60 | FTTF?TFFFTFFTFFT | 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-158987872000558.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-S05J20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872000558
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 3.8K Apr 12 05:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 05:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 11 05:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 05:42 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.4K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 3.5K Apr 10 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 9 18:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Apr 9 18:34 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 92K 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-S05J20-ReachabilityCardinality-00
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-01
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-02
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-03
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-04
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-05
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-06
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-07
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-08
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-09
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1591163732301
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:55:33] [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-03 05:55:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:55:33] [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 05:55:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 564 ms
[2020-06-03 05:55:34] [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 05:55:34] [INFO ] ms1 symmetric to ms3 in transition trans_489
[2020-06-03 05:55:34] [INFO ] ms3 symmetric to ms4 in transition trans_489
[2020-06-03 05:55:34] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2020-06-03 05:55:34] [INFO ] ms1 symmetric to ms3 in transition trans_488
[2020-06-03 05:55:34] [INFO ] ms3 symmetric to ms2 in transition trans_488
[2020-06-03 05:55:34] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2020-06-03 05:55:34] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 24 ms.
[2020-06-03 05:55:34] [INFO ] Computed order based on color domains.
[2020-06-03 05:55:34] [INFO ] Unfolded HLPN to a Petri net with 369 places and 575 transitions in 15 ms.
[2020-06-03 05:55:34] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 20 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 678 resets, run finished after 92 ms. (steps per millisecond=108 ) properties seen :[0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 250 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 173 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 192 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 167 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 183 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 123 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 191 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 05:55:34] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2020-06-03 05:55:34] [INFO ] Computed 62 place invariants in 64 ms
[2020-06-03 05:55:35] [INFO ] [Real]Absence check using 55 positive place invariants in 50 ms returned sat
[2020-06-03 05:55:35] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned unsat
[2020-06-03 05:55:35] [INFO ] [Real]Absence check using 55 positive place invariants in 36 ms returned sat
[2020-06-03 05:55:35] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2020-06-03 05:55:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:35] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2020-06-03 05:55:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:35] [INFO ] [Nat]Absence check using 55 positive place invariants in 37 ms returned sat
[2020-06-03 05:55:35] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 17 ms returned sat
[2020-06-03 05:55:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:36] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2020-06-03 05:55:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 05:55:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-06-03 05:55:36] [INFO ] Deduced a trap composed of 184 places in 220 ms
[2020-06-03 05:55:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 261 ms
[2020-06-03 05:55:36] [INFO ] [Real]Absence check using 55 positive place invariants in 34 ms returned sat
[2020-06-03 05:55:36] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2020-06-03 05:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:37] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2020-06-03 05:55:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:37] [INFO ] [Nat]Absence check using 55 positive place invariants in 37 ms returned sat
[2020-06-03 05:55:37] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 16 ms returned sat
[2020-06-03 05:55:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:38] [INFO ] [Nat]Absence check using state equation in 691 ms returned sat
[2020-06-03 05:55:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 2284 ms returned sat
[2020-06-03 05:55:40] [INFO ] Computed and/alt/rep : 549/8982/545 causal constraints in 90 ms.
[2020-06-03 05:55:42] [INFO ] Added : 35 causal constraints over 7 iterations in 1490 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 41 ms.
[2020-06-03 05:55:42] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2020-06-03 05:55:42] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 10 ms returned sat
[2020-06-03 05:55:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:43] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2020-06-03 05:55:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:43] [INFO ] [Nat]Absence check using 55 positive place invariants in 45 ms returned sat
[2020-06-03 05:55:43] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 14 ms returned sat
[2020-06-03 05:55:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:43] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2020-06-03 05:55:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:55:43] [INFO ] Deduced a trap composed of 57 places in 238 ms
[2020-06-03 05:55:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2020-06-03 05:55:44] [INFO ] Computed and/alt/rep : 549/8982/545 causal constraints in 95 ms.
[2020-06-03 05:55:46] [INFO ] Added : 44 causal constraints over 9 iterations in 2052 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2020-06-03 05:55:46] [INFO ] [Real]Absence check using 55 positive place invariants in 24 ms returned sat
[2020-06-03 05:55:46] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 3 ms returned unsat
[2020-06-03 05:55:46] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned unsat
[2020-06-03 05:55:46] [INFO ] [Real]Absence check using 55 positive place invariants in 40 ms returned sat
[2020-06-03 05:55:46] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 10 ms returned sat
[2020-06-03 05:55:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:47] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2020-06-03 05:55:47] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:55:47] [INFO ] Computed and/alt/rep : 549/8982/545 causal constraints in 70 ms.
[2020-06-03 05:55:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:47] [INFO ] [Nat]Absence check using 55 positive place invariants in 227 ms returned sat
[2020-06-03 05:55:47] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 24 ms returned sat
[2020-06-03 05:55:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:48] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2020-06-03 05:55:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:55:48] [INFO ] Computed and/alt/rep : 549/8982/545 causal constraints in 70 ms.
[2020-06-03 05:55:48] [INFO ] Added : 14 causal constraints over 3 iterations in 318 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-06-03 05:55:48] [INFO ] [Real]Absence check using 55 positive place invariants in 34 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 15 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:49] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:55:49] [INFO ] Computed and/alt/rep : 549/8982/545 causal constraints in 46 ms.
[2020-06-03 05:55:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:49] [INFO ] [Nat]Absence check using 55 positive place invariants in 42 ms returned sat
[2020-06-03 05:55:50] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 13 ms returned sat
[2020-06-03 05:55:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:50] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
[2020-06-03 05:55:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-06-03 05:55:50] [INFO ] Computed and/alt/rep : 549/8982/545 causal constraints in 50 ms.
[2020-06-03 05:55:50] [INFO ] Added : 14 causal constraints over 3 iterations in 217 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-03 05:55:51] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned unsat
[2020-06-03 05:55:51] [INFO ] [Real]Absence check using 55 positive place invariants in 25 ms returned sat
[2020-06-03 05:55:51] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 4 ms returned unsat
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 1400 steps, including 94 resets, run finished after 23 ms. (steps per millisecond=60 ) properties seen :[0, 0, 1, 1] could not realise parikh vector
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1400 steps, including 95 resets, run finished after 11 ms. (steps per millisecond=127 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 6700 steps, including 545 resets, run finished after 34 ms. (steps per millisecond=197 ) properties seen :[0, 1] could not realise parikh vector
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 4200 steps, including 160 resets, run finished after 19 ms. (steps per millisecond=221 ) properties seen :[0] could not realise parikh vector
Support contains 131 out of 349 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 344 transition count 530
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 55 place count 319 transition count 530
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 55 place count 319 transition count 508
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 99 place count 297 transition count 508
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 297 transition count 508
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 296 transition count 507
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 294 transition count 505
Applied a total of 106 rules in 112 ms. Remains 294 /349 variables (removed 55) and now considering 505/555 (removed 50) transitions.
[2020-06-03 05:55:51] [INFO ] Flow matrix only has 501 transitions (discarded 4 similar events)
// Phase 1: matrix 501 rows 294 cols
[2020-06-03 05:55:51] [INFO ] Computed 57 place invariants in 24 ms
[2020-06-03 05:55:52] [INFO ] Dead Transitions using invariants and state equation in 791 ms returned [271, 272, 273, 274, 276, 279, 283, 288, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 335, 336, 337, 338, 339, 341, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 370, 371, 372, 373, 374, 376, 379, 380, 381, 382, 383, 384, 386, 389, 393, 394, 395]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[395, 394, 393, 389, 386, 384, 383, 382, 381, 380, 379, 376, 374, 373, 372, 371, 370, 368, 367, 366, 365, 364, 363, 362, 361, 360, 359, 358, 357, 356, 355, 354, 353, 352, 351, 350, 349, 348, 347, 346, 345, 344, 341, 339, 338, 337, 336, 335, 333, 332, 331, 330, 329, 328, 327, 326, 325, 324, 323, 322, 321, 320, 319, 318, 317, 316, 315, 313, 312, 311, 310, 309, 308, 307, 306, 305, 304, 303, 302, 301, 300, 299, 298, 297, 296, 295, 294, 288, 283, 279, 276, 274, 273, 272, 271]
Starting structural reductions, iteration 1 : 294/349 places, 410/555 transitions.
Applied a total of 0 rules in 14 ms. Remains 294 /294 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 294/349 places, 410/555 transitions.
Incomplete random walk after 1000000 steps, including 72690 resets, run finished after 2590 ms. (steps per millisecond=386 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 32258 resets, run finished after 1892 ms. (steps per millisecond=528 ) properties seen :[0]
Interrupted probabilistic random walk after 13197297 steps, run timeout after 30001 ms. (steps per millisecond=439 ) properties seen :[0]
Probabilistic random walk after 13197297 steps, saw 3528197 distinct states, run finished after 30002 ms. (steps per millisecond=439 ) properties seen :[0]
[2020-06-03 05:56:26] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-06-03 05:56:26] [INFO ] Computed 57 place invariants in 9 ms
[2020-06-03 05:56:26] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2020-06-03 05:56:26] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 13 ms returned sat
[2020-06-03 05:56:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:27] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2020-06-03 05:56:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 36 ms returned sat
[2020-06-03 05:56:27] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 16 ms returned sat
[2020-06-03 05:56:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:27] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2020-06-03 05:56:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 05:56:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:56:28] [INFO ] Deduced a trap composed of 95 places in 174 ms
[2020-06-03 05:56:28] [INFO ] Deduced a trap composed of 101 places in 147 ms
[2020-06-03 05:56:28] [INFO ] Deduced a trap composed of 92 places in 175 ms
[2020-06-03 05:56:28] [INFO ] Deduced a trap composed of 95 places in 141 ms
[2020-06-03 05:56:28] [INFO ] Deduced a trap composed of 96 places in 150 ms
[2020-06-03 05:56:28] [INFO ] Deduced a trap composed of 89 places in 164 ms
[2020-06-03 05:56:29] [INFO ] Deduced a trap composed of 104 places in 139 ms
[2020-06-03 05:56:29] [INFO ] Deduced a trap composed of 93 places in 184 ms
[2020-06-03 05:56:29] [INFO ] Deduced a trap composed of 92 places in 161 ms
[2020-06-03 05:56:29] [INFO ] Deduced a trap composed of 89 places in 155 ms
[2020-06-03 05:56:29] [INFO ] Deduced a trap composed of 95 places in 205 ms
[2020-06-03 05:56:30] [INFO ] Deduced a trap composed of 95 places in 130 ms
[2020-06-03 05:56:30] [INFO ] Deduced a trap composed of 92 places in 193 ms
[2020-06-03 05:56:30] [INFO ] Deduced a trap composed of 92 places in 183 ms
[2020-06-03 05:56:30] [INFO ] Deduced a trap composed of 95 places in 143 ms
[2020-06-03 05:56:31] [INFO ] Deduced a trap composed of 95 places in 170 ms
[2020-06-03 05:56:31] [INFO ] Deduced a trap composed of 92 places in 189 ms
[2020-06-03 05:56:31] [INFO ] Deduced a trap composed of 95 places in 146 ms
[2020-06-03 05:56:31] [INFO ] Deduced a trap composed of 92 places in 142 ms
[2020-06-03 05:56:31] [INFO ] Deduced a trap composed of 92 places in 140 ms
[2020-06-03 05:56:32] [INFO ] Deduced a trap composed of 92 places in 134 ms
[2020-06-03 05:56:32] [INFO ] Deduced a trap composed of 92 places in 134 ms
[2020-06-03 05:56:33] [INFO ] Deduced a trap composed of 95 places in 172 ms
[2020-06-03 05:56:33] [INFO ] Deduced a trap composed of 92 places in 162 ms
[2020-06-03 05:56:34] [INFO ] Deduced a trap composed of 92 places in 128 ms
[2020-06-03 05:56:34] [INFO ] Deduced a trap composed of 83 places in 148 ms
[2020-06-03 05:56:36] [INFO ] Deduced a trap composed of 92 places in 157 ms
[2020-06-03 05:56:37] [INFO ] Deduced a trap composed of 86 places in 170 ms
[2020-06-03 05:56:37] [INFO ] Deduced a trap composed of 95 places in 164 ms
[2020-06-03 05:56:40] [INFO ] Deduced a trap composed of 99 places in 168 ms
[2020-06-03 05:56:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:57:12] [INFO ] Deduced a trap composed of 2 places in 221 ms
[2020-06-03 05:57:12] [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 (> (+ s291 s292) 0)") while checking expression at index 0
Support contains 131 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 410/410 transitions.
Applied a total of 0 rules in 15 ms. Remains 294 /294 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 294/294 places, 410/410 transitions.
Starting structural reductions, iteration 0 : 294/294 places, 410/410 transitions.
Applied a total of 0 rules in 14 ms. Remains 294 /294 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2020-06-03 05:57:12] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-06-03 05:57:12] [INFO ] Computed 57 place invariants in 9 ms
[2020-06-03 05:57:12] [INFO ] Implicit Places using invariants in 406 ms returned []
[2020-06-03 05:57:12] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-06-03 05:57:12] [INFO ] Computed 57 place invariants in 7 ms
[2020-06-03 05:57:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 05:57:14] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 1875 ms to find 0 implicit places.
[2020-06-03 05:57:14] [INFO ] Redundant transitions in 41 ms returned []
[2020-06-03 05:57:14] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-06-03 05:57:14] [INFO ] Computed 57 place invariants in 7 ms
[2020-06-03 05:57:15] [INFO ] Dead Transitions using invariants and state equation in 770 ms returned []
Finished structural reductions, in 1 iterations. Remains : 294/294 places, 410/410 transitions.
Incomplete random walk after 100000 steps, including 7343 resets, run finished after 262 ms. (steps per millisecond=381 ) properties seen :[0]
[2020-06-03 05:57:15] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-06-03 05:57:15] [INFO ] Computed 57 place invariants in 4 ms
[2020-06-03 05:57:15] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2020-06-03 05:57:15] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 13 ms returned sat
[2020-06-03 05:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:15] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2020-06-03 05:57:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:57:16] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2020-06-03 05:57:16] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 16 ms returned sat
[2020-06-03 05:57:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:16] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2020-06-03 05:57:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 05:57:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:57:16] [INFO ] Deduced a trap composed of 95 places in 160 ms
[2020-06-03 05:57:16] [INFO ] Deduced a trap composed of 101 places in 144 ms
[2020-06-03 05:57:17] [INFO ] Deduced a trap composed of 92 places in 143 ms
[2020-06-03 05:57:17] [INFO ] Deduced a trap composed of 95 places in 163 ms
[2020-06-03 05:57:17] [INFO ] Deduced a trap composed of 96 places in 148 ms
[2020-06-03 05:57:17] [INFO ] Deduced a trap composed of 89 places in 182 ms
[2020-06-03 05:57:17] [INFO ] Deduced a trap composed of 104 places in 164 ms
[2020-06-03 05:57:18] [INFO ] Deduced a trap composed of 93 places in 178 ms
[2020-06-03 05:57:18] [INFO ] Deduced a trap composed of 92 places in 162 ms
[2020-06-03 05:57:18] [INFO ] Deduced a trap composed of 89 places in 146 ms
[2020-06-03 05:57:18] [INFO ] Deduced a trap composed of 95 places in 162 ms
[2020-06-03 05:57:18] [INFO ] Deduced a trap composed of 95 places in 129 ms
[2020-06-03 05:57:19] [INFO ] Deduced a trap composed of 92 places in 173 ms
[2020-06-03 05:57:19] [INFO ] Deduced a trap composed of 92 places in 174 ms
[2020-06-03 05:57:19] [INFO ] Deduced a trap composed of 95 places in 156 ms
[2020-06-03 05:57:19] [INFO ] Deduced a trap composed of 95 places in 152 ms
[2020-06-03 05:57:20] [INFO ] Deduced a trap composed of 92 places in 200 ms
[2020-06-03 05:57:20] [INFO ] Deduced a trap composed of 95 places in 131 ms
[2020-06-03 05:57:20] [INFO ] Deduced a trap composed of 92 places in 138 ms
[2020-06-03 05:57:20] [INFO ] Deduced a trap composed of 92 places in 166 ms
[2020-06-03 05:57:20] [INFO ] Deduced a trap composed of 92 places in 159 ms
[2020-06-03 05:57:20] [INFO ] Deduced a trap composed of 92 places in 134 ms
[2020-06-03 05:57:22] [INFO ] Deduced a trap composed of 95 places in 177 ms
[2020-06-03 05:57:22] [INFO ] Deduced a trap composed of 92 places in 170 ms
[2020-06-03 05:57:22] [INFO ] Deduced a trap composed of 92 places in 162 ms
[2020-06-03 05:57:22] [INFO ] Deduced a trap composed of 83 places in 163 ms
[2020-06-03 05:57:25] [INFO ] Deduced a trap composed of 92 places in 170 ms
[2020-06-03 05:57:26] [INFO ] Deduced a trap composed of 86 places in 171 ms
[2020-06-03 05:57:26] [INFO ] Deduced a trap composed of 95 places in 166 ms
[2020-06-03 05:57:28] [INFO ] Deduced a trap composed of 99 places in 189 ms
[2020-06-03 05:57:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:57:34] [INFO ] Deduced a trap composed of 89 places in 172 ms
[2020-06-03 05:57:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:57:36] [INFO ] Deduced a trap composed of 2 places in 230 ms
[2020-06-03 05:57:36] [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 (> (+ s291 s292) 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 294 transition count 406
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 294 transition count 401
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 289 transition count 401
Applied a total of 14 rules in 46 ms. Remains 289 /294 variables (removed 5) and now considering 401/410 (removed 9) transitions.
// Phase 1: matrix 401 rows 289 cols
[2020-06-03 05:57:36] [INFO ] Computed 57 place invariants in 7 ms
[2020-06-03 05:57:36] [INFO ] [Real]Absence check using 50 positive place invariants in 36 ms returned sat
[2020-06-03 05:57:36] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 15 ms returned sat
[2020-06-03 05:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:36] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2020-06-03 05:57:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:57:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 29 ms returned sat
[2020-06-03 05:57:36] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 15 ms returned sat
[2020-06-03 05:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:37] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2020-06-03 05:57:37] [INFO ] Deduced a trap composed of 89 places in 166 ms
[2020-06-03 05:57:37] [INFO ] Deduced a trap composed of 92 places in 127 ms
[2020-06-03 05:57:37] [INFO ] Deduced a trap composed of 83 places in 127 ms
[2020-06-03 05:57:37] [INFO ] Deduced a trap composed of 89 places in 126 ms
[2020-06-03 05:57:38] [INFO ] Deduced a trap composed of 86 places in 167 ms
[2020-06-03 05:57:38] [INFO ] Deduced a trap composed of 95 places in 168 ms
[2020-06-03 05:57:38] [INFO ] Deduced a trap composed of 92 places in 168 ms
[2020-06-03 05:57:38] [INFO ] Deduced a trap composed of 89 places in 173 ms
[2020-06-03 05:57:38] [INFO ] Deduced a trap composed of 101 places in 140 ms
[2020-06-03 05:57:39] [INFO ] Deduced a trap composed of 89 places in 130 ms
[2020-06-03 05:57:39] [INFO ] Deduced a trap composed of 92 places in 172 ms
[2020-06-03 05:57:39] [INFO ] Deduced a trap composed of 89 places in 138 ms
[2020-06-03 05:57:39] [INFO ] Deduced a trap composed of 92 places in 161 ms
[2020-06-03 05:57:39] [INFO ] Deduced a trap composed of 92 places in 171 ms
[2020-06-03 05:57:40] [INFO ] Deduced a trap composed of 83 places in 141 ms
[2020-06-03 05:57:40] [INFO ] Deduced a trap composed of 86 places in 149 ms
[2020-06-03 05:57:40] [INFO ] Deduced a trap composed of 86 places in 146 ms
[2020-06-03 05:57:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:58:21] [INFO ] Deduced a trap composed of 2 places in 216 ms
[2020-06-03 05:58:21] [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 (> (+ s286 s287) 0)") while checking expression at index 0
[2020-06-03 05:58:21] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2020-06-03 05:58:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
[2020-06-03 05:58:22] [INFO ] Flatten gal took : 90 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ PolyORBNT-COL-S05J20 @ 3570 seconds
vrfy: finished
info: timeLeft: 3552
rslt: Output for ReachabilityCardinality @ PolyORBNT-COL-S05J20
{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 05:58:22 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 20916,
"runtime": 18.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 131,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 131,
"visible_transitions": 0
},
"processed": "A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p288) OR (p114 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249) OR ((2 <= p287) AND (p289 <= p112)))))",
"processed_size": 938,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 2117,
"conflict_clusters": 34,
"places": 294,
"places_significant": 237,
"singleton_clusters": 0,
"transitions": 410
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"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: 704/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 9408
lola: finding significant places
lola: 294 places, 410 transitions, 237 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: A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p288) OR (p114 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249) OR ((2 <= p287) AND (p289 <= p112)))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p288) OR (p114 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178... (shortened)
lola: processed formula length: 938
lola: 2 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: 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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
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: ((p288 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + 1 <= p114) AND ((p287 <= 1) OR (p112 + 1 <= p289)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: memory consumption: 20916 KB
lola: time consumption: 18 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="PolyORBNT-COL-S05J20"
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 PolyORBNT-COL-S05J20, 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-158987872000558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J20.tgz
mv PolyORBNT-COL-S05J20 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 ;