Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961258100734.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258100734
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 63K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 54K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 49K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 169K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 911K Apr 27 15:14 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 Peterson-PT-5-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590026288632

[2020-05-21 01:58:11] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-21 01:58:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:58:11] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2020-05-21 01:58:11] [INFO ] Transformed 834 places.
[2020-05-21 01:58:11] [INFO ] Transformed 1242 transitions.
[2020-05-21 01:58:11] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 336 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 117 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-5-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 172 ms. (steps per millisecond=58 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA Peterson-PT-5-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA Peterson-PT-5-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 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 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 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 0 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 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-05-21 01:58:12] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2020-05-21 01:58:12] [INFO ] Computed 23 place invariants in 70 ms
[2020-05-21 01:58:12] [INFO ] [Real]Absence check using 17 positive place invariants in 46 ms returned unsat
[2020-05-21 01:58:13] [INFO ] [Real]Absence check using 17 positive place invariants in 48 ms returned unsat
[2020-05-21 01:58:13] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned unsat
[2020-05-21 01:58:13] [INFO ] [Real]Absence check using 17 positive place invariants in 66 ms returned unsat
[2020-05-21 01:58:13] [INFO ] [Real]Absence check using 17 positive place invariants in 30 ms returned sat
[2020-05-21 01:58:13] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-05-21 01:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:15] [INFO ] [Real]Absence check using state equation in 2086 ms returned sat
[2020-05-21 01:58:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:58:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 47 ms returned sat
[2020-05-21 01:58:16] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2020-05-21 01:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:18] [INFO ] [Nat]Absence check using state equation in 2196 ms returned sat
[2020-05-21 01:58:18] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 01:58:18] [INFO ] [Nat]Added 230 Read/Feed constraints in 143 ms returned sat
[2020-05-21 01:58:20] [INFO ] Deduced a trap composed of 67 places in 1450 ms
[2020-05-21 01:58:20] [INFO ] Deduced a trap composed of 132 places in 725 ms
[2020-05-21 01:58:21] [INFO ] Deduced a trap composed of 67 places in 691 ms
[2020-05-21 01: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 (> (+ s1 s7 s13 s29 s39 s63 s65 s88 s95 s120 s136 s143 s168 s175 s177 s205 s215 s233 s241 s247 s254 s264 s272 s286 s292 s320 s341 s356 s373 s381 s391 s396 s414 s438 s463 s468 s480 s483 s504 s505 s519 s530 s539 s563 s570 s583 s585 s595 s615 s622 s627 s642 s648 s670 s680 s712 s714 s722 s734 s744 s787 s791 s793 s801 s812 s815 s821) 0)") while checking expression at index 4
[2020-05-21 01:58:21] [INFO ] [Real]Absence check using 17 positive place invariants in 36 ms returned sat
[2020-05-21 01:58:21] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:23] [INFO ] [Real]Absence check using state equation in 1803 ms returned sat
[2020-05-21 01:58:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:58:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 28 ms returned sat
[2020-05-21 01:58:23] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-21 01:58:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:25] [INFO ] [Nat]Absence check using state equation in 1894 ms returned sat
[2020-05-21 01:58:25] [INFO ] [Nat]Added 230 Read/Feed constraints in 68 ms returned sat
[2020-05-21 01:58:26] [INFO ] Deduced a trap composed of 51 places in 810 ms
[2020-05-21 01:58:27] [INFO ] Deduced a trap composed of 11 places in 521 ms
[2020-05-21 01:58:28] [INFO ] Deduced a trap composed of 37 places in 1456 ms
[2020-05-21 01:58:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 01:58:29] [INFO ] Deduced a trap composed of 2 places in 895 ms
[2020-05-21 01:58:29] [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 (> (+ s399 s401) 0)") while checking expression at index 5
[2020-05-21 01:58:29] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2020-05-21 01:58:29] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-21 01:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:31] [INFO ] [Real]Absence check using state equation in 1960 ms returned sat
[2020-05-21 01:58:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:58:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 35 ms returned sat
[2020-05-21 01:58:31] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2020-05-21 01:58:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:33] [INFO ] [Nat]Absence check using state equation in 1714 ms returned sat
[2020-05-21 01:58:33] [INFO ] [Nat]Added 230 Read/Feed constraints in 62 ms returned sat
[2020-05-21 01:58:34] [INFO ] Deduced a trap composed of 11 places in 850 ms
[2020-05-21 01:58:35] [INFO ] Deduced a trap composed of 11 places in 467 ms
[2020-05-21 01:58:35] [INFO ] Deduced a trap composed of 30 places in 454 ms
[2020-05-21 01:58:36] [INFO ] Deduced a trap composed of 11 places in 504 ms
[2020-05-21 01:58:36] [INFO ] Deduced a trap composed of 11 places in 506 ms
[2020-05-21 01:58:37] [INFO ] Deduced a trap composed of 11 places in 528 ms
[2020-05-21 01:58:37] [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 (> (+ s210 s383 s401 s518 s618 s724 s786 s798 s814 s817 s823) 0)") while checking expression at index 6
[2020-05-21 01:58:37] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned unsat
[2020-05-21 01:58:37] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2020-05-21 01:58:37] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2020-05-21 01:58:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:39] [INFO ] [Real]Absence check using state equation in 1688 ms returned sat
[2020-05-21 01:58:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:58:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 44 ms returned sat
[2020-05-21 01:58:39] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2020-05-21 01:58:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:41] [INFO ] [Nat]Absence check using state equation in 1822 ms returned sat
[2020-05-21 01:58:41] [INFO ] [Nat]Added 230 Read/Feed constraints in 73 ms returned sat
[2020-05-21 01:58:41] [INFO ] Deduced a trap composed of 39 places in 482 ms
[2020-05-21 01:58:42] [INFO ] Deduced a trap composed of 11 places in 432 ms
[2020-05-21 01:58:42] [INFO ] Deduced a trap composed of 11 places in 389 ms
[2020-05-21 01:58:43] [INFO ] Deduced a trap composed of 15 places in 541 ms
[2020-05-21 01:58:43] [INFO ] Deduced a trap composed of 14 places in 429 ms
[2020-05-21 01:58:44] [INFO ] Deduced a trap composed of 11 places in 490 ms
[2020-05-21 01:58:44] [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 (> (+ s210 s383 s401 s518 s618 s724 s786 s798 s814 s817 s823) 0)") while checking expression at index 8
[2020-05-21 01:58:44] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned unsat
FORMULA Peterson-PT-5-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-5-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-5-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-5-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-5-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-5-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 13 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Iterating post reduction 0 with 345 rules applied. Total rules applied 345 place count 834 transition count 897
Reduce places removed 345 places and 0 transitions.
Iterating post reduction 1 with 345 rules applied. Total rules applied 690 place count 489 transition count 897
Performed 176 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 176 Pre rules applied. Total rules applied 690 place count 489 transition count 721
Deduced a syphon composed of 176 places in 2 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 352 rules applied. Total rules applied 1042 place count 313 transition count 721
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 7 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1102 place count 283 transition count 691
Applied a total of 1102 rules in 192 ms. Remains 283 /834 variables (removed 551) and now considering 691/1242 (removed 551) transitions.
Finished structural reductions, in 1 iterations. Remains : 283/834 places, 691/1242 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2188 ms. (steps per millisecond=457 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 599 ms. (steps per millisecond=1669 ) properties seen :[0, 1, 0, 0]
FORMULA Peterson-PT-5-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 471 ms. (steps per millisecond=2123 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 657 ms. (steps per millisecond=1522 ) properties seen :[0, 0, 0]
[2020-05-21 01:58:48] [INFO ] Flow matrix only has 571 transitions (discarded 120 similar events)
// Phase 1: matrix 571 rows 283 cols
[2020-05-21 01:58:48] [INFO ] Computed 23 place invariants in 5 ms
[2020-05-21 01:58:48] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2020-05-21 01:58:48] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-21 01:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:49] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2020-05-21 01:58:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:58:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 21 ms returned sat
[2020-05-21 01:58:49] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-21 01:58:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:49] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2020-05-21 01:58:49] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 01:58:49] [INFO ] [Nat]Added 230 Read/Feed constraints in 39 ms returned sat
[2020-05-21 01:58:49] [INFO ] Deduced a trap composed of 11 places in 185 ms
[2020-05-21 01:58:49] [INFO ] Deduced a trap composed of 31 places in 133 ms
[2020-05-21 01:58:50] [INFO ] Deduced a trap composed of 15 places in 162 ms
[2020-05-21 01:58:50] [INFO ] Deduced a trap composed of 13 places in 159 ms
[2020-05-21 01:58:50] [INFO ] Deduced a trap composed of 11 places in 157 ms
[2020-05-21 01:58:50] [INFO ] Deduced a trap composed of 15 places in 151 ms
[2020-05-21 01:58:50] [INFO ] Deduced a trap composed of 28 places in 149 ms
[2020-05-21 01:58:50] [INFO ] Deduced a trap composed of 40 places in 119 ms
[2020-05-21 01:58:51] [INFO ] Deduced a trap composed of 58 places in 135 ms
[2020-05-21 01:58:51] [INFO ] Deduced a trap composed of 40 places in 115 ms
[2020-05-21 01:58:51] [INFO ] Deduced a trap composed of 30 places in 118 ms
[2020-05-21 01:58:51] [INFO ] Deduced a trap composed of 37 places in 320 ms
[2020-05-21 01:58:52] [INFO ] Deduced a trap composed of 39 places in 255 ms
[2020-05-21 01:58:53] [INFO ] Deduced a trap composed of 38 places in 1299 ms
[2020-05-21 01:58:53] [INFO ] Deduced a trap composed of 38 places in 260 ms
[2020-05-21 01:58:53] [INFO ] Deduced a trap composed of 25 places in 141 ms
[2020-05-21 01:58:54] [INFO ] Deduced a trap composed of 24 places in 274 ms
[2020-05-21 01:58:54] [INFO ] Deduced a trap composed of 31 places in 258 ms
[2020-05-21 01:58:54] [INFO ] Deduced a trap composed of 65 places in 448 ms
[2020-05-21 01:58:55] [INFO ] Deduced a trap composed of 19 places in 795 ms
[2020-05-21 01:58:56] [INFO ] Deduced a trap composed of 17 places in 939 ms
[2020-05-21 01:58:57] [INFO ] Deduced a trap composed of 26 places in 396 ms
[2020-05-21 01:58:57] [INFO ] Deduced a trap composed of 26 places in 155 ms
[2020-05-21 01:58:57] [INFO ] Deduced a trap composed of 34 places in 102 ms
[2020-05-21 01:58:57] [INFO ] Deduced a trap composed of 34 places in 107 ms
[2020-05-21 01:58:57] [INFO ] Deduced a trap composed of 29 places in 143 ms
[2020-05-21 01:58:57] [INFO ] Deduced a trap composed of 19 places in 142 ms
[2020-05-21 01:58:58] [INFO ] Deduced a trap composed of 60 places in 138 ms
[2020-05-21 01:58:58] [INFO ] Deduced a trap composed of 34 places in 123 ms
[2020-05-21 01:58:58] [INFO ] Deduced a trap composed of 9 places in 134 ms
[2020-05-21 01:58:58] [INFO ] Deduced a trap composed of 17 places in 156 ms
[2020-05-21 01:58:58] [INFO ] Deduced a trap composed of 19 places in 154 ms
[2020-05-21 01:58:58] [INFO ] Deduced a trap composed of 12 places in 153 ms
[2020-05-21 01:58:59] [INFO ] Deduced a trap composed of 41 places in 142 ms
[2020-05-21 01:58:59] [INFO ] Deduced a trap composed of 30 places in 111 ms
[2020-05-21 01:58:59] [INFO ] Deduced a trap composed of 37 places in 111 ms
[2020-05-21 01:58:59] [INFO ] Deduced a trap composed of 44 places in 126 ms
[2020-05-21 01:58:59] [INFO ] Deduced a trap composed of 45 places in 115 ms
[2020-05-21 01:58:59] [INFO ] Deduced a trap composed of 52 places in 59 ms
[2020-05-21 01:58:59] [INFO ] Deduced a trap composed of 18 places in 111 ms
[2020-05-21 01:59:00] [INFO ] Deduced a trap composed of 32 places in 96 ms
[2020-05-21 01:59:00] [INFO ] Deduced a trap composed of 25 places in 98 ms
[2020-05-21 01:59:00] [INFO ] Deduced a trap composed of 25 places in 109 ms
[2020-05-21 01:59:00] [INFO ] Deduced a trap composed of 37 places in 131 ms
[2020-05-21 01:59:00] [INFO ] Deduced a trap composed of 21 places in 128 ms
[2020-05-21 01:59:00] [INFO ] Deduced a trap composed of 19 places in 105 ms
[2020-05-21 01:59:00] [INFO ] Deduced a trap composed of 42 places in 92 ms
[2020-05-21 01:59:01] [INFO ] Deduced a trap composed of 31 places in 128 ms
[2020-05-21 01:59:01] [INFO ] Deduced a trap composed of 21 places in 147 ms
[2020-05-21 01:59:01] [INFO ] Deduced a trap composed of 18 places in 149 ms
[2020-05-21 01:59:01] [INFO ] Deduced a trap composed of 9 places in 105 ms
[2020-05-21 01:59:01] [INFO ] Deduced a trap composed of 9 places in 108 ms
[2020-05-21 01:59:01] [INFO ] Deduced a trap composed of 16 places in 142 ms
[2020-05-21 01:59:01] [INFO ] Deduced a trap composed of 14 places in 113 ms
[2020-05-21 01:59:02] [INFO ] Deduced a trap composed of 47 places in 126 ms
[2020-05-21 01:59:02] [INFO ] Deduced a trap composed of 29 places in 158 ms
[2020-05-21 01:59:02] [INFO ] Deduced a trap composed of 9 places in 167 ms
[2020-05-21 01:59:02] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 13071 ms
[2020-05-21 01:59:02] [INFO ] Computed and/alt/rep : 685/4291/565 causal constraints in 65 ms.
[2020-05-21 01:59:08] [INFO ] Added : 458 causal constraints over 92 iterations in 5846 ms. Result :sat
[2020-05-21 01:59:08] [INFO ] Deduced a trap composed of 13 places in 131 ms
[2020-05-21 01:59:08] [INFO ] Deduced a trap composed of 20 places in 133 ms
[2020-05-21 01:59:09] [INFO ] Deduced a trap composed of 34 places in 107 ms
[2020-05-21 01:59:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 645 ms
Attempting to minimize the solution found.
Minimization took 72 ms.
[2020-05-21 01:59:09] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2020-05-21 01:59:09] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-21 01:59:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:59:09] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2020-05-21 01:59:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:59:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 45 ms returned sat
[2020-05-21 01:59:09] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-21 01:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:59:10] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2020-05-21 01:59:10] [INFO ] [Nat]Added 230 Read/Feed constraints in 49 ms returned sat
[2020-05-21 01:59:10] [INFO ] Deduced a trap composed of 22 places in 253 ms
[2020-05-21 01:59:10] [INFO ] Deduced a trap composed of 47 places in 150 ms
[2020-05-21 01:59:11] [INFO ] Deduced a trap composed of 17 places in 192 ms
[2020-05-21 01:59:12] [INFO ] Deduced a trap composed of 11 places in 952 ms
[2020-05-21 01:59:12] [INFO ] Deduced a trap composed of 31 places in 190 ms
[2020-05-21 01:59:12] [INFO ] Deduced a trap composed of 21 places in 187 ms
[2020-05-21 01:59:12] [INFO ] Deduced a trap composed of 9 places in 181 ms
[2020-05-21 01:59:12] [INFO ] Deduced a trap composed of 28 places in 177 ms
[2020-05-21 01:59:13] [INFO ] Deduced a trap composed of 9 places in 162 ms
[2020-05-21 01:59:13] [INFO ] Deduced a trap composed of 23 places in 153 ms
[2020-05-21 01:59:13] [INFO ] Deduced a trap composed of 36 places in 153 ms
[2020-05-21 01:59:13] [INFO ] Deduced a trap composed of 25 places in 216 ms
[2020-05-21 01:59:13] [INFO ] Deduced a trap composed of 54 places in 144 ms
[2020-05-21 01:59:14] [INFO ] Deduced a trap composed of 37 places in 152 ms
[2020-05-21 01:59:14] [INFO ] Deduced a trap composed of 19 places in 150 ms
[2020-05-21 01:59:14] [INFO ] Deduced a trap composed of 27 places in 143 ms
[2020-05-21 01:59:14] [INFO ] Deduced a trap composed of 18 places in 137 ms
[2020-05-21 01:59:14] [INFO ] Deduced a trap composed of 25 places in 141 ms
[2020-05-21 01:59:14] [INFO ] Deduced a trap composed of 9 places in 147 ms
[2020-05-21 01:59:15] [INFO ] Deduced a trap composed of 44 places in 167 ms
[2020-05-21 01:59:15] [INFO ] Deduced a trap composed of 36 places in 115 ms
[2020-05-21 01:59:15] [INFO ] Deduced a trap composed of 25 places in 112 ms
[2020-05-21 01:59:15] [INFO ] Deduced a trap composed of 37 places in 111 ms
[2020-05-21 01:59:15] [INFO ] Deduced a trap composed of 25 places in 111 ms
[2020-05-21 01:59:15] [INFO ] Deduced a trap composed of 18 places in 121 ms
[2020-05-21 01:59:15] [INFO ] Deduced a trap composed of 13 places in 144 ms
[2020-05-21 01:59:16] [INFO ] Deduced a trap composed of 9 places in 156 ms
[2020-05-21 01:59:16] [INFO ] Deduced a trap composed of 51 places in 154 ms
[2020-05-21 01:59:16] [INFO ] Deduced a trap composed of 37 places in 101 ms
[2020-05-21 01:59:16] [INFO ] Deduced a trap composed of 51 places in 97 ms
[2020-05-21 01:59:16] [INFO ] Deduced a trap composed of 45 places in 105 ms
[2020-05-21 01:59:16] [INFO ] Deduced a trap composed of 29 places in 113 ms
[2020-05-21 01:59:16] [INFO ] Deduced a trap composed of 45 places in 109 ms
[2020-05-21 01:59:17] [INFO ] Deduced a trap composed of 37 places in 123 ms
[2020-05-21 01:59:17] [INFO ] Deduced a trap composed of 29 places in 112 ms
[2020-05-21 01:59:17] [INFO ] Deduced a trap composed of 44 places in 102 ms
[2020-05-21 01:59:17] [INFO ] Deduced a trap composed of 45 places in 128 ms
[2020-05-21 01:59:17] [INFO ] Deduced a trap composed of 45 places in 129 ms
[2020-05-21 01:59:17] [INFO ] Deduced a trap composed of 36 places in 86 ms
[2020-05-21 01:59:17] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 7361 ms
[2020-05-21 01:59:17] [INFO ] Computed and/alt/rep : 685/4291/565 causal constraints in 31 ms.
[2020-05-21 01:59:21] [INFO ] Added : 398 causal constraints over 80 iterations in 4063 ms. Result :sat
[2020-05-21 01:59:22] [INFO ] Deduced a trap composed of 37 places in 155 ms
[2020-05-21 01:59:22] [INFO ] Deduced a trap composed of 20 places in 152 ms
[2020-05-21 01:59:22] [INFO ] Deduced a trap composed of 60 places in 169 ms
[2020-05-21 01:59:22] [INFO ] Deduced a trap composed of 20 places in 199 ms
[2020-05-21 01:59:22] [INFO ] Deduced a trap composed of 34 places in 153 ms
[2020-05-21 01:59:23] [INFO ] Deduced a trap composed of 18 places in 159 ms
[2020-05-21 01:59:23] [INFO ] Deduced a trap composed of 34 places in 86 ms
[2020-05-21 01:59:23] [INFO ] Deduced a trap composed of 35 places in 112 ms
[2020-05-21 01:59:23] [INFO ] Deduced a trap composed of 34 places in 123 ms
[2020-05-21 01:59:23] [INFO ] Deduced a trap composed of 34 places in 100 ms
[2020-05-21 01:59:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2089 ms
Attempting to minimize the solution found.
Minimization took 53 ms.
[2020-05-21 01:59:24] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned sat
[2020-05-21 01:59:24] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-21 01:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:59:24] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2020-05-21 01:59:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:59:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2020-05-21 01:59:24] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-21 01:59:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:59:24] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2020-05-21 01:59:24] [INFO ] [Nat]Added 230 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:59:24] [INFO ] Deduced a trap composed of 21 places in 166 ms
[2020-05-21 01:59:25] [INFO ] Deduced a trap composed of 71 places in 131 ms
[2020-05-21 01:59:25] [INFO ] Deduced a trap composed of 11 places in 132 ms
[2020-05-21 01:59:25] [INFO ] Deduced a trap composed of 69 places in 126 ms
[2020-05-21 01:59:25] [INFO ] Deduced a trap composed of 42 places in 179 ms
[2020-05-21 01:59:25] [INFO ] Deduced a trap composed of 20 places in 111 ms
[2020-05-21 01:59:25] [INFO ] Deduced a trap composed of 55 places in 113 ms
[2020-05-21 01:59:25] [INFO ] Deduced a trap composed of 35 places in 115 ms
[2020-05-21 01:59:26] [INFO ] Deduced a trap composed of 23 places in 137 ms
[2020-05-21 01:59:26] [INFO ] Deduced a trap composed of 55 places in 133 ms
[2020-05-21 01:59:26] [INFO ] Deduced a trap composed of 20 places in 134 ms
[2020-05-21 01:59:26] [INFO ] Deduced a trap composed of 41 places in 139 ms
[2020-05-21 01:59:26] [INFO ] Deduced a trap composed of 42 places in 109 ms
[2020-05-21 01:59:26] [INFO ] Deduced a trap composed of 65 places in 106 ms
[2020-05-21 01:59:26] [INFO ] Deduced a trap composed of 27 places in 107 ms
[2020-05-21 01:59:27] [INFO ] Deduced a trap composed of 28 places in 155 ms
[2020-05-21 01:59:27] [INFO ] Deduced a trap composed of 28 places in 171 ms
[2020-05-21 01:59:27] [INFO ] Deduced a trap composed of 20 places in 164 ms
[2020-05-21 01:59:27] [INFO ] Deduced a trap composed of 36 places in 93 ms
[2020-05-21 01:59:27] [INFO ] Deduced a trap composed of 39 places in 88 ms
[2020-05-21 01:59:27] [INFO ] Deduced a trap composed of 35 places in 115 ms
[2020-05-21 01:59:28] [INFO ] Deduced a trap composed of 18 places in 142 ms
[2020-05-21 01:59:28] [INFO ] Deduced a trap composed of 18 places in 102 ms
[2020-05-21 01:59:28] [INFO ] Deduced a trap composed of 19 places in 100 ms
[2020-05-21 01:59:28] [INFO ] Deduced a trap composed of 35 places in 75 ms
[2020-05-21 01:59:28] [INFO ] Deduced a trap composed of 52 places in 93 ms
[2020-05-21 01:59:28] [INFO ] Deduced a trap composed of 34 places in 94 ms
[2020-05-21 01:59:28] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3926 ms
[2020-05-21 01:59:28] [INFO ] Computed and/alt/rep : 685/4291/565 causal constraints in 69 ms.
[2020-05-21 01:59:33] [INFO ] Added : 447 causal constraints over 90 iterations in 5125 ms. Result :sat
[2020-05-21 01:59:33] [INFO ] Deduced a trap composed of 18 places in 145 ms
[2020-05-21 01:59:34] [INFO ] Deduced a trap composed of 15 places in 135 ms
[2020-05-21 01:59:34] [INFO ] Deduced a trap composed of 9 places in 165 ms
[2020-05-21 01:59:34] [INFO ] Deduced a trap composed of 13 places in 141 ms
[2020-05-21 01:59:34] [INFO ] Deduced a trap composed of 15 places in 141 ms
[2020-05-21 01:59:35] [INFO ] Deduced a trap composed of 25 places in 129 ms
[2020-05-21 01:59:35] [INFO ] Deduced a trap composed of 25 places in 132 ms
[2020-05-21 01:59:35] [INFO ] Deduced a trap composed of 34 places in 148 ms
[2020-05-21 01:59:35] [INFO ] Deduced a trap composed of 39 places in 140 ms
[2020-05-21 01:59:35] [INFO ] Deduced a trap composed of 37 places in 150 ms
[2020-05-21 01:59:36] [INFO ] Deduced a trap composed of 25 places in 127 ms
[2020-05-21 01:59:36] [INFO ] Deduced a trap composed of 11 places in 191 ms
[2020-05-21 01:59:36] [INFO ] Deduced a trap composed of 20 places in 156 ms
[2020-05-21 01:59:36] [INFO ] Deduced a trap composed of 25 places in 141 ms
[2020-05-21 01:59:37] [INFO ] Deduced a trap composed of 20 places in 122 ms
[2020-05-21 01:59:37] [INFO ] Deduced a trap composed of 10 places in 121 ms
[2020-05-21 01:59:37] [INFO ] Deduced a trap composed of 11 places in 129 ms
[2020-05-21 01:59:37] [INFO ] Deduced a trap composed of 34 places in 96 ms
[2020-05-21 01:59:37] [INFO ] Deduced a trap composed of 10 places in 134 ms
[2020-05-21 01:59:38] [INFO ] Deduced a trap composed of 26 places in 139 ms
[2020-05-21 01:59:38] [INFO ] Deduced a trap composed of 25 places in 121 ms
[2020-05-21 01:59:38] [INFO ] Deduced a trap composed of 38 places in 114 ms
[2020-05-21 01:59:38] [INFO ] Deduced a trap composed of 11 places in 160 ms
[2020-05-21 01:59:38] [INFO ] Deduced a trap composed of 47 places in 92 ms
[2020-05-21 01:59:39] [INFO ] Deduced a trap composed of 34 places in 95 ms
[2020-05-21 01:59:39] [INFO ] Deduced a trap composed of 34 places in 123 ms
[2020-05-21 01:59:39] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5734 ms
Attempting to minimize the solution found.
Minimization took 84 ms.
Incomplete Parikh walk after 95900 steps, including 1000 resets, run finished after 239 ms. (steps per millisecond=401 ) properties seen :[1, 0, 1] could not realise parikh vector
FORMULA Peterson-PT-5-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-5-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 82800 steps, including 1000 resets, run finished after 136 ms. (steps per millisecond=608 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 97600 steps, including 1000 resets, run finished after 163 ms. (steps per millisecond=598 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 283/283 places, 691/691 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 283 transition count 687
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 279 transition count 687
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 8 place count 279 transition count 680
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 272 transition count 680
Applied a total of 22 rules in 47 ms. Remains 272 /283 variables (removed 11) and now considering 680/691 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 272/283 places, 680/691 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1256 ms. (steps per millisecond=796 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 490 ms. (steps per millisecond=2040 ) properties seen :[0]
Interrupted probabilistic random walk after 17066707 steps, run timeout after 30001 ms. (steps per millisecond=568 ) properties seen :[0]
Probabilistic random walk after 17066707 steps, saw 2438102 distinct states, run finished after 30002 ms. (steps per millisecond=568 ) properties seen :[0]
[2020-05-21 02:00:12] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 272 cols
[2020-05-21 02:00:12] [INFO ] Computed 23 place invariants in 4 ms
[2020-05-21 02:00:12] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned sat
[2020-05-21 02:00:12] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-21 02:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:00:12] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2020-05-21 02:00:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:00:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 26 ms returned sat
[2020-05-21 02:00:12] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-21 02:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:00:12] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2020-05-21 02:00:12] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 02:00:12] [INFO ] [Nat]Added 230 Read/Feed constraints in 45 ms returned sat
[2020-05-21 02:00:13] [INFO ] Deduced a trap composed of 21 places in 176 ms
[2020-05-21 02:00:13] [INFO ] Deduced a trap composed of 15 places in 164 ms
[2020-05-21 02:00:13] [INFO ] Deduced a trap composed of 29 places in 143 ms
[2020-05-21 02:00:13] [INFO ] Deduced a trap composed of 27 places in 129 ms
[2020-05-21 02:00:13] [INFO ] Deduced a trap composed of 27 places in 122 ms
[2020-05-21 02:00:13] [INFO ] Deduced a trap composed of 67 places in 123 ms
[2020-05-21 02:00:13] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2020-05-21 02:00:14] [INFO ] Deduced a trap composed of 20 places in 153 ms
[2020-05-21 02:00:14] [INFO ] Deduced a trap composed of 26 places in 140 ms
[2020-05-21 02:00:14] [INFO ] Deduced a trap composed of 18 places in 142 ms
[2020-05-21 02:00:14] [INFO ] Deduced a trap composed of 29 places in 123 ms
[2020-05-21 02:00:14] [INFO ] Deduced a trap composed of 31 places in 124 ms
[2020-05-21 02:00:14] [INFO ] Deduced a trap composed of 9 places in 123 ms
[2020-05-21 02:00:15] [INFO ] Deduced a trap composed of 9 places in 123 ms
[2020-05-21 02:00:15] [INFO ] Deduced a trap composed of 11 places in 147 ms
[2020-05-21 02:00:15] [INFO ] Deduced a trap composed of 11 places in 142 ms
[2020-05-21 02:00:15] [INFO ] Deduced a trap composed of 18 places in 116 ms
[2020-05-21 02:00:15] [INFO ] Deduced a trap composed of 10 places in 187 ms
[2020-05-21 02:00:15] [INFO ] Deduced a trap composed of 17 places in 133 ms
[2020-05-21 02:00:16] [INFO ] Deduced a trap composed of 31 places in 702 ms
[2020-05-21 02:00:16] [INFO ] Deduced a trap composed of 40 places in 112 ms
[2020-05-21 02:00:16] [INFO ] Deduced a trap composed of 25 places in 123 ms
[2020-05-21 02:00:17] [INFO ] Deduced a trap composed of 25 places in 161 ms
[2020-05-21 02:00:17] [INFO ] Deduced a trap composed of 44 places in 160 ms
[2020-05-21 02:00:17] [INFO ] Deduced a trap composed of 19 places in 276 ms
[2020-05-21 02:00:17] [INFO ] Deduced a trap composed of 18 places in 139 ms
[2020-05-21 02:00:17] [INFO ] Deduced a trap composed of 41 places in 123 ms
[2020-05-21 02:00:17] [INFO ] Deduced a trap composed of 40 places in 110 ms
[2020-05-21 02:00:18] [INFO ] Deduced a trap composed of 34 places in 94 ms
[2020-05-21 02:00:18] [INFO ] Deduced a trap composed of 25 places in 103 ms
[2020-05-21 02:00:18] [INFO ] Deduced a trap composed of 34 places in 55 ms
[2020-05-21 02:00:18] [INFO ] Deduced a trap composed of 33 places in 62 ms
[2020-05-21 02:00:18] [INFO ] Deduced a trap composed of 33 places in 78 ms
[2020-05-21 02:00:18] [INFO ] Deduced a trap composed of 33 places in 61 ms
[2020-05-21 02:00:18] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 5732 ms
[2020-05-21 02:00:18] [INFO ] Computed and/alt/rep : 674/4280/554 causal constraints in 29 ms.
[2020-05-21 02:00:23] [INFO ] Added : 443 causal constraints over 89 iterations in 5101 ms. Result :sat
[2020-05-21 02:00:23] [INFO ] Deduced a trap composed of 12 places in 185 ms
[2020-05-21 02:00:24] [INFO ] Deduced a trap composed of 19 places in 146 ms
[2020-05-21 02:00:24] [INFO ] Deduced a trap composed of 33 places in 126 ms
[2020-05-21 02:00:24] [INFO ] Deduced a trap composed of 42 places in 155 ms
[2020-05-21 02:00:24] [INFO ] Deduced a trap composed of 22 places in 152 ms
[2020-05-21 02:00:24] [INFO ] Deduced a trap composed of 46 places in 154 ms
[2020-05-21 02:00:25] [INFO ] Deduced a trap composed of 19 places in 151 ms
[2020-05-21 02:00:25] [INFO ] Deduced a trap composed of 40 places in 141 ms
[2020-05-21 02:00:25] [INFO ] Deduced a trap composed of 25 places in 154 ms
[2020-05-21 02:00:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1962 ms
Attempting to minimize the solution found.
Minimization took 49 ms.
Incomplete Parikh walk after 88700 steps, including 1000 resets, run finished after 184 ms. (steps per millisecond=482 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 272/272 places, 680/680 transitions.
Applied a total of 0 rules in 18 ms. Remains 272 /272 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 680/680 transitions.
Starting structural reductions, iteration 0 : 272/272 places, 680/680 transitions.
Applied a total of 0 rules in 16 ms. Remains 272 /272 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2020-05-21 02:00:25] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 272 cols
[2020-05-21 02:00:25] [INFO ] Computed 23 place invariants in 2 ms
[2020-05-21 02:00:26] [INFO ] Implicit Places using invariants in 523 ms returned [236, 248, 249, 250, 251, 252]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 528 ms to find 6 implicit places.
[2020-05-21 02:00:26] [INFO ] Redundant transitions in 53 ms returned []
[2020-05-21 02:00:26] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2020-05-21 02:00:26] [INFO ] Computed 17 place invariants in 4 ms
[2020-05-21 02:00:27] [INFO ] Dead Transitions using invariants and state equation in 832 ms returned []
Starting structural reductions, iteration 1 : 266/272 places, 680/680 transitions.
Applied a total of 0 rules in 20 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2020-05-21 02:00:27] [INFO ] Redundant transitions in 33 ms returned []
[2020-05-21 02:00:27] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2020-05-21 02:00:27] [INFO ] Computed 17 place invariants in 5 ms
[2020-05-21 02:00:28] [INFO ] Dead Transitions using invariants and state equation in 773 ms returned []
Finished structural reductions, in 2 iterations. Remains : 266/272 places, 680/680 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1235 ms. (steps per millisecond=809 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties seen :[0]
Interrupted probabilistic random walk after 16864918 steps, run timeout after 30001 ms. (steps per millisecond=562 ) properties seen :[0]
Probabilistic random walk after 16864918 steps, saw 2409275 distinct states, run finished after 30001 ms. (steps per millisecond=562 ) properties seen :[0]
[2020-05-21 02:00:59] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2020-05-21 02:00:59] [INFO ] Computed 17 place invariants in 3 ms
[2020-05-21 02:01:00] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2020-05-21 02:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:01:00] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2020-05-21 02:01:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:01:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2020-05-21 02:01:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:01:00] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2020-05-21 02:01:00] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 02:01:00] [INFO ] [Nat]Added 230 Read/Feed constraints in 53 ms returned sat
[2020-05-21 02:01:00] [INFO ] Deduced a trap composed of 34 places in 152 ms
[2020-05-21 02:01:01] [INFO ] Deduced a trap composed of 12 places in 118 ms
[2020-05-21 02:01:01] [INFO ] Deduced a trap composed of 20 places in 137 ms
[2020-05-21 02:01:01] [INFO ] Deduced a trap composed of 29 places in 186 ms
[2020-05-21 02:01:01] [INFO ] Deduced a trap composed of 18 places in 166 ms
[2020-05-21 02:01:02] [INFO ] Deduced a trap composed of 29 places in 471 ms
[2020-05-21 02:01:02] [INFO ] Deduced a trap composed of 36 places in 148 ms
[2020-05-21 02:01:02] [INFO ] Deduced a trap composed of 39 places in 128 ms
[2020-05-21 02:01:02] [INFO ] Deduced a trap composed of 11 places in 137 ms
[2020-05-21 02:01:02] [INFO ] Deduced a trap composed of 25 places in 171 ms
[2020-05-21 02:01:02] [INFO ] Deduced a trap composed of 10 places in 147 ms
[2020-05-21 02:01:03] [INFO ] Deduced a trap composed of 31 places in 121 ms
[2020-05-21 02:01:03] [INFO ] Deduced a trap composed of 9 places in 160 ms
[2020-05-21 02:01:03] [INFO ] Deduced a trap composed of 12 places in 117 ms
[2020-05-21 02:01:03] [INFO ] Deduced a trap composed of 13 places in 107 ms
[2020-05-21 02:01:03] [INFO ] Deduced a trap composed of 9 places in 135 ms
[2020-05-21 02:01:03] [INFO ] Deduced a trap composed of 18 places in 126 ms
[2020-05-21 02:01:04] [INFO ] Deduced a trap composed of 20 places in 108 ms
[2020-05-21 02:01:04] [INFO ] Deduced a trap composed of 20 places in 97 ms
[2020-05-21 02:01:04] [INFO ] Deduced a trap composed of 20 places in 125 ms
[2020-05-21 02:01:04] [INFO ] Deduced a trap composed of 18 places in 95 ms
[2020-05-21 02:01:04] [INFO ] Deduced a trap composed of 19 places in 95 ms
[2020-05-21 02:01:04] [INFO ] Deduced a trap composed of 32 places in 128 ms
[2020-05-21 02:01:04] [INFO ] Deduced a trap composed of 18 places in 99 ms
[2020-05-21 02:01:04] [INFO ] Deduced a trap composed of 20 places in 113 ms
[2020-05-21 02:01:05] [INFO ] Deduced a trap composed of 14 places in 123 ms
[2020-05-21 02:01:05] [INFO ] Deduced a trap composed of 33 places in 73 ms
[2020-05-21 02:01:05] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4386 ms
[2020-05-21 02:01:05] [INFO ] Computed and/alt/rep : 674/4280/554 causal constraints in 28 ms.
[2020-05-21 02:01:11] [INFO ] Added : 509 causal constraints over 102 iterations in 6837 ms. Result :sat
[2020-05-21 02:01:12] [INFO ] Deduced a trap composed of 25 places in 192 ms
[2020-05-21 02:01:12] [INFO ] Deduced a trap composed of 10 places in 142 ms
[2020-05-21 02:01:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 536 ms
Attempting to minimize the solution found.
Minimization took 48 ms.
Incomplete Parikh walk after 94900 steps, including 1000 resets, run finished after 168 ms. (steps per millisecond=564 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 11 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 680/680 transitions.
Starting structural reductions, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 10 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2020-05-21 02:01:12] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2020-05-21 02:01:12] [INFO ] Computed 17 place invariants in 2 ms
[2020-05-21 02:01:13] [INFO ] Implicit Places using invariants in 465 ms returned []
[2020-05-21 02:01:13] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2020-05-21 02:01:13] [INFO ] Computed 17 place invariants in 4 ms
[2020-05-21 02:01:13] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 02:01:15] [INFO ] Implicit Places using invariants and state equation in 2151 ms returned []
Implicit Place search using SMT with State Equation took 2640 ms to find 0 implicit places.
[2020-05-21 02:01:15] [INFO ] Redundant transitions in 11 ms returned []
[2020-05-21 02:01:15] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2020-05-21 02:01:15] [INFO ] Computed 17 place invariants in 3 ms
[2020-05-21 02:01:16] [INFO ] Dead Transitions using invariants and state equation in 738 ms returned []
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 680/680 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 179 ms. (steps per millisecond=558 ) properties seen :[0]
[2020-05-21 02:01:16] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2020-05-21 02:01:16] [INFO ] Computed 17 place invariants in 1 ms
[2020-05-21 02:01:16] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2020-05-21 02:01:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:01:16] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2020-05-21 02:01:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:01:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2020-05-21 02:01:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:01:17] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2020-05-21 02:01:17] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 02:01:17] [INFO ] [Nat]Added 230 Read/Feed constraints in 39 ms returned sat
[2020-05-21 02:01:17] [INFO ] Deduced a trap composed of 34 places in 140 ms
[2020-05-21 02:01:17] [INFO ] Deduced a trap composed of 12 places in 191 ms
[2020-05-21 02:01:17] [INFO ] Deduced a trap composed of 20 places in 124 ms
[2020-05-21 02:01:17] [INFO ] Deduced a trap composed of 29 places in 112 ms
[2020-05-21 02:01:17] [INFO ] Deduced a trap composed of 18 places in 114 ms
[2020-05-21 02:01:18] [INFO ] Deduced a trap composed of 29 places in 106 ms
[2020-05-21 02:01:18] [INFO ] Deduced a trap composed of 36 places in 109 ms
[2020-05-21 02:01:18] [INFO ] Deduced a trap composed of 39 places in 129 ms
[2020-05-21 02:01:18] [INFO ] Deduced a trap composed of 11 places in 107 ms
[2020-05-21 02:01:18] [INFO ] Deduced a trap composed of 25 places in 134 ms
[2020-05-21 02:01:18] [INFO ] Deduced a trap composed of 10 places in 154 ms
[2020-05-21 02:01:18] [INFO ] Deduced a trap composed of 31 places in 123 ms
[2020-05-21 02:01:19] [INFO ] Deduced a trap composed of 9 places in 115 ms
[2020-05-21 02:01:19] [INFO ] Deduced a trap composed of 12 places in 118 ms
[2020-05-21 02:01:19] [INFO ] Deduced a trap composed of 13 places in 121 ms
[2020-05-21 02:01:19] [INFO ] Deduced a trap composed of 9 places in 98 ms
[2020-05-21 02:01:19] [INFO ] Deduced a trap composed of 18 places in 111 ms
[2020-05-21 02:01:19] [INFO ] Deduced a trap composed of 20 places in 116 ms
[2020-05-21 02:01:19] [INFO ] Deduced a trap composed of 20 places in 106 ms
[2020-05-21 02:01:19] [INFO ] Deduced a trap composed of 20 places in 97 ms
[2020-05-21 02:01:20] [INFO ] Deduced a trap composed of 18 places in 94 ms
[2020-05-21 02:01:20] [INFO ] Deduced a trap composed of 19 places in 120 ms
[2020-05-21 02:01:20] [INFO ] Deduced a trap composed of 32 places in 117 ms
[2020-05-21 02:01:20] [INFO ] Deduced a trap composed of 18 places in 93 ms
[2020-05-21 02:01:20] [INFO ] Deduced a trap composed of 20 places in 98 ms
[2020-05-21 02:01:20] [INFO ] Deduced a trap composed of 14 places in 110 ms
[2020-05-21 02:01:20] [INFO ] Deduced a trap composed of 33 places in 73 ms
[2020-05-21 02:01:20] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3627 ms
[2020-05-21 02:01:20] [INFO ] Computed and/alt/rep : 674/4280/554 causal constraints in 24 ms.
[2020-05-21 02:01:27] [INFO ] Added : 509 causal constraints over 102 iterations in 6908 ms. Result :sat
[2020-05-21 02:01:27] [INFO ] Deduced a trap composed of 25 places in 156 ms
[2020-05-21 02:01:28] [INFO ] Deduced a trap composed of 10 places in 151 ms
[2020-05-21 02:01:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
Graph (trivial) has 510 edges and 266 vertex of which 165 / 266 are part of one of the 30 SCC in 8 ms
Free SCC test removed 135 places
Drop transitions removed 270 transitions
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 416 transitions.
Iterating post reduction 0 with 416 rules applied. Total rules applied 417 place count 131 transition count 264
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 417 place count 131 transition count 238
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 52 rules applied. Total rules applied 469 place count 105 transition count 238
Performed 15 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 499 place count 90 transition count 212
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 26 rules applied. Total rules applied 525 place count 74 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 40 edges and 74 vertex of which 36 / 74 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 530 place count 44 transition count 222
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Discarding 18 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Graph (complete) has 201 edges and 41 vertex of which 23 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.10 ms
Graph (trivial) has 79 edges and 23 vertex of which 6 / 23 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 41 rules applied. Total rules applied 571 place count 19 transition count 141
Drop transitions removed 57 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 3 with 89 rules applied. Total rules applied 660 place count 19 transition count 52
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 662 place count 19 transition count 66
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 690 place count 17 transition count 40
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 694 place count 17 transition count 40
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 706 place count 17 transition count 28
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 34 edges and 17 vertex of which 11 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Iterating post reduction 5 with 1 rules applied. Total rules applied 707 place count 11 transition count 28
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 719 place count 11 transition count 16
Symmetric choice reduction at 7 with 2 rule applications. Total rules 721 place count 11 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 725 place count 9 transition count 14
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 727 place count 9 transition count 12
Applied a total of 727 rules in 66 ms. Remains 9 /266 variables (removed 257) and now considering 12/680 (removed 668) transitions.
// Phase 1: matrix 12 rows 9 cols
[2020-05-21 02:01:28] [INFO ] Computed 3 place invariants in 1 ms
[2020-05-21 02:01:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-21 02:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:01:28] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-05-21 02:01:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:01:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 20 ms returned sat
[2020-05-21 02:01:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:01:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-05-21 02:01:28] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints in 1 ms.
[2020-05-21 02:01:28] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2020-05-21 02:01:28] [INFO ] Flatten gal took : 127 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 02:01:28] [INFO ] Applying decomposition
[2020-05-21 02:01:28] [INFO ] Flatten gal took : 101 ms
[2020-05-21 02:01:28] [INFO ] Flatten gal took : 114 ms
[2020-05-21 02:01:29] [INFO ] Input system was already deterministic with 680 transitions.
[2020-05-21 02:01:29] [INFO ] Input system was already deterministic with 680 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph6127337730119844614.txt, -o, /tmp/graph6127337730119844614.bin, -w, /tmp/graph6127337730119844614.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph6127337730119844614.bin, -l, -1, -v, -w, /tmp/graph6127337730119844614.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 02:01:29] [INFO ] Decomposing Gal with order
[2020-05-21 02:01:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 02:01:29] [INFO ] Removed a total of 908 redundant transitions.
[2020-05-21 02:01:29] [INFO ] Ran tautology test, simplified 0 / 1 in 651 ms.
[2020-05-21 02:01:29] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-11(UNSAT) depth K=0 took 25 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 560 out of 680 initially.
// Phase 1: matrix 560 rows 266 cols
[2020-05-21 02:01:29] [INFO ] Computed 17 place invariants in 4 ms
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_0_2 + IsEndLoop_4_2_2 + IsEndLoop_4_1_2 + IsEndLoop_4_3_2 + IsEndLoop_4_4_2 + IsEndLoop_4_1_3 + IsEndLoop_4_0_3 + IsEndLoop_4_2_3 + IsEndLoop_4_3_3 + IsEndLoop_4_4_3 + EndTurn_4_0 + EndTurn_4_3 + EndTurn_4_2 + EndTurn_4_1 + BeginLoop_4_1_0 + BeginLoop_4_0_0 + EndTurn_4_4 + BeginLoop_4_3_0 + BeginLoop_4_2_0 + BeginLoop_4_4_0 + WantSection_4_F + TestTurn_4_0 + TestTurn_4_1 + TestTurn_4_2 + TestTurn_4_3 + TestTurn_4_4 + AskForSection_4_0 = 1
inv : WantSection_2_F + WantSection_2_T = 1
inv : Turn_2_0 + Turn_2_4 + Turn_2_5 + Turn_2_1 + Turn_2_3 + Turn_2_2 = 1
inv : WantSection_4_F + WantSection_4_T = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_0_3 + IsEndLoop_2_1_3 + IsEndLoop_2_2_3 + IsEndLoop_2_4_3 + IsEndLoop_2_3_3 + IsEndLoop_2_0_4 + IsEndLoop_2_2_4 + IsEndLoop_2_3_4 + IsEndLoop_2_1_4 + IsEndLoop_2_4_4 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_2_3 + EndTurn_2_2 + BeginLoop_2_1_0 + BeginLoop_2_0_0 + EndTurn_2_4 + BeginLoop_2_4_0 + BeginLoop_2_3_0 + BeginLoop_2_2_0 + WantSection_2_F + TestAlone_2_0_3 + TestTurn_2_0 + TestTurn_2_1 + TestTurn_2_3 + TestTurn_2_2 + TestTurn_2_4 + TestIdentity_2_0_3 + AskForSection_2_0 = 1
inv : WantSection_3_F + WantSection_3_T = 1
inv : WantSection_0_T + WantSection_0_F = 1
inv : WantSection_5_F + WantSection_5_T = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_2 + IsEndLoop_1_0_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_0_3 + IsEndLoop_1_4_2 + IsEndLoop_1_1_3 + IsEndLoop_1_2_3 + IsEndLoop_1_4_3 + IsEndLoop_1_3_3 + IsEndLoop_1_0_4 + IsEndLoop_1_2_4 + IsEndLoop_1_3_4 + IsEndLoop_1_1_4 + IsEndLoop_1_4_4 + EndTurn_1_0 + EndTurn_1_1 + EndTurn_1_3 + EndTurn_1_2 + BeginLoop_1_1_0 + BeginLoop_1_0_0 + EndTurn_1_4 + BeginLoop_1_4_0 + BeginLoop_1_3_0 + BeginLoop_1_2_0 + WantSection_1_F + TestAlone_1_0_2 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_1_3 + TestTurn_1_2 + TestTurn_1_4 + AskForSection_1_0 = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_0_2 + IsEndLoop_3_2_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_4_2 + IsEndLoop_3_0_4 + IsEndLoop_3_2_4 + IsEndLoop_3_1_4 + IsEndLoop_3_3_4 + IsEndLoop_3_4_4 + EndTurn_3_0 + EndTurn_3_3 + EndTurn_3_2 + EndTurn_3_1 + BeginLoop_3_1_0 + BeginLoop_3_0_0 + EndTurn_3_4 + BeginLoop_3_3_0 + BeginLoop_3_2_0 + BeginLoop_3_4_0 + WantSection_3_F + TestTurn_3_0 + TestTurn_3_1 + TestTurn_3_2 + TestTurn_3_3 + TestTurn_3_4 + AskForSection_3_0 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_2_1 + IsEndLoop_5_3_1 + IsEndLoop_5_4_1 + IsEndLoop_5_0_2 + IsEndLoop_5_1_2 + IsEndLoop_5_3_2 + IsEndLoop_5_2_2 + IsEndLoop_5_4_2 + IsEndLoop_5_0_3 + IsEndLoop_5_2_3 + IsEndLoop_5_1_3 + IsEndLoop_5_3_3 + IsEndLoop_5_4_3 + EndTurn_5_0 + EndTurn_5_3 + EndTurn_5_2 + EndTurn_5_1 + BeginLoop_5_0_0 + EndTurn_5_4 + BeginLoop_5_3_0 + BeginLoop_5_2_0 + BeginLoop_5_1_0 + BeginLoop_5_4_0 + WantSection_5_F + TestTurn_5_1 + TestTurn_5_0 + TestTurn_5_2 + TestTurn_5_3 + TestTurn_5_4 + AskForSection_5_0 = 1
inv : Turn_3_4 + Turn_3_5 + Turn_3_1 + Turn_3_0 + Turn_3_3 + Turn_3_2 = 1
inv : IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_4_2 + IsEndLoop_0_3_2 + IsEndLoop_0_0_3 + IsEndLoop_0_1_3 + IsEndLoop_0_3_3 + IsEndLoop_0_2_3 + IsEndLoop_0_4_3 + IsEndLoop_0_0_4 + IsEndLoop_0_3_4 + IsEndLoop_0_1_4 + IsEndLoop_0_2_4 + IsEndLoop_0_4_4 + EndTurn_0_1 + EndTurn_0_0 + EndTurn_0_4 + EndTurn_0_3 + EndTurn_0_2 + BeginLoop_0_1_0 + BeginLoop_0_0_0 + BeginLoop_0_4_0 + BeginLoop_0_3_0 + BeginLoop_0_2_0 + WantSection_0_F + TestAlone_0_2_2 + TestAlone_0_0_2 + TestTurn_0_0 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_3 + TestTurn_0_4 + TestIdentity_0_0_2 + TestIdentity_0_2_2 + AskForSection_0_0 = 1
inv : Turn_4_4 + Turn_4_3 + Turn_4_5 + Turn_4_1 + Turn_4_0 + Turn_4_2 = 1
inv : Turn_0_0 + Turn_0_5 + Turn_0_4 + Turn_0_2 + Turn_0_1 + Turn_0_3 = 1
inv : Turn_1_0 + Turn_1_5 + Turn_1_4 + Turn_1_1 + Turn_1_3 + Turn_1_2 = 1
inv : WantSection_1_F + WantSection_1_T = 1
Total of 17 invariants.
[2020-05-21 02:01:29] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-11(UNSAT) depth K=1 took 10 ms
[2020-05-21 02:01:29] [INFO ] Computed 17 place invariants in 19 ms
[2020-05-21 02:01:29] [INFO ] Flatten gal took : 315 ms
[2020-05-21 02:01:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 560 out of 680 initially.
// Phase 1: matrix 560 rows 266 cols
[2020-05-21 02:01:29] [INFO ] Computed 17 place invariants in 1 ms
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_0_2 + IsEndLoop_4_2_2 + IsEndLoop_4_1_2 + IsEndLoop_4_3_2 + IsEndLoop_4_4_2 + IsEndLoop_4_1_3 + IsEndLoop_4_0_3 + IsEndLoop_4_2_3 + IsEndLoop_4_3_3 + IsEndLoop_4_4_3 + EndTurn_4_0 + EndTurn_4_3 + EndTurn_4_2 + EndTurn_4_1 + BeginLoop_4_1_0 + BeginLoop_4_0_0 + EndTurn_4_4 + BeginLoop_4_3_0 + BeginLoop_4_2_0 + BeginLoop_4_4_0 + WantSection_4_F + TestTurn_4_0 + TestTurn_4_1 + TestTurn_4_2 + TestTurn_4_3 + TestTurn_4_4 + AskForSection_4_0 = 1
inv : WantSection_2_F + WantSection_2_T = 1
inv : Turn_2_0 + Turn_2_4 + Turn_2_5 + Turn_2_1 + Turn_2_3 + Turn_2_2 = 1
inv : WantSection_4_F + WantSection_4_T = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_0_3 + IsEndLoop_2_1_3 + IsEndLoop_2_2_3 + IsEndLoop_2_4_3 + IsEndLoop_2_3_3 + IsEndLoop_2_0_4 + IsEndLoop_2_2_4 + IsEndLoop_2_3_4 + IsEndLoop_2_1_4 + IsEndLoop_2_4_4 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_2_3 + EndTurn_2_2 + BeginLoop_2_1_0 + BeginLoop_2_0_0 + EndTurn_2_4 + BeginLoop_2_4_0 + BeginLoop_2_3_0 + BeginLoop_2_2_0 + WantSection_2_F + TestAlone_2_0_3 + TestTurn_2_0 + TestTurn_2_1 + TestTurn_2_3 + TestTurn_2_2 + TestTurn_2_4 + TestIdentity_2_0_3 + AskForSection_2_0 = 1
inv : WantSection_3_F + WantSection_3_T = 1
inv : WantSection_0_T + WantSection_0_F = 1
inv : WantSection_5_F + WantSection_5_T = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_2 + IsEndLoop_1_0_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_0_3 + IsEndLoop_1_4_2 + IsEndLoop_1_1_3 + IsEndLoop_1_2_3 + IsEndLoop_1_4_3 + IsEndLoop_1_3_3 + IsEndLoop_1_0_4 + IsEndLoop_1_2_4 + IsEndLoop_1_3_4 + IsEndLoop_1_1_4 + IsEndLoop_1_4_4 + EndTurn_1_0 + EndTurn_1_1 + EndTurn_1_3 + EndTurn_1_2 + BeginLoop_1_1_0 + BeginLoop_1_0_0 + EndTurn_1_4 + BeginLoop_1_4_0 + BeginLoop_1_3_0 + BeginLoop_1_2_0 + WantSection_1_F + TestAlone_1_0_2 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_1_3 + TestTurn_1_2 + TestTurn_1_4 + AskForSection_1_0 = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_0_2 + IsEndLoop_3_2_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_4_2 + IsEndLoop_3_0_4 + IsEndLoop_3_2_4 + IsEndLoop_3_1_4 + IsEndLoop_3_3_4 + IsEndLoop_3_4_4 + EndTurn_3_0 + EndTurn_3_3 + EndTurn_3_2 + EndTurn_3_1 + BeginLoop_3_1_0 + BeginLoop_3_0_0 + EndTurn_3_4 + BeginLoop_3_3_0 + BeginLoop_3_2_0 + BeginLoop_3_4_0 + WantSection_3_F + TestTurn_3_0 + TestTurn_3_1 + TestTurn_3_2 + TestTurn_3_3 + TestTurn_3_4 + AskForSection_3_0 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_2_1 + IsEndLoop_5_3_1 + IsEndLoop_5_4_1 + IsEndLoop_5_0_2 + IsEndLoop_5_1_2 + IsEndLoop_5_3_2 + IsEndLoop_5_2_2 + IsEndLoop_5_4_2 + IsEndLoop_5_0_3 + IsEndLoop_5_2_3 + IsEndLoop_5_1_3 + IsEndLoop_5_3_3 + IsEndLoop_5_4_3 + EndTurn_5_0 + EndTurn_5_3 + EndTurn_5_2 + EndTurn_5_1 + BeginLoop_5_0_0 + EndTurn_5_4 + BeginLoop_5_3_0 + BeginLoop_5_2_0 + BeginLoop_5_1_0 + BeginLoop_5_4_0 + WantSection_5_F + TestTurn_5_1 + TestTurn_5_0 + TestTurn_5_2 + TestTurn_5_3 + TestTurn_5_4 + AskForSection_5_0 = 1
inv : Turn_3_4 + Turn_3_5 + Turn_3_1 + Turn_3_0 + Turn_3_3 + Turn_3_2 = 1
inv : IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_4_2 + IsEndLoop_0_3_2 + IsEndLoop_0_0_3 + IsEndLoop_0_1_3 + IsEndLoop_0_3_3 + IsEndLoop_0_2_3 + IsEndLoop_0_4_3 + IsEndLoop_0_0_4 + IsEndLoop_0_3_4 + IsEndLoop_0_1_4 + IsEndLoop_0_2_4 + IsEndLoop_0_4_4 + EndTurn_0_1 + EndTurn_0_0 + EndTurn_0_4 + EndTurn_0_3 + EndTurn_0_2 + BeginLoop_0_1_0 + BeginLoop_0_0_0 + BeginLoop_0_4_0 + BeginLoop_0_3_0 + BeginLoop_0_2_0 + WantSection_0_F + TestAlone_0_2_2 + TestAlone_0_0_2 + TestTurn_0_0 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_3 + TestTurn_0_4 + TestIdentity_0_0_2 + TestIdentity_0_2_2 + AskForSection_0_0 = 1
inv : Turn_4_4 + Turn_4_3 + Turn_4_5 + Turn_4_1 + Turn_4_0 + Turn_4_2 = 1
inv : Turn_0_0 + Turn_0_5 + Turn_0_4 + Turn_0_2 + Turn_0_1 + Turn_0_3 = 1
inv : Turn_1_0 + Turn_1_5 + Turn_1_4 + Turn_1_1 + Turn_1_3 + Turn_1_2 = 1
inv : WantSection_1_F + WantSection_1_T = 1
Total of 17 invariants.
[2020-05-21 02:01:29] [INFO ] Computed 17 place invariants in 2 ms
[2020-05-21 02:01:29] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 10 ms
[2020-05-21 02:01:29] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
[2020-05-21 02:01:30] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-11(UNSAT) depth K=2 took 260 ms
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : Peterson-PT-5-ReachabilityCardinality-11 with value :((gu37.TestIdentity_0_2_2<=gu37.TestIdentity_0_0_2)||(gu36.TestIdentity_2_0_3<=gu36.IsEndLoop_1_0_1))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
[2020-05-21 02:01:31] [INFO ] Proved 266 variables to be positive in 1100 ms
[2020-05-21 02:01:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityCardinality-11
[2020-05-21 02:01:31] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityCardinality-11(SAT) depth K=0 took 26 ms
[2020-05-21 02:01:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityCardinality-11
[2020-05-21 02:01:31] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityCardinality-11(SAT) depth K=1 took 112 ms
SDD proceeding with computation, new max is 4096
[2020-05-21 02:01:31] [INFO ] Proved 266 variables to be positive in 1648 ms
[2020-05-21 02:01:31] [INFO ] Computing symmetric may disable matrix : 680 transitions.
[2020-05-21 02:01:31] [INFO ] Computation of disable matrix completed :0/680 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:01:31] [INFO ] Computation of Complete disable matrix. took 87 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:01:31] [INFO ] Computing symmetric may enable matrix : 680 transitions.
[2020-05-21 02:01:31] [INFO ] Computation of Complete enable matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:01:31] [INFO ] Computing symmetric co enabling matrix : 680 transitions.
[2020-05-21 02:01:31] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-11(UNSAT) depth K=3 took 1908 ms
SDD proceeding with computation, new max is 8192
[2020-05-21 02:01:34] [INFO ] Computation of co-enabling matrix(4/680) took 3001 ms. Total solver calls (SAT/UNSAT): 1323(103/1220)
[2020-05-21 02:01:37] [INFO ] Computation of co-enabling matrix(12/680) took 6220 ms. Total solver calls (SAT/UNSAT): 2816(210/2606)
SDD proceeding with computation, new max is 16384
[2020-05-21 02:01:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityCardinality-11
[2020-05-21 02:01:40] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityCardinality-11(SAT) depth K=2 took 9014 ms
[2020-05-21 02:01:41] [INFO ] Computation of co-enabling matrix(24/680) took 9439 ms. Total solver calls (SAT/UNSAT): 5068(311/4757)
[2020-05-21 02:01:44] [INFO ] Computation of co-enabling matrix(37/680) took 12623 ms. Total solver calls (SAT/UNSAT): 7431(411/7020)
[2020-05-21 02:01:47] [INFO ] Computation of co-enabling matrix(51/680) took 15684 ms. Total solver calls (SAT/UNSAT): 9889(524/9365)
SDD proceeding with computation, new max is 32768
[2020-05-21 02:01:50] [INFO ] Computation of co-enabling matrix(65/680) took 18889 ms. Total solver calls (SAT/UNSAT): 12386(633/11753)
[2020-05-21 02:01:53] [INFO ] Computation of co-enabling matrix(82/680) took 22023 ms. Total solver calls (SAT/UNSAT): 15321(763/14558)
[2020-05-21 02:01:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityCardinality-11
[2020-05-21 02:01:55] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityCardinality-11(SAT) depth K=3 took 14830 ms
[2020-05-21 02:01:57] [INFO ] Computation of co-enabling matrix(94/680) took 25472 ms. Total solver calls (SAT/UNSAT): 17410(862/16548)
[2020-05-21 02:01:58] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityCardinality-11(UNSAT) depth K=4 took 26532 ms
[2020-05-21 02:02:01] [INFO ] Computation of co-enabling matrix(98/680) took 29435 ms. Total solver calls (SAT/UNSAT): 18080(899/17181)
[2020-05-21 02:02:04] [INFO ] Computation of co-enabling matrix(103/680) took 32627 ms. Total solver calls (SAT/UNSAT): 18895(939/17956)
[2020-05-21 02:02:07] [INFO ] Computation of co-enabling matrix(106/680) took 36091 ms. Total solver calls (SAT/UNSAT): 19375(962/18413)
[2020-05-21 02:02:11] [INFO ] Computation of co-enabling matrix(109/680) took 39450 ms. Total solver calls (SAT/UNSAT): 19842(982/18860)
[2020-05-21 02:02:14] [INFO ] Computation of co-enabling matrix(115/680) took 42750 ms. Total solver calls (SAT/UNSAT): 20861(1031/19830)
Invariant property Peterson-PT-5-ReachabilityCardinality-11 does not hold.
FORMULA Peterson-PT-5-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 32769 fixpoint passes
[2020-05-21 02:02:18] [INFO ] Computation of co-enabling matrix(120/680) took 46667 ms. Total solver calls (SAT/UNSAT): 21692(1066/20626)
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,3.63622e+06,50.1545,795024,2,186389,20,2.40532e+06,6,0,1747,1.56514e+06,0
Total reachable state count : 3636223

Verifying 1 reachability properties.
Invariant property Peterson-PT-5-ReachabilityCardinality-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-5-ReachabilityCardinality-11,28,50.259,795024,2,423,20,2.40532e+06,7,0,1761,1.56514e+06,0
[2020-05-21 02:02:20] [WARNING] Interrupting SMT solver.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 02:02:20] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 02:02:20] [WARNING] Unexpected error occurred while running SMT. Was verifying Peterson-PT-5-ReachabilityCardinality-11 SMT depth 5
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-21 02:02:20] [INFO ] During BMC, SMT solver timed out at depth 5
[2020-05-21 02:02:20] [INFO ] BMC solving timed out (3600000 secs) at depth 5
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 02:02:20] [WARNING] Unexpected error occurred while running SMT. Was verifying Peterson-PT-5-ReachabilityCardinality-11 K-induction depth 4
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
[2020-05-21 02:02:20] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
[2020-05-21 02:02:20] [INFO ] Built C files in 52031ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590026541398

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="Peterson-PT-5"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-PT-5, 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 r111-csrt-158961258100734"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 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 ;