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-158987872200638.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-PT-S05J20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872200638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.5K Apr 12 05:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 12 05:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 05:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K 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 8.2K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 10 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 10 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 9 18:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 9 18:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 10 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Apr 10 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.6M 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-PT-S05J20-ReachabilityCardinality-00
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-01
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-02
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-03
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-04
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-05
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-06
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-07
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-08
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-09
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-10
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-11
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-12
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-13
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-14
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591171389100

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 08:03:10] [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 08:03:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 08:03:10] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2020-06-03 08:03:10] [INFO ] Transformed 349 places.
[2020-06-03 08:03:10] [INFO ] Transformed 1210 transitions.
[2020-06-03 08:03:10] [INFO ] Parsed PT model containing 349 places and 1210 transitions in 180 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 686 resets, run finished after 126 ms. (steps per millisecond=79 ) properties seen :[0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 251 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 10000 steps, including 186 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 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 172 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 190 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 157 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 10001 steps, including 205 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 148 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 08:03:11] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2020-06-03 08:03:11] [INFO ] Computed 62 place invariants in 37 ms
[2020-06-03 08:03:11] [INFO ] [Real]Absence check using 42 positive place invariants in 30 ms returned sat
[2020-06-03 08:03:11] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 14 ms returned unsat
[2020-06-03 08:03:11] [INFO ] [Real]Absence check using 42 positive place invariants in 20 ms returned sat
[2020-06-03 08:03:11] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 19 ms returned sat
[2020-06-03 08:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:03:12] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2020-06-03 08:03:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:03:12] [INFO ] [Nat]Absence check using 42 positive place invariants in 20 ms returned sat
[2020-06-03 08:03:12] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 18 ms returned sat
[2020-06-03 08:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:03:12] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2020-06-03 08:03:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 08:03:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 186 ms returned sat
[2020-06-03 08:03:13] [INFO ] Deduced a trap composed of 205 places in 214 ms
[2020-06-03 08:03:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 573 ms
[2020-06-03 08:03:13] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2020-06-03 08:03:13] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 30 ms returned sat
[2020-06-03 08:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:03:14] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2020-06-03 08:03:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:03:14] [INFO ] [Nat]Absence check using 42 positive place invariants in 33 ms returned sat
[2020-06-03 08:03:14] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 36 ms returned sat
[2020-06-03 08:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:03:17] [INFO ] [Nat]Absence check using state equation in 2654 ms returned sat
[2020-06-03 08:03:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 69 ms returned sat
[2020-06-03 08:03:17] [INFO ] Computed and/alt/rep : 549/8982/545 causal constraints in 80 ms.
[2020-06-03 08:03:18] [INFO ] Added : 33 causal constraints over 7 iterations in 1142 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 48 ms.
[2020-06-03 08:03:18] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned unsat
[2020-06-03 08:03:18] [INFO ] [Real]Absence check using 42 positive place invariants in 23 ms returned sat
[2020-06-03 08:03:18] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 26 ms returned sat
[2020-06-03 08:03:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:03:19] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2020-06-03 08:03:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:03:19] [INFO ] [Nat]Absence check using 42 positive place invariants in 31 ms returned sat
[2020-06-03 08:03:19] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 22 ms returned unsat
[2020-06-03 08:03:19] [INFO ] [Real]Absence check using 42 positive place invariants in 24 ms returned sat
[2020-06-03 08:03:19] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 23 ms returned sat
[2020-06-03 08:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:03:20] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2020-06-03 08:03:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:03:20] [INFO ] [Nat]Absence check using 42 positive place invariants in 23 ms returned sat
[2020-06-03 08:03:20] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 25 ms returned sat
[2020-06-03 08:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:03:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 08:03:25] [INFO ] [Nat]Absence check using state equation in 4909 ms returned unknown
[2020-06-03 08:03:25] [INFO ] [Real]Absence check using 42 positive place invariants in 30 ms returned sat
[2020-06-03 08:03:25] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 24 ms returned sat
[2020-06-03 08:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:03:26] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2020-06-03 08:03:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:03:26] [INFO ] [Nat]Absence check using 42 positive place invariants in 30 ms returned sat
[2020-06-03 08:03:26] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 23 ms returned sat
[2020-06-03 08:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:03:28] [INFO ] [Nat]Absence check using state equation in 1816 ms returned sat
[2020-06-03 08:03:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 91 ms returned sat
[2020-06-03 08:03:28] [INFO ] Computed and/alt/rep : 549/8982/545 causal constraints in 98 ms.
[2020-06-03 08:03:30] [INFO ] Added : 23 causal constraints over 5 iterations in 1915 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-06-03 08:03:30] [INFO ] [Real]Absence check using 42 positive place invariants in 28 ms returned sat
[2020-06-03 08:03:30] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 8 ms returned unsat
[2020-06-03 08:03:30] [INFO ] [Real]Absence check using 42 positive place invariants in 16 ms returned unsat
[2020-06-03 08:03:30] [INFO ] [Real]Absence check using 42 positive place invariants in 50 ms returned unsat
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 3000 steps, including 284 resets, run finished after 33 ms. (steps per millisecond=90 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 5100 steps, including 245 resets, run finished after 39 ms. (steps per millisecond=130 ) properties seen :[0, 0] could not realise parikh vector
Support contains 134 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 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 344 transition count 531
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 53 place count 320 transition count 531
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 53 place count 320 transition count 509
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 97 place count 298 transition count 509
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 298 transition count 509
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 100 place count 297 transition count 508
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 104 place count 295 transition count 506
Applied a total of 104 rules in 120 ms. Remains 295 /349 variables (removed 54) and now considering 506/555 (removed 49) transitions.
[2020-06-03 08:03:31] [INFO ] Flow matrix only has 502 transitions (discarded 4 similar events)
// Phase 1: matrix 502 rows 295 cols
[2020-06-03 08:03:31] [INFO ] Computed 57 place invariants in 15 ms
[2020-06-03 08:03:32] [INFO ] Dead Transitions using invariants and state equation in 1064 ms returned [273, 274, 275, 277, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 291, 292, 293, 294, 296, 297, 298, 299, 300, 303, 304, 305, 306, 307, 309, 310, 311, 312, 313, 314, 315, 316, 318, 319, 320, 321, 322, 323, 325, 326, 328, 329, 332, 333, 335, 336, 337, 338, 340, 341, 342, 343, 344, 346, 347, 348, 349, 350, 351, 352, 354, 355, 356, 357, 360, 361, 362, 363, 365, 366, 369, 370, 371, 372, 373, 374, 375, 377, 381, 384, 385, 386, 388, 390, 391, 392, 393, 394, 395, 396]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[396, 395, 394, 393, 392, 391, 390, 388, 386, 385, 384, 381, 377, 375, 374, 373, 372, 371, 370, 369, 366, 365, 363, 362, 361, 360, 357, 356, 355, 354, 352, 351, 350, 349, 348, 347, 346, 344, 343, 342, 341, 340, 338, 337, 336, 335, 333, 332, 329, 328, 326, 325, 323, 322, 321, 320, 319, 318, 316, 315, 314, 313, 312, 311, 310, 309, 307, 306, 305, 304, 303, 300, 299, 298, 297, 296, 294, 293, 292, 291, 289, 288, 287, 286, 285, 284, 283, 282, 281, 280, 279, 277, 275, 274, 273]
Starting structural reductions, iteration 1 : 295/349 places, 411/555 transitions.
Applied a total of 0 rules in 24 ms. Remains 295 /295 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 295/349 places, 411/555 transitions.
Incomplete random walk after 1000000 steps, including 74393 resets, run finished after 2582 ms. (steps per millisecond=387 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 31250 resets, run finished after 2135 ms. (steps per millisecond=468 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 18962 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 7035319 steps, run timeout after 30001 ms. (steps per millisecond=234 ) properties seen :[0, 0]
Probabilistic random walk after 7035319 steps, saw 1877963 distinct states, run finished after 30002 ms. (steps per millisecond=234 ) properties seen :[0, 0]
[2020-06-03 08:04:07] [INFO ] Flow matrix only has 407 transitions (discarded 4 similar events)
// Phase 1: matrix 407 rows 295 cols
[2020-06-03 08:04:07] [INFO ] Computed 57 place invariants in 30 ms
[2020-06-03 08:04:07] [INFO ] [Real]Absence check using 44 positive place invariants in 16 ms returned sat
[2020-06-03 08:04:07] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 11 ms returned sat
[2020-06-03 08:04:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:04:08] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2020-06-03 08:04:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:04:08] [INFO ] [Nat]Absence check using 44 positive place invariants in 31 ms returned sat
[2020-06-03 08:04:08] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 26 ms returned sat
[2020-06-03 08:04:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:04:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 08:04:17] [INFO ] [Nat]Absence check using state equation in 9258 ms returned unknown
[2020-06-03 08:04:17] [INFO ] [Real]Absence check using 44 positive place invariants in 30 ms returned sat
[2020-06-03 08:04:17] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 27 ms returned sat
[2020-06-03 08:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:04:18] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2020-06-03 08:04:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:04:18] [INFO ] [Nat]Absence check using 44 positive place invariants in 30 ms returned sat
[2020-06-03 08:04:18] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 17 ms returned sat
[2020-06-03 08:04:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:04:19] [INFO ] [Nat]Absence check using state equation in 1255 ms returned unsat
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 131 out of 295 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 295/295 places, 411/411 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 295 transition count 410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 294 transition count 410
Applied a total of 2 rules in 48 ms. Remains 294 /295 variables (removed 1) and now considering 410/411 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 294/295 places, 410/411 transitions.
Incomplete random walk after 1000000 steps, including 72482 resets, run finished after 2874 ms. (steps per millisecond=347 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 32258 resets, run finished after 2109 ms. (steps per millisecond=474 ) properties seen :[0]
Interrupted probabilistic random walk after 6944695 steps, run timeout after 30001 ms. (steps per millisecond=231 ) properties seen :[0]
Probabilistic random walk after 6944695 steps, saw 1853146 distinct states, run finished after 30002 ms. (steps per millisecond=231 ) properties seen :[0]
[2020-06-03 08:04:54] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-06-03 08:04:54] [INFO ] Computed 57 place invariants in 5 ms
[2020-06-03 08:04:54] [INFO ] [Real]Absence check using 44 positive place invariants in 33 ms returned sat
[2020-06-03 08:04:54] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 20 ms returned sat
[2020-06-03 08:04:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:04:55] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2020-06-03 08:04:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:04:55] [INFO ] [Nat]Absence check using 44 positive place invariants in 33 ms returned sat
[2020-06-03 08:04:55] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 21 ms returned sat
[2020-06-03 08:04:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:04:55] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2020-06-03 08:04:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 08:04:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 502 ms returned sat
[2020-06-03 08:04:56] [INFO ] Deduced a trap composed of 96 places in 219 ms
[2020-06-03 08:04:56] [INFO ] Deduced a trap composed of 93 places in 208 ms
[2020-06-03 08:04:57] [INFO ] Deduced a trap composed of 92 places in 146 ms
[2020-06-03 08:04:57] [INFO ] Deduced a trap composed of 91 places in 164 ms
[2020-06-03 08:04:57] [INFO ] Deduced a trap composed of 98 places in 136 ms
[2020-06-03 08:04:57] [INFO ] Deduced a trap composed of 98 places in 163 ms
[2020-06-03 08:04:57] [INFO ] Deduced a trap composed of 92 places in 161 ms
[2020-06-03 08:04:58] [INFO ] Deduced a trap composed of 95 places in 156 ms
[2020-06-03 08:04:58] [INFO ] Deduced a trap composed of 103 places in 146 ms
[2020-06-03 08:04:58] [INFO ] Deduced a trap composed of 98 places in 184 ms
[2020-06-03 08:04:58] [INFO ] Deduced a trap composed of 92 places in 144 ms
[2020-06-03 08:04:58] [INFO ] Deduced a trap composed of 89 places in 138 ms
[2020-06-03 08:04:59] [INFO ] Deduced a trap composed of 103 places in 180 ms
[2020-06-03 08:04:59] [INFO ] Deduced a trap composed of 93 places in 156 ms
[2020-06-03 08:04:59] [INFO ] Deduced a trap composed of 87 places in 125 ms
[2020-06-03 08:04:59] [INFO ] Deduced a trap composed of 95 places in 175 ms
[2020-06-03 08:05:00] [INFO ] Deduced a trap composed of 98 places in 171 ms
[2020-06-03 08:05:00] [INFO ] Deduced a trap composed of 93 places in 180 ms
[2020-06-03 08:05:00] [INFO ] Deduced a trap composed of 92 places in 172 ms
[2020-06-03 08:05:00] [INFO ] Deduced a trap composed of 98 places in 173 ms
[2020-06-03 08:05:00] [INFO ] Deduced a trap composed of 91 places in 170 ms
[2020-06-03 08:05:01] [INFO ] Deduced a trap composed of 100 places in 169 ms
[2020-06-03 08:05:01] [INFO ] Deduced a trap composed of 96 places in 150 ms
[2020-06-03 08:05:01] [INFO ] Deduced a trap composed of 89 places in 158 ms
[2020-06-03 08:05:01] [INFO ] Deduced a trap composed of 97 places in 136 ms
[2020-06-03 08:05:01] [INFO ] Deduced a trap composed of 98 places in 176 ms
[2020-06-03 08:05:02] [INFO ] Deduced a trap composed of 93 places in 180 ms
[2020-06-03 08:05:02] [INFO ] Deduced a trap composed of 87 places in 145 ms
[2020-06-03 08:05:02] [INFO ] Deduced a trap composed of 99 places in 159 ms
[2020-06-03 08:05:02] [INFO ] Deduced a trap composed of 104 places in 160 ms
[2020-06-03 08:05:02] [INFO ] Deduced a trap composed of 91 places in 141 ms
[2020-06-03 08:05:03] [INFO ] Deduced a trap composed of 96 places in 176 ms
[2020-06-03 08:05:03] [INFO ] Deduced a trap composed of 88 places in 167 ms
[2020-06-03 08:05:03] [INFO ] Deduced a trap composed of 98 places in 160 ms
[2020-06-03 08:05:04] [INFO ] Deduced a trap composed of 95 places in 171 ms
[2020-06-03 08:05:04] [INFO ] Deduced a trap composed of 102 places in 173 ms
[2020-06-03 08:05:04] [INFO ] Deduced a trap composed of 98 places in 166 ms
[2020-06-03 08:05:04] [INFO ] Deduced a trap composed of 95 places in 130 ms
[2020-06-03 08:05:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 08:05:40] [INFO ] Deduced a trap composed of 2 places in 267 ms
[2020-06-03 08:05:40] [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 (> (+ s12 s287) 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 29 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 12 ms. Remains 294 /294 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2020-06-03 08:05:40] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-06-03 08:05:40] [INFO ] Computed 57 place invariants in 8 ms
[2020-06-03 08:05:41] [INFO ] Implicit Places using invariants in 511 ms returned []
[2020-06-03 08:05:41] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-06-03 08:05:41] [INFO ] Computed 57 place invariants in 10 ms
[2020-06-03 08:05:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 08:05:43] [INFO ] Implicit Places using invariants and state equation in 2541 ms returned []
Implicit Place search using SMT with State Equation took 3054 ms to find 0 implicit places.
[2020-06-03 08:05:43] [INFO ] Redundant transitions in 46 ms returned []
[2020-06-03 08:05:43] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-06-03 08:05:43] [INFO ] Computed 57 place invariants in 6 ms
[2020-06-03 08:05:44] [INFO ] Dead Transitions using invariants and state equation in 862 ms returned []
Finished structural reductions, in 1 iterations. Remains : 294/294 places, 410/410 transitions.
Incomplete random walk after 100000 steps, including 7296 resets, run finished after 483 ms. (steps per millisecond=207 ) properties seen :[0]
[2020-06-03 08:05:45] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-06-03 08:05:45] [INFO ] Computed 57 place invariants in 15 ms
[2020-06-03 08:05:45] [INFO ] [Real]Absence check using 44 positive place invariants in 265 ms returned sat
[2020-06-03 08:05:45] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 49 ms returned sat
[2020-06-03 08:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:05:46] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2020-06-03 08:05:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:05:46] [INFO ] [Nat]Absence check using 44 positive place invariants in 29 ms returned sat
[2020-06-03 08:05:46] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 20 ms returned sat
[2020-06-03 08:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:05:47] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2020-06-03 08:05:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 08:05:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 463 ms returned sat
[2020-06-03 08:05:47] [INFO ] Deduced a trap composed of 96 places in 355 ms
[2020-06-03 08:05:48] [INFO ] Deduced a trap composed of 93 places in 916 ms
[2020-06-03 08:05:48] [INFO ] Deduced a trap composed of 92 places in 140 ms
[2020-06-03 08:05:49] [INFO ] Deduced a trap composed of 91 places in 128 ms
[2020-06-03 08:05:49] [INFO ] Deduced a trap composed of 98 places in 123 ms
[2020-06-03 08:05:49] [INFO ] Deduced a trap composed of 98 places in 157 ms
[2020-06-03 08:05:49] [INFO ] Deduced a trap composed of 92 places in 123 ms
[2020-06-03 08:05:49] [INFO ] Deduced a trap composed of 95 places in 126 ms
[2020-06-03 08:05:49] [INFO ] Deduced a trap composed of 103 places in 123 ms
[2020-06-03 08:05:50] [INFO ] Deduced a trap composed of 98 places in 141 ms
[2020-06-03 08:05:50] [INFO ] Deduced a trap composed of 92 places in 130 ms
[2020-06-03 08:05:50] [INFO ] Deduced a trap composed of 89 places in 102 ms
[2020-06-03 08:05:50] [INFO ] Deduced a trap composed of 103 places in 110 ms
[2020-06-03 08:05:50] [INFO ] Deduced a trap composed of 93 places in 115 ms
[2020-06-03 08:05:50] [INFO ] Deduced a trap composed of 87 places in 115 ms
[2020-06-03 08:05:51] [INFO ] Deduced a trap composed of 95 places in 164 ms
[2020-06-03 08:05:51] [INFO ] Deduced a trap composed of 98 places in 130 ms
[2020-06-03 08:05:51] [INFO ] Deduced a trap composed of 93 places in 111 ms
[2020-06-03 08:05:51] [INFO ] Deduced a trap composed of 92 places in 130 ms
[2020-06-03 08:05:51] [INFO ] Deduced a trap composed of 98 places in 158 ms
[2020-06-03 08:05:51] [INFO ] Deduced a trap composed of 91 places in 128 ms
[2020-06-03 08:05:52] [INFO ] Deduced a trap composed of 100 places in 125 ms
[2020-06-03 08:05:52] [INFO ] Deduced a trap composed of 96 places in 106 ms
[2020-06-03 08:05:52] [INFO ] Deduced a trap composed of 89 places in 153 ms
[2020-06-03 08:05:52] [INFO ] Deduced a trap composed of 97 places in 132 ms
[2020-06-03 08:05:52] [INFO ] Deduced a trap composed of 98 places in 135 ms
[2020-06-03 08:05:53] [INFO ] Deduced a trap composed of 93 places in 169 ms
[2020-06-03 08:05:53] [INFO ] Deduced a trap composed of 87 places in 137 ms
[2020-06-03 08:05:53] [INFO ] Deduced a trap composed of 99 places in 149 ms
[2020-06-03 08:05:53] [INFO ] Deduced a trap composed of 104 places in 182 ms
[2020-06-03 08:05:53] [INFO ] Deduced a trap composed of 91 places in 136 ms
[2020-06-03 08:05:53] [INFO ] Deduced a trap composed of 96 places in 166 ms
[2020-06-03 08:05:54] [INFO ] Deduced a trap composed of 88 places in 166 ms
[2020-06-03 08:05:54] [INFO ] Deduced a trap composed of 98 places in 156 ms
[2020-06-03 08:05:54] [INFO ] Deduced a trap composed of 95 places in 155 ms
[2020-06-03 08:05:55] [INFO ] Deduced a trap composed of 102 places in 172 ms
[2020-06-03 08:05:55] [INFO ] Deduced a trap composed of 98 places in 137 ms
[2020-06-03 08:05:55] [INFO ] Deduced a trap composed of 95 places in 137 ms
[2020-06-03 08:05:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 08:06:06] [INFO ] Deduced a trap composed of 2 places in 249 ms
[2020-06-03 08:06:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s12 s287) 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 38 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 08:06:06] [INFO ] Computed 57 place invariants in 6 ms
[2020-06-03 08:06:06] [INFO ] [Real]Absence check using 43 positive place invariants in 70 ms returned sat
[2020-06-03 08:06:06] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 11 ms returned sat
[2020-06-03 08:06:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:06:07] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2020-06-03 08:06:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:06:07] [INFO ] [Nat]Absence check using 43 positive place invariants in 28 ms returned sat
[2020-06-03 08:06:07] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 18 ms returned sat
[2020-06-03 08:06:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:06:08] [INFO ] [Nat]Absence check using state equation in 744 ms returned sat
[2020-06-03 08:06:08] [INFO ] Deduced a trap composed of 86 places in 146 ms
[2020-06-03 08:06:08] [INFO ] Deduced a trap composed of 93 places in 147 ms
[2020-06-03 08:06:08] [INFO ] Deduced a trap composed of 92 places in 132 ms
[2020-06-03 08:06:08] [INFO ] Deduced a trap composed of 95 places in 134 ms
[2020-06-03 08:06:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 08:06:52] [INFO ] Deduced a trap composed of 7 places in 234 ms
[2020-06-03 08:06:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s44 s69 s105 s159 s251 s276) 0)") while checking expression at index 0
[2020-06-03 08:06:52] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2020-06-03 08:06:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 16 ms.
[2020-06-03 08:06:52] [INFO ] Flatten gal took : 100 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ PolyORBNT-PT-S05J20 @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityCardinality @ PolyORBNT-PT-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 08:06:53 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 19672,
"runtime": 2.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": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 128,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 128,
"visible_transitions": 0
},
"processed": "A (G (((p101 + p111 + p115 + p122 + p134 + p153 + p155 + p220 + p225 + p248 + p249 + p285 + p288 + p293 + p15 + p17 + p21 + p45 + p34 + p69 + p73 <= p120) OR (p193 <= p2 + p4 + p5 + p6 + p8 + p102 + p104 + p105 + p108 + p109 + p112 + p118 + p121 + p123 + p125 + p130 + p131 + p139 + p140 + p141 + p143 + p145 + p146 + p148 + p152 + p156 + p164 + p165 + p167 + p170 + p174 + p175 + p178 + p179 + p187 + p189 + p198 + p201 + p202 + p204 + p206 + p210 + p213 + p216 + p217 + p218 + p222 + p223 + p224 + p228 + p229 + p231 + p235 + p239 + p241 + p242 + p243 + p246 + p247 + p257 + p258 + p262 + p263 + p62 + p267 + p268 + p272 + p273 + p278 + p56 + p284 + p292 + p10 + p11 + p18 + p47 + p23 + p24 + p32 + p33 + p44 + p43 + p27 + p289 + p50 + p52 + p53 + p283 + p58 + p60 + p274 + p266 + p63 + p64 + p265 + p67 + p211 + p78 + p79 + p88 + p90 + p92 + p94 + p95 + p97))))",
"processed_size": 865,
"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": 2,
"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: LP says that atomic proposition is always false: (2 <= p184)
lola: A (G (((p101 + p111 + p115 + p122 + p134 + p153 + p155 + p220 + p225 + p248 + p249 + p285 + p288 + p293 + p15 + p17 + p21 + p45 + p34 + p69 + p73 <= p120) OR (p193 <= p2 + p4 + p5 + p6 + p8 + p102 + p104 + p105 + p108 + p109 + p112 + p118 + p121 + p123 + p125 + p130 + p131 + p139 + p140 + p141 + p143 + p145 + p146 + p148 + p152 + p156 + p164 + p165 + p167 + p170 + p174 + p175 + p178 + p179 + p187 + p189 + p198 + p201 + p202 + p204 + p206 + p210 + p213 + p216 + p217 + p218 + p222 + p223 + p224 + p228 + p229 + p231 + p235 + p239 + p241 + p242 + p243 + p246 + p247 + p257 + p258 + p262 + p263 + p62 + p267 + p268 + p272 + p273 + p278 + p56 + p284 + p292 + p10 + p11 + p18 + p47 + p23 + p24 + p32 + p33 + p44 + p43 + p27 + p289 + p50 + p52 + p53 + p283 + p58 + p60 + p274 + p266 + p63 + p64 + p265 + p67 + p211 + p78 + p79 + p88 + p90 + p92 + p94 + p95 + p97))))
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 (((p101 + p111 + p115 + p122 + p134 + p153 + p155 + p220 + p225 + p248 + p249 + p285 + p288 + p293 + p15 + p17 + p21 + p45 + p34 + p69 + p73 <= p120) OR (p193 <= p2 + p4 + p5 + p6 + p8 + p102 + p104 + p105 + p108 + p109 + p112 + p118 + p121 + p123 + p125 + p130 + p131 + p139 + p140 + p141 + p143 + p145 + p146 + p148 + p152 + p156 + p164 + p165 + p167 + p170 + p174 + p175 + p178 + p179 + p187... (shortened)
lola: processed formula length: 865
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: ((p120 + 1 <= p101 + p111 + p115 + p122 + p134 + p153 + p155 + p220 + p225 + p248 + p249 + p285 + p288 + p293 + p15 + p17 + p21 + p45 + p34 + p69 + p73) AND (p2 + p4 + p5 + p6 + p8 + p102 + p104 + p105 + p108 + p109 + p112 + p118 + p121 + p123 + p125 + p130 + p131 + p139 + p140 + p141 + p143 + p145 + p146 + p148 + p152 + p156 + p164 + p165 + p167 + p170 + p174 + p175 + p178 + p179 + p187 + p189 + p198 + p201 + p202 + p204 + p206 + p210 + p213 + p216 + p217 + p218 + p222 + p223 + p224 + p228 + p229 + p231 + p235 + p239 + p241 + p242 + p243 + p246 + p247 + p257 + p258 + p262 + p263 + p62 + p267 + p268 + p272 + p273 + p278 + p56 + p284 + p292 + p10 + p11 + p18 + p47 + p23 + p24 + p32 + p33 + p44 + p43 + p27 + p289 + p50 + p52 + p53 + p283 + p58 + p60 + p274 + p266 + p63 + p64 + p265 + p67 + p211 + p78 + p79 + p88 + p90 + p92 + p94 + p95 + p97 + 1 <= p193))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: memory consumption: 19672 KB
lola: time consumption: 2 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
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-PT-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-PT-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-158987872200638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J20.tgz
mv PolyORBNT-PT-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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;