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.r210-tajo-159033475600359.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 itstools
Input is ShieldIIPt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475600359
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 3.6K May 14 01:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 01:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 18:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 18:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.6K May 13 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 686K May 12 20:42 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 ShieldIIPt-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590585724726

[2020-05-27 13:22:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 13:22:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 13:22:06] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2020-05-27 13:22:06] [INFO ] Transformed 2803 places.
[2020-05-27 13:22:06] [INFO ] Transformed 2603 transitions.
[2020-05-27 13:22:06] [INFO ] Found NUPN structural information;
[2020-05-27 13:22:06] [INFO ] Parsed PT model containing 2803 places and 2603 transitions in 250 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 72 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 136 ms. (steps per millisecond=73 ) properties seen :[0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1]
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2603 rows 2803 cols
[2020-05-27 13:22:07] [INFO ] Computed 361 place invariants in 55 ms
[2020-05-27 13:22:08] [INFO ] [Real]Absence check using 361 positive place invariants in 465 ms returned sat
[2020-05-27 13:22:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:22:12] [INFO ] [Real]Absence check using state equation in 4099 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 13:22:13] [INFO ] [Real]Absence check using 361 positive place invariants in 526 ms returned sat
[2020-05-27 13:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:22:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 13:22:17] [INFO ] [Real]Absence check using state equation in 3993 ms returned (error "Failed to check-sat")
[2020-05-27 13:22:18] [INFO ] [Real]Absence check using 361 positive place invariants in 452 ms returned sat
[2020-05-27 13:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:22:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 13:22:22] [INFO ] [Real]Absence check using state equation in 4334 ms returned (error "Failed to check-sat")
[2020-05-27 13:22:23] [INFO ] [Real]Absence check using 361 positive place invariants in 905 ms returned sat
[2020-05-27 13:22:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:22:27] [INFO ] [Real]Absence check using state equation in 3441 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 13:22:28] [INFO ] [Real]Absence check using 361 positive place invariants in 479 ms returned sat
[2020-05-27 13:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:22:32] [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 (= s947 (- t1519 t1521))") while checking expression at index 4
[2020-05-27 13:22:34] [INFO ] [Real]Absence check using 361 positive place invariants in 1205 ms returned sat
[2020-05-27 13:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:22:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 13:22:37] [INFO ] [Real]Absence check using state equation in 3217 ms returned (error "Failed to check-sat")
[2020-05-27 13:22:38] [INFO ] [Real]Absence check using 361 positive place invariants in 438 ms returned sat
[2020-05-27 13:22:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:22:42] [INFO ] [Real]Absence check using state equation in 4136 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 13:22:43] [INFO ] [Real]Absence check using 361 positive place invariants in 596 ms returned sat
[2020-05-27 13:22:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:22:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 13:22:47] [INFO ] [Real]Absence check using state equation in 3947 ms returned unknown
[2020-05-27 13:22:48] [INFO ] [Real]Absence check using 361 positive place invariants in 422 ms returned sat
[2020-05-27 13:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:22:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 13:22:52] [INFO ] [Real]Absence check using state equation in 4284 ms returned (error "Failed to check-sat")
Support contains 40 out of 2803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Performed 655 Post agglomeration using F-continuation condition.Transition count delta: 655
Iterating post reduction 0 with 655 rules applied. Total rules applied 655 place count 2803 transition count 1948
Reduce places removed 655 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 657 rules applied. Total rules applied 1312 place count 2148 transition count 1946
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1313 place count 2147 transition count 1946
Performed 167 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 167 Pre rules applied. Total rules applied 1313 place count 2147 transition count 1779
Deduced a syphon composed of 167 places in 8 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 3 with 334 rules applied. Total rules applied 1647 place count 1980 transition count 1779
Symmetric choice reduction at 3 with 281 rule applications. Total rules 1928 place count 1980 transition count 1779
Deduced a syphon composed of 281 places in 13 ms
Reduce places removed 281 places and 281 transitions.
Iterating global reduction 3 with 562 rules applied. Total rules applied 2490 place count 1699 transition count 1498
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 2490 place count 1699 transition count 1384
Deduced a syphon composed of 114 places in 8 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 2718 place count 1585 transition count 1384
Performed 658 Post agglomeration using F-continuation condition.Transition count delta: 658
Deduced a syphon composed of 658 places in 1 ms
Reduce places removed 658 places and 0 transitions.
Iterating global reduction 3 with 1316 rules applied. Total rules applied 4034 place count 927 transition count 726
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4236 place count 826 transition count 788
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 4250 place count 819 transition count 792
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4251 place count 819 transition count 791
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4255 place count 819 transition count 787
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4259 place count 815 transition count 787
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 5 with 39 rules applied. Total rules applied 4298 place count 815 transition count 787
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4299 place count 814 transition count 786
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4301 place count 812 transition count 786
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4301 place count 812 transition count 785
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4303 place count 811 transition count 785
Applied a total of 4303 rules in 1312 ms. Remains 811 /2803 variables (removed 1992) and now considering 785/2603 (removed 1818) transitions.
Finished structural reductions, in 1 iterations. Remains : 811/2803 places, 785/2603 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6317 ms. (steps per millisecond=158 ) properties seen :[0, 0, 1, 0, 1, 0, 1, 1, 0]
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4456 ms. (steps per millisecond=224 ) properties seen :[1, 0, 0, 0, 1]
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4120 ms. (steps per millisecond=242 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 10 resets, run finished after 4637 ms. (steps per millisecond=215 ) properties seen :[0, 1, 0]
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4575 ms. (steps per millisecond=218 ) properties seen :[0, 0]
// Phase 1: matrix 785 rows 811 cols
[2020-05-27 13:23:17] [INFO ] Computed 359 place invariants in 5 ms
[2020-05-27 13:23:18] [INFO ] [Real]Absence check using 359 positive place invariants in 208 ms returned sat
[2020-05-27 13:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:23:19] [INFO ] [Real]Absence check using state equation in 1412 ms returned sat
[2020-05-27 13:23:19] [INFO ] State equation strengthened by 74 read => feed constraints.
[2020-05-27 13:23:19] [INFO ] [Real]Added 74 Read/Feed constraints in 23 ms returned sat
[2020-05-27 13:23:20] [INFO ] Deduced a trap composed of 4 places in 122 ms
[2020-05-27 13:23:20] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-27 13:23:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2020-05-27 13:23:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:23:20] [INFO ] [Nat]Absence check using 359 positive place invariants in 193 ms returned sat
[2020-05-27 13:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:23:21] [INFO ] [Nat]Absence check using state equation in 1276 ms returned sat
[2020-05-27 13:23:21] [INFO ] [Nat]Added 74 Read/Feed constraints in 18 ms returned sat
[2020-05-27 13:23:21] [INFO ] Computed and/alt/rep : 765/1900/765 causal constraints in 67 ms.
[2020-05-27 13:23:33] [INFO ] Added : 709 causal constraints over 142 iterations in 11252 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 50 ms.
[2020-05-27 13:23:33] [INFO ] [Real]Absence check using 359 positive place invariants in 164 ms returned sat
[2020-05-27 13:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:23:34] [INFO ] [Real]Absence check using state equation in 1253 ms returned sat
[2020-05-27 13:23:34] [INFO ] [Real]Added 74 Read/Feed constraints in 24 ms returned sat
[2020-05-27 13:23:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:23:35] [INFO ] [Nat]Absence check using 359 positive place invariants in 212 ms returned sat
[2020-05-27 13:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:23:36] [INFO ] [Nat]Absence check using state equation in 1401 ms returned sat
[2020-05-27 13:23:36] [INFO ] [Nat]Added 74 Read/Feed constraints in 20 ms returned sat
[2020-05-27 13:23:36] [INFO ] Deduced a trap composed of 5 places in 67 ms
[2020-05-27 13:23:36] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-27 13:23:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2020-05-27 13:23:36] [INFO ] Computed and/alt/rep : 765/1900/765 causal constraints in 46 ms.
[2020-05-27 13:23:50] [INFO ] Added : 679 causal constraints over 137 iterations in 14144 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 45 ms.
Incomplete Parikh walk after 103000 steps, including 1000 resets, run finished after 838 ms. (steps per millisecond=122 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 176900 steps, including 265 resets, run finished after 1007 ms. (steps per millisecond=175 ) properties seen :[1, 0] could not realise parikh vector
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 9 out of 811 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 811/811 places, 785/785 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 811 transition count 776
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 802 transition count 776
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 18 place count 802 transition count 769
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 795 transition count 769
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 784 transition count 758
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 66 place count 778 transition count 763
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 777 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 776 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 775 transition count 760
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 774 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 773 transition count 758
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 772 transition count 757
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 771 transition count 756
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 770 transition count 755
Applied a total of 74 rules in 805 ms. Remains 770 /811 variables (removed 41) and now considering 755/785 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/811 places, 755/785 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 5177 ms. (steps per millisecond=193 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4147 ms. (steps per millisecond=241 ) properties seen :[0]
Interrupted probabilistic random walk after 2488025 steps, run timeout after 30001 ms. (steps per millisecond=82 ) properties seen :[0]
Probabilistic random walk after 2488025 steps, saw 396823 distinct states, run finished after 30001 ms. (steps per millisecond=82 ) properties seen :[0]
// Phase 1: matrix 755 rows 770 cols
[2020-05-27 13:24:33] [INFO ] Computed 359 place invariants in 7 ms
[2020-05-27 13:24:33] [INFO ] [Real]Absence check using 359 positive place invariants in 200 ms returned sat
[2020-05-27 13:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:24:34] [INFO ] [Real]Absence check using state equation in 1161 ms returned sat
[2020-05-27 13:24:34] [INFO ] State equation strengthened by 59 read => feed constraints.
[2020-05-27 13:24:34] [INFO ] [Real]Added 59 Read/Feed constraints in 29 ms returned sat
[2020-05-27 13:24:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:24:34] [INFO ] [Nat]Absence check using 359 positive place invariants in 156 ms returned sat
[2020-05-27 13:24:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:24:36] [INFO ] [Nat]Absence check using state equation in 1122 ms returned sat
[2020-05-27 13:24:36] [INFO ] [Nat]Added 59 Read/Feed constraints in 51 ms returned sat
[2020-05-27 13:24:36] [INFO ] Deduced a trap composed of 5 places in 95 ms
[2020-05-27 13:24:36] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-05-27 13:24:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2020-05-27 13:24:36] [INFO ] Computed and/alt/rep : 747/1737/747 causal constraints in 48 ms.
[2020-05-27 13:24:51] [INFO ] Added : 652 causal constraints over 131 iterations in 14912 ms. Result :unknown
Incomplete Parikh walk after 97000 steps, including 1000 resets, run finished after 569 ms. (steps per millisecond=170 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 770 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 770/770 places, 755/755 transitions.
Applied a total of 0 rules in 15 ms. Remains 770 /770 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 755/755 transitions.
Starting structural reductions, iteration 0 : 770/770 places, 755/755 transitions.
Applied a total of 0 rules in 69 ms. Remains 770 /770 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 770 cols
[2020-05-27 13:24:52] [INFO ] Computed 359 place invariants in 2 ms
[2020-05-27 13:24:53] [INFO ] Implicit Places using invariants in 1393 ms returned [759]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1410 ms to find 1 implicit places.
[2020-05-27 13:24:53] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 755 rows 769 cols
[2020-05-27 13:24:53] [INFO ] Computed 358 place invariants in 3 ms
[2020-05-27 13:24:55] [INFO ] Dead Transitions using invariants and state equation in 1510 ms returned []
Starting structural reductions, iteration 1 : 769/770 places, 755/755 transitions.
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 769 transition count 755
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 768 transition count 754
Applied a total of 3 rules in 42 ms. Remains 768 /769 variables (removed 1) and now considering 754/755 (removed 1) transitions.
// Phase 1: matrix 754 rows 768 cols
[2020-05-27 13:24:55] [INFO ] Computed 358 place invariants in 2 ms
[2020-05-27 13:24:56] [INFO ] Implicit Places using invariants in 1366 ms returned []
// Phase 1: matrix 754 rows 768 cols
[2020-05-27 13:24:56] [INFO ] Computed 358 place invariants in 4 ms
[2020-05-27 13:25:02] [INFO ] State equation strengthened by 58 read => feed constraints.
[2020-05-27 13:25:13] [INFO ] Implicit Places using invariants and state equation in 17146 ms returned []
Implicit Place search using SMT with State Equation took 18515 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 768/770 places, 754/755 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 5885 ms. (steps per millisecond=169 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4792 ms. (steps per millisecond=208 ) properties seen :[0]
Interrupted probabilistic random walk after 2531970 steps, run timeout after 30001 ms. (steps per millisecond=84 ) properties seen :[0]
Probabilistic random walk after 2531970 steps, saw 407942 distinct states, run finished after 30013 ms. (steps per millisecond=84 ) properties seen :[0]
// Phase 1: matrix 754 rows 768 cols
[2020-05-27 13:25:54] [INFO ] Computed 358 place invariants in 1 ms
[2020-05-27 13:25:54] [INFO ] [Real]Absence check using 358 positive place invariants in 198 ms returned sat
[2020-05-27 13:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:25:55] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2020-05-27 13:25:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2020-05-27 13:25:55] [INFO ] [Real]Added 58 Read/Feed constraints in 28 ms returned sat
[2020-05-27 13:25:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:25:56] [INFO ] [Nat]Absence check using 358 positive place invariants in 141 ms returned sat
[2020-05-27 13:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:25:57] [INFO ] [Nat]Absence check using state equation in 1074 ms returned sat
[2020-05-27 13:25:57] [INFO ] [Nat]Added 58 Read/Feed constraints in 20 ms returned sat
[2020-05-27 13:25:57] [INFO ] Computed and/alt/rep : 746/1731/746 causal constraints in 75 ms.
[2020-05-27 13:26:10] [INFO ] Added : 670 causal constraints over 135 iterations in 13385 ms. Result :unknown
Incomplete Parikh walk after 98800 steps, including 1000 resets, run finished after 740 ms. (steps per millisecond=133 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 768 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 768/768 places, 754/754 transitions.
Applied a total of 0 rules in 33 ms. Remains 768 /768 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 754/754 transitions.
Starting structural reductions, iteration 0 : 768/768 places, 754/754 transitions.
Applied a total of 0 rules in 35 ms. Remains 768 /768 variables (removed 0) and now considering 754/754 (removed 0) transitions.
// Phase 1: matrix 754 rows 768 cols
[2020-05-27 13:26:11] [INFO ] Computed 358 place invariants in 15 ms
[2020-05-27 13:26:16] [INFO ] Implicit Places using invariants in 5073 ms returned []
// Phase 1: matrix 754 rows 768 cols
[2020-05-27 13:26:16] [INFO ] Computed 358 place invariants in 4 ms
[2020-05-27 13:26:23] [INFO ] State equation strengthened by 58 read => feed constraints.
[2020-05-27 13:26:30] [INFO ] Implicit Places using invariants and state equation in 13863 ms returned []
Implicit Place search using SMT with State Equation took 18942 ms to find 0 implicit places.
[2020-05-27 13:26:30] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 754 rows 768 cols
[2020-05-27 13:26:30] [INFO ] Computed 358 place invariants in 19 ms
[2020-05-27 13:26:32] [INFO ] Dead Transitions using invariants and state equation in 1922 ms returned []
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 754/754 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 770 ms. (steps per millisecond=129 ) properties seen :[0]
// Phase 1: matrix 754 rows 768 cols
[2020-05-27 13:26:33] [INFO ] Computed 358 place invariants in 4 ms
[2020-05-27 13:26:35] [INFO ] [Real]Absence check using 358 positive place invariants in 2102 ms returned sat
[2020-05-27 13:26:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:26:40] [INFO ] [Real]Absence check using state equation in 5353 ms returned sat
[2020-05-27 13:26:40] [INFO ] State equation strengthened by 58 read => feed constraints.
[2020-05-27 13:26:40] [INFO ] [Real]Added 58 Read/Feed constraints in 12 ms returned sat
[2020-05-27 13:26:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:26:41] [INFO ] [Nat]Absence check using 358 positive place invariants in 199 ms returned sat
[2020-05-27 13:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:26:42] [INFO ] [Nat]Absence check using state equation in 1498 ms returned sat
[2020-05-27 13:26:42] [INFO ] [Nat]Added 58 Read/Feed constraints in 41 ms returned sat
[2020-05-27 13:26:42] [INFO ] Computed and/alt/rep : 746/1731/746 causal constraints in 63 ms.
[2020-05-27 13:26:57] [INFO ] Added : 670 causal constraints over 135 iterations in 14841 ms. Result :unknown
Partial Free-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 768 transition count 754
Partial Post-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 0 with 89 rules applied. Total rules applied 185 place count 768 transition count 754
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 188 place count 768 transition count 751
Applied a total of 188 rules in 84 ms. Remains 768 /768 variables (removed 0) and now considering 751/754 (removed 3) transitions.
// Phase 1: matrix 751 rows 768 cols
[2020-05-27 13:26:57] [INFO ] Computed 358 place invariants in 3 ms
[2020-05-27 13:26:58] [INFO ] [Real]Absence check using 358 positive place invariants in 204 ms returned sat
[2020-05-27 13:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:26:59] [INFO ] [Real]Absence check using state equation in 1099 ms returned sat
[2020-05-27 13:26:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:26:59] [INFO ] [Nat]Absence check using 358 positive place invariants in 201 ms returned sat
[2020-05-27 13:26:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:27:01] [INFO ] [Nat]Absence check using state equation in 1384 ms returned sat
[2020-05-27 13:27:01] [INFO ] State equation strengthened by 91 read => feed constraints.
[2020-05-27 13:27:01] [INFO ] [Nat]Added 91 Read/Feed constraints in 27 ms returned sat
[2020-05-27 13:27:01] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2020-05-27 13:27:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2020-05-27 13:27:01] [INFO ] Computed and/alt/rep : 743/2104/743 causal constraints in 66 ms.
[2020-05-27 13:27:15] [INFO ] Added : 630 causal constraints over 126 iterations in 14286 ms. Result :unknown
[2020-05-27 13:27:15] [INFO ] Flatten gal took : 175 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 13:27:16] [INFO ] Applying decomposition
[2020-05-27 13:27:16] [INFO ] Flatten gal took : 62 ms
[2020-05-27 13:27:16] [INFO ] Flatten gal took : 249 ms
[2020-05-27 13:27:16] [INFO ] Input system was already deterministic with 754 transitions.
[2020-05-27 13:27:16] [INFO ] Input system was already deterministic with 754 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/graph13511708859949569504.txt, -o, /tmp/graph13511708859949569504.bin, -w, /tmp/graph13511708859949569504.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/graph13511708859949569504.bin, -l, -1, -v, -w, /tmp/graph13511708859949569504.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 13:27:16] [INFO ] Decomposing Gal with order
[2020-05-27 13:27:16] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 754 rows 768 cols
[2020-05-27 13:27:16] [INFO ] Computed 358 place invariants in 3 ms
inv : p35 + p151 + p155 = 1
inv : p1503 + p1506 + p1507 = 1
inv : p2566 + p2570 = 1
inv : p396 + p398 = 1
inv : p35 + p105 + p110 = 1
inv : p2382 + p2387 = 1
inv : p35 + p258 + p260 = 1
inv : p2520 + p2525 = 1
inv : p2055 + p2058 + p2059 = 1
inv : p2673 + p2675 = 1
inv : p1147 + p1148 + p1175 + p1180 = 1
inv : p2715 + p2720 = 1
inv : p35 + p202 + p204 = 1
inv : p485 + p490 = 1
inv : p2279 + p2284 = 1
inv : p35 + p61 + p63 = 1
inv : p623 + p628 = 1
inv : p1227 + p1232 + p1233 = 1
inv : p2190 + p2192 = 1
inv : p2724 + p2725 + p2732 = 1
inv : p951 + p954 + p955 = 1
inv : p2392 + p2393 + p2410 + p2412 = 1
inv : p2338 + p2340 = 1
inv : p544 + p546 = 1
inv : p823 + p825 = 1
inv : p35 + p300 + p305 = 1
inv : p879 + p881 = 1
inv : p2676 + p2679 + p2680 = 1
inv : p35 + p319 + p340 + p342 = 1
inv : p399 + p402 + p403 = 1
inv : p675 + p680 + p681 = 1
inv : p2617 + p2619 = 1
inv : p1855 + p1857 = 1
inv : p35 + p261 + p264 + p265 = 1
inv : p744 + p747 + p748 = 1
inv : p2124 + p2127 + p2128 = 1
inv : p1027 + p1029 = 1
inv : p2469 + p2472 + p2473 = 1
inv : p772 + p776 = 1
inv : p921 + p926 = 1
inv : p726 + p731 = 1
inv : p35 + p54 + p57 + p58 = 1
inv : p2331 + p2336 + p2337 = 1
inv : p1362 + p1364 = 1
inv : p1462 + p1466 = 1
inv : p2742 + p2744 = 1
inv : p2232 + p2237 = 1
inv : p2052 + p2054 = 1
inv : p2392 + p2393 + p2400 + p2403 + p2404 = 1
inv : p1416 + p1421 = 1
inv : p1554 + p1559 = 1
inv : p1651 + p1653 = 1
inv : p1779 + p1784 + p1785 = 1
inv : p968 + p973 = 1
inv : p2476 + p2478 = 1
inv : p1224 + p1226 = 1
inv : p1738 + p1742 = 1
inv : p1789 + p1791 = 1
inv : p1648 + p1650 = 1
inv : p35 + p261 + p266 + p267 = 1
inv : p1086 + p1088 = 1
inv : p1887 + p1892 = 1
inv : p1030 + p1032 = 1
inv : p1313 + p1318 = 1
inv : p2124 + p2129 + p2130 = 1
inv : p2037 + p2042 = 1
inv : p2102 + p2106 + p2111 = 1
inv : p2131 + p2133 = 1
inv : p783 + p788 = 1
inv : p1569 + p1571 = 1
inv : p1986 + p1991 + p1992 = 1
inv : p685 + p687 = 1
inv : p1608 + p1611 + p1613 + p1616 = 1
inv : p2392 + p2428 + p2432 = 1
inv : p1117 + p1121 = 1
inv : p2745 + p2750 = 1
inv : p1296 + p1299 + p1300 = 1
inv : p1404 + p1409 = 1
inv : p2621 + p2629 = 1
inv : p547 + p549 = 1
inv : p1796 + p1801 = 1
inv : p1779 + p1782 + p1783 = 1
inv : p35 + p312 + p317 = 1
inv : p2272 + p2274 = 1
inv : p2479 + p2481 = 1
inv : p1707 + p1709 = 1
inv : p35 + p162 + p167 = 1
inv : p1147 + p1148 + p1168 + p1170 = 1
inv : p2392 + p2393 + p2400 + p2405 + p2406 = 1
inv : p35 + p319 + p347 + p352 = 1
inv : p1510 + p1512 = 1
inv : p35 + p199 + p201 = 1
inv : p933 + p938 = 1
inv : p1945 + p1949 = 1
inv : p35 + p319 + p381 + p386 = 1
inv : p1255 + p1259 = 1
inv : p2658 + p2663 = 1
inv : p961 + p963 = 1
inv : p1956 + p1961 = 1
inv : p1059 + p1064 = 1
inv : p675 + p678 + p679 = 1
inv : p744 + p749 + p750 = 1
inv : p820 + p822 = 1
inv : p2245 + p2249 = 1
inv : p35 + p54 + p59 + p60 = 1
inv : p1244 + p1249 = 1
inv : p1658 + p1663 = 1
inv : p1089 + p1094 + p1095 = 1
inv : p1717 + p1719 = 1
inv : p2200 + p2202 = 1
inv : p714 + p719 = 1
inv : p1473 + p1478 = 1
inv : p1017 + p1019 = 1
inv : p2469 + p2474 + p2475 = 1
inv : p406 + p408 = 1
inv : p2055 + p2060 + p2061 = 1
inv : p2370 + p2375 = 1
inv : p35 + p51 + p53 = 1
inv : p588 + p593 = 1
inv : p634 + p638 = 1
inv : p1375 + p1377 = 1
inv : p35 + p64 + p66 = 1
inv : p1140 + p1145 = 1
inv : p35 + p319 + p337 + p339 = 1
inv : p1500 + p1502 = 1
inv : p1710 + p1715 + p1716 = 1
inv : p2555 + p2560 = 1
inv : p2328 + p2330 = 1
inv : p1641 + p1644 + p1645 = 1
inv : p1147 + p1148 + p1158 + p1161 + p1162 = 1
inv : p35 + p243 + p248 = 1
inv : p1147 + p1148 + p1186 + p1190 = 1
inv : p1303 + p1305 = 1
inv : p830 + p835 = 1
inv : p35 + p289 + p293 = 1
inv : p2676 + p2681 + p2682 = 1
inv : p399 + p404 + p405 = 1
inv : p2614 + p2616 = 1
inv : p2141 + p2146 = 1
inv : p2068 + p2072 + p2077 = 1
inv : p478 + p480 = 1
inv : p2392 + p2393 + p2417 + p2422 = 1
inv : p1914 + p1916 = 1
inv : p2269 + p2271 = 1
inv : p645 + p650 = 1
inv : p2752 + p2754 = 1
inv : p1128 + p1133 = 1
inv : p2313 + p2318 = 1
inv : p1365 + p1368 + p1369 = 1
inv : p1434 + p1439 + p1440 = 1
inv : p1600 + p1604 = 1
inv : p35 + p174 + p179 = 1
inv : p889 + p891 = 1
inv : p2486 + p2491 = 1
inv : p475 + p477 = 1
inv : p2548 + p2550 = 1
inv : p1306 + p1308 = 1
inv : p35 + p231 + p236 = 1
inv : p2025 + p2030 = 1
inv : p892 + p894 = 1
inv : p948 + p950 = 1
inv : p1071 + p1076 = 1
inv : p2683 + p2685 = 1
inv : p1899 + p1904 = 1
inv : p1538 + p1542 = 1
inv : p958 + p960 = 1
inv : p2259 + p2261 = 1
inv : p1786 + p1788 = 1
inv : p700 + p703 = 1
inv : p534 + p536 = 1
inv : p2331 + p2334 + p2335 = 1
inv : p2134 + p2136 = 1
inv : p1431 + p1433 = 1
inv : p1020 + p1023 + p1024 = 1
inv : p409 + p411 = 1
inv : p35 + p120 + p122 = 1
inv : p761 + p766 = 1
inv : p1147 + p1148 + p1158 + p1163 + p1164 = 1
inv : p1845 + p1847 = 1
inv : p1720 + p1722 = 1
inv : p1372 + p1374 = 1
inv : p1986 + p1989 + p1990 = 1
inv : p1572 + p1577 + p1578 = 1
inv : p1485 + p1490 = 1
inv : p1441 + p1443 = 1
inv : p35 + p319 + p330 + p335 + p336 = 1
inv : p1293 + p1295 = 1
inv : p1531 + p1535 = 1
inv : p1669 + p1673 = 1
inv : p1020 + p1025 + p1026 = 1
inv : p1237 + p1239 = 1
inv : p1382 + p1387 = 1
inv : p2262 + p2265 + p2266 = 1
inv : p35 + p123 + p128 + p129 = 1
inv : p1620 + p1628 = 1
inv : p1335 + p1340 = 1
inv : p1582 + p1584 = 1
inv : p1710 + p1713 + p1714 = 1
inv : p1865 + p1870 = 1
inv : p1048 + p1052 = 1
inv : p810 + p812 = 1
inv : p2065 + p2067 = 1
inv : p813 + p818 + p819 = 1
inv : p2193 + p2198 + p2199 = 1
inv : p35 + p319 + p358 + p362 = 1
inv : p2538 + p2543 + p2544 = 1
inv : p2773 + p2777 = 1
inv : p1002 + p1007 = 1
inv : p1968 + p1973 = 1
inv : p565 + p569 = 1
inv : p2203 + p2205 = 1
inv : p2083 + p2087 = 1
inv : p1776 + p1778 = 1
inv : p35 + p189 + p191 = 1
inv : p1818 + p1823 = 1
inv : p35 + p130 + p132 = 1
inv : p2497 + p2501 = 1
inv : p507 + p512 = 1
inv : p468 + p473 + p474 = 1
inv : p613 + p615 = 1
inv : p2693 + p2698 = 1
inv : p2589 + p2594 = 1
inv : p606 + p609 + p610 = 1
inv : p1365 + p1370 + p1371 = 1
inv : p2014 + p2018 = 1
inv : p35 + p319 + p327 + p329 = 1
inv : p2210 + p2215 = 1
inv : p692 + p697 = 1
inv : p813 + p816 + p817 = 1
inv : p751 + p753 = 1
inv : p2359 + p2363 = 1
inv : p2451 + p2456 = 1
inv : p841 + p845 = 1
inv : p35 + p133 + p135 = 1
inv : p603 + p605 = 1
inv : p412 + p416 = 1
inv : p465 + p467 = 1
inv : p2439 + p2444 = 1
inv : p35 + p71 + p76 = 1
inv : p1641 + p1646 + p1647 = 1
inv : p519 + p524 = 1
inv : p2604 + p2606 = 1
inv : p35 + p278 + p283 = 1
inv : p1830 + p1835 = 1
inv : p2607 + p2610 + p2611 = 1
inv : p1096 + p1098 = 1
inv : p1727 + p1732 = 1
inv : p35 + p40 + p42 = 1
inv : p1147 + p1148 + p1197 + p1202 = 1
inv : p2121 + p2123 = 1
inv : p2686 + p2688 = 1
inv : p2152 + p2156 = 1
inv : p754 + p756 = 1
inv : p1589 + p1594 = 1
inv : p1234 + p1236 = 1
inv : p1924 + p1926 = 1
inv : p1434 + p1437 + p1438 = 1
inv : p990 + p995 = 1
inv : p1983 + p1985 = 1
inv : p1917 + p1920 + p1921 = 1
inv : p1347 + p1352 = 1
inv : p1572 + p1575 + p1576 = 1
inv : p2094 + p2099 = 1
inv : p2301 + p2306 = 1
inv : p657 + p662 = 1
inv : p2545 + p2547 = 1
inv : p1089 + p1092 + p1093 = 1
inv : p35 + p220 + p224 = 1
inv : p899 + p904 = 1
inv : p537 + p542 + p543 = 1
inv : p468 + p471 + p472 = 1
inv : p864 + p869 = 1
inv : p2062 + p2064 = 1
inv : p1858 + p1860 = 1
inv : p2003 + p2008 = 1
inv : p910 + p914 = 1
inv : p1807 + p1811 = 1
inv : p1103 + p1111 = 1
inv : p672 + p674 = 1
inv : p2704 + p2708 = 1
inv : p2290 + p2294 = 1
inv : p616 + p618 = 1
inv : p573 + p576 + p579 + p581 = 1
inv : p1227 + p1230 + p1231 = 1
inv : p2784 + p2789 = 1
inv : p427 + p431 = 1
inv : p35 + p140 + p145 = 1
inv : p1444 + p1446 = 1
inv : p1761 + p1766 = 1
inv : p2193 + p2196 + p2197 = 1
inv : p2508 + p2513 = 1
inv : p35 + p268 + p270 = 1
inv : p1324 + p1328 = 1
inv : p1848 + p1853 + p1854 = 1
inv : p1638 + p1640 = 1
inv : p1503 + p1508 + p1509 = 1
inv : p446 + p450 = 1
inv : p1680 + p1685 = 1
inv : p35 + p209 + p214 = 1
inv : p35 + p93 + p98 = 1
inv : p2175 + p2180 = 1
inv : p1278 + p1283 = 1
inv : p2535 + p2537 = 1
inv : p2607 + p2612 + p2613 = 1
inv : p1927 + p1929 = 1
inv : p1296 + p1301 + p1302 = 1
inv : p1579 + p1581 = 1
inv : p1520 + p1525 = 1
inv : p1876 + p1880 = 1
inv : p2341 + p2343 = 1
inv : p1993 + p1995 = 1
inv : p951 + p956 + p957 = 1
inv : p2262 + p2267 + p2268 = 1
inv : p35 + p123 + p126 + p127 = 1
inv : p35 + p319 + p369 + p374 = 1
inv : p1692 + p1697 = 1
inv : p1147 + p1148 + p1165 + p1167 = 1
inv : p882 + p887 + p888 = 1
inv : p2163 + p2168 = 1
inv : p1266 + p1271 = 1
inv : p554 + p559 = 1
inv : p35 + p192 + p195 + p196 = 1
inv : p1848 + p1851 + p1852 = 1
inv : p35 + p271 + p273 = 1
inv : p1147 + p1148 + p1209 + p1214 = 1
inv : p2538 + p2541 + p2542 = 1
inv : p1917 + p1922 + p1923 = 1
inv : p2635 + p2639 = 1
inv : p1513 + p1515 = 1
inv : p2392 + p2393 + p2407 + p2409 = 1
inv : p606 + p611 + p612 = 1
inv : p2646 + p2651 = 1
inv : p2392 + p2393 + p2397 + p2399 = 1
inv : p882 + p885 + p886 = 1
inv : p2221 + p2225 = 1
inv : p979 + p983 = 1
inv : p1934 + p1939 = 1
inv : p35 + p192 + p197 + p198 = 1
inv : p35 + p319 + p330 + p333 + p334 = 1
inv : p496 + p500 = 1
inv : p852 + p857 = 1
inv : p2577 + p2582 = 1
inv : p1749 + p1754 = 1
inv : p1147 + p1148 + p1155 + p1157 = 1
inv : p537 + p540 + p541 = 1
inv : p741 + p743 = 1
inv : p2466 + p2468 = 1
inv : p2348 + p2353 = 1
inv : p1996 + p1998 = 1
inv : p1099 + p1101 = 1
inv : p682 + p684 = 1
inv : p1451 + p1456 = 1
inv : p35 + p82 + p86 = 1
inv : p1037 + p1042 = 1
inv : p1393 + p1397 = 1
inv : p2796 + p2801 = 1
inv : p438 + p443 = 1
inv : p795 + p800 = 1
Total of 358 invariants.
[2020-05-27 13:27:16] [INFO ] Computed 358 place invariants in 31 ms
[2020-05-27 13:27:17] [INFO ] Removed a total of 809 redundant transitions.
[2020-05-27 13:27:17] [INFO ] Flatten gal took : 260 ms
[2020-05-27 13:27:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 24 ms.
[2020-05-27 13:27:17] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 16 ms
[2020-05-27 13:27:17] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.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/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]

[2020-05-27 13:27:17] [INFO ] Ran tautology test, simplified 0 / 1 in 996 ms.
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/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [invariant] property : ShieldIIPt-PT-040B-ReachabilityFireability-09 with value :((((i4.u62.p579!=1)||(i21.u268.p2393!=1))||(i2.u33.p319!=1))||(((((i18.u232.p2064==1)&&(i18.u234.p2077==1))&&(i18.u235.p2111==1))&&(i24.u304.p2725==1))&&((i13.u179.p1613==1)||(i10.u125.p1148==1))))
built 25 ordering constraints for composite.
built 17 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 11 ordering constraints for composite.
built 32 ordering constraints for composite.
built 19 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 17 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 17 ordering constraints for composite.
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
[2020-05-27 13:27:17] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(UNSAT) depth K=0 took 8 ms
[2020-05-27 13:27:17] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(UNSAT) depth K=1 took 5 ms
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 754 rows 768 cols
[2020-05-27 13:27:17] [INFO ] Computed 358 place invariants in 2 ms
inv : p35 + p151 + p155 = 1
inv : p1503 + p1506 + p1507 = 1
inv : p2566 + p2570 = 1
inv : p396 + p398 = 1
inv : p35 + p105 + p110 = 1
inv : p2382 + p2387 = 1
inv : p35 + p258 + p260 = 1
inv : p2520 + p2525 = 1
inv : p2055 + p2058 + p2059 = 1
inv : p2673 + p2675 = 1
inv : p1147 + p1148 + p1175 + p1180 = 1
inv : p2715 + p2720 = 1
inv : p35 + p202 + p204 = 1
inv : p485 + p490 = 1
inv : p2279 + p2284 = 1
inv : p35 + p61 + p63 = 1
inv : p623 + p628 = 1
inv : p1227 + p1232 + p1233 = 1
inv : p2190 + p2192 = 1
inv : p2724 + p2725 + p2732 = 1
inv : p951 + p954 + p955 = 1
inv : p2392 + p2393 + p2410 + p2412 = 1
inv : p2338 + p2340 = 1
inv : p544 + p546 = 1
inv : p823 + p825 = 1
inv : p35 + p300 + p305 = 1
inv : p879 + p881 = 1
inv : p2676 + p2679 + p2680 = 1
inv : p35 + p319 + p340 + p342 = 1
inv : p399 + p402 + p403 = 1
inv : p675 + p680 + p681 = 1
inv : p2617 + p2619 = 1
inv : p1855 + p1857 = 1
inv : p35 + p261 + p264 + p265 = 1
inv : p744 + p747 + p748 = 1
inv : p2124 + p2127 + p2128 = 1
inv : p1027 + p1029 = 1
inv : p2469 + p2472 + p2473 = 1
inv : p772 + p776 = 1
inv : p921 + p926 = 1
inv : p726 + p731 = 1
inv : p35 + p54 + p57 + p58 = 1
inv : p2331 + p2336 + p2337 = 1
inv : p1362 + p1364 = 1
inv : p1462 + p1466 = 1
inv : p2742 + p2744 = 1
inv : p2232 + p2237 = 1
inv : p2052 + p2054 = 1
inv : p2392 + p2393 + p2400 + p2403 + p2404 = 1
inv : p1416 + p1421 = 1
inv : p1554 + p1559 = 1
inv : p1651 + p1653 = 1
inv : p1779 + p1784 + p1785 = 1
inv : p968 + p973 = 1
inv : p2476 + p2478 = 1
inv : p1224 + p1226 = 1
inv : p1738 + p1742 = 1
inv : p1789 + p1791 = 1
inv : p1648 + p1650 = 1
inv : p35 + p261 + p266 + p267 = 1
inv : p1086 + p1088 = 1
inv : p1887 + p1892 = 1
inv : p1030 + p1032 = 1
inv : p1313 + p1318 = 1
inv : p2124 + p2129 + p2130 = 1
inv : p2037 + p2042 = 1
inv : p2102 + p2106 + p2111 = 1
inv : p2131 + p2133 = 1
inv : p783 + p788 = 1
inv : p1569 + p1571 = 1
inv : p1986 + p1991 + p1992 = 1
inv : p685 + p687 = 1
inv : p1608 + p1611 + p1613 + p1616 = 1
inv : p2392 + p2428 + p2432 = 1
inv : p1117 + p1121 = 1
inv : p2745 + p2750 = 1
inv : p1296 + p1299 + p1300 = 1
inv : p1404 + p1409 = 1
inv : p2621 + p2629 = 1
inv : p547 + p549 = 1
inv : p1796 + p1801 = 1
inv : p1779 + p1782 + p1783 = 1
inv : p35 + p312 + p317 = 1
inv : p2272 + p2274 = 1
inv : p2479 + p2481 = 1
inv : p1707 + p1709 = 1
inv : p35 + p162 + p167 = 1
inv : p1147 + p1148 + p1168 + p1170 = 1
inv : p2392 + p2393 + p2400 + p2405 + p2406 = 1
inv : p35 + p319 + p347 + p352 = 1
inv : p1510 + p1512 = 1
inv : p35 + p199 + p201 = 1
inv : p933 + p938 = 1
inv : p1945 + p1949 = 1
inv : p35 + p319 + p381 + p386 = 1
inv : p1255 + p1259 = 1
inv : p2658 + p2663 = 1
inv : p961 + p963 = 1
inv : p1956 + p1961 = 1
inv : p1059 + p1064 = 1
inv : p675 + p678 + p679 = 1
inv : p744 + p749 + p750 = 1
inv : p820 + p822 = 1
inv : p2245 + p2249 = 1
inv : p35 + p54 + p59 + p60 = 1
inv : p1244 + p1249 = 1
inv : p1658 + p1663 = 1
inv : p1089 + p1094 + p1095 = 1
inv : p1717 + p1719 = 1
inv : p2200 + p2202 = 1
inv : p714 + p719 = 1
inv : p1473 + p1478 = 1
inv : p1017 + p1019 = 1
inv : p2469 + p2474 + p2475 = 1
inv : p406 + p408 = 1
inv : p2055 + p2060 + p2061 = 1
inv : p2370 + p2375 = 1
inv : p35 + p51 + p53 = 1
inv : p588 + p593 = 1
inv : p634 + p638 = 1
inv : p1375 + p1377 = 1
inv : p35 + p64 + p66 = 1
inv : p1140 + p1145 = 1
inv : p35 + p319 + p337 + p339 = 1
inv : p1500 + p1502 = 1
inv : p1710 + p1715 + p1716 = 1
inv : p2555 + p2560 = 1
inv : p2328 + p2330 = 1
inv : p1641 + p1644 + p1645 = 1
inv : p1147 + p1148 + p1158 + p1161 + p1162 = 1
inv : p35 + p243 + p248 = 1
inv : p1147 + p1148 + p1186 + p1190 = 1
inv : p1303 + p1305 = 1
inv : p830 + p835 = 1
inv : p35 + p289 + p293 = 1
inv : p2676 + p2681 + p2682 = 1
inv : p399 + p404 + p405 = 1
inv : p2614 + p2616 = 1
inv : p2141 + p2146 = 1
inv : p2068 + p2072 + p2077 = 1
inv : p478 + p480 = 1
inv : p2392 + p2393 + p2417 + p2422 = 1
inv : p1914 + p1916 = 1
inv : p2269 + p2271 = 1
inv : p645 + p650 = 1
inv : p2752 + p2754 = 1
inv : p1128 + p1133 = 1
inv : p2313 + p2318 = 1
inv : p1365 + p1368 + p1369 = 1
inv : p1434 + p1439 + p1440 = 1
inv : p1600 + p1604 = 1
inv : p35 + p174 + p179 = 1
inv : p889 + p891 = 1
inv : p2486 + p2491 = 1
inv : p475 + p477 = 1
inv : p2548 + p2550 = 1
inv : p1306 + p1308 = 1
inv : p35 + p231 + p236 = 1
inv : p2025 + p2030 = 1
inv : p892 + p894 = 1
inv : p948 + p950 = 1
inv : p1071 + p1076 = 1
inv : p2683 + p2685 = 1
inv : p1899 + p1904 = 1
inv : p1538 + p1542 = 1
inv : p958 + p960 = 1
inv : p2259 + p2261 = 1
inv : p1786 + p1788 = 1
inv : p700 + p703 = 1
inv : p534 + p536 = 1
inv : p2331 + p2334 + p2335 = 1
inv : p2134 + p2136 = 1
inv : p1431 + p1433 = 1
inv : p1020 + p1023 + p1024 = 1
inv : p409 + p411 = 1
inv : p35 + p120 + p122 = 1
inv : p761 + p766 = 1
inv : p1147 + p1148 + p1158 + p1163 + p1164 = 1
inv : p1845 + p1847 = 1
inv : p1720 + p1722 = 1
inv : p1372 + p1374 = 1
inv : p1986 + p1989 + p1990 = 1
inv : p1572 + p1577 + p1578 = 1
inv : p1485 + p1490 = 1
inv : p1441 + p1443 = 1
inv : p35 + p319 + p330 + p335 + p336 = 1
inv : p1293 + p1295 = 1
inv : p1531 + p1535 = 1
inv : p1669 + p1673 = 1
inv : p1020 + p1025 + p1026 = 1
inv : p1237 + p1239 = 1
inv : p1382 + p1387 = 1
inv : p2262 + p2265 + p2266 = 1
inv : p35 + p123 + p128 + p129 = 1
inv : p1620 + p1628 = 1
inv : p1335 + p1340 = 1
inv : p1582 + p1584 = 1
inv : p1710 + p1713 + p1714 = 1
inv : p1865 + p1870 = 1
inv : p1048 + p1052 = 1
inv : p810 + p812 = 1
inv : p2065 + p2067 = 1
inv : p813 + p818 + p819 = 1
inv : p2193 + p2198 + p2199 = 1
inv : p35 + p319 + p358 + p362 = 1
inv : p2538 + p2543 + p2544 = 1
inv : p2773 + p2777 = 1
inv : p1002 + p1007 = 1
inv : p1968 + p1973 = 1
inv : p565 + p569 = 1
inv : p2203 + p2205 = 1
inv : p2083 + p2087 = 1
inv : p1776 + p1778 = 1
inv : p35 + p189 + p191 = 1
inv : p1818 + p1823 = 1
inv : p35 + p130 + p132 = 1
inv : p2497 + p2501 = 1
inv : p507 + p512 = 1
inv : p468 + p473 + p474 = 1
inv : p613 + p615 = 1
inv : p2693 + p2698 = 1
inv : p2589 + p2594 = 1
inv : p606 + p609 + p610 = 1
inv : p1365 + p1370 + p1371 = 1
inv : p2014 + p2018 = 1
inv : p35 + p319 + p327 + p329 = 1
inv : p2210 + p2215 = 1
inv : p692 + p697 = 1
inv : p813 + p816 + p817 = 1
inv : p751 + p753 = 1
inv : p2359 + p2363 = 1
inv : p2451 + p2456 = 1
inv : p841 + p845 = 1
inv : p35 + p133 + p135 = 1
inv : p603 + p605 = 1
inv : p412 + p416 = 1
inv : p465 + p467 = 1
inv : p2439 + p2444 = 1
inv : p35 + p71 + p76 = 1
inv : p1641 + p1646 + p1647 = 1
inv : p519 + p524 = 1
inv : p2604 + p2606 = 1
inv : p35 + p278 + p283 = 1
inv : p1830 + p1835 = 1
inv : p2607 + p2610 + p2611 = 1
inv : p1096 + p1098 = 1
inv : p1727 + p1732 = 1
inv : p35 + p40 + p42 = 1
inv : p1147 + p1148 + p1197 + p1202 = 1
inv : p2121 + p2123 = 1
inv : p2686 + p2688 = 1
inv : p2152 + p2156 = 1
inv : p754 + p756 = 1
inv : p1589 + p1594 = 1
inv : p1234 + p1236 = 1
inv : p1924 + p1926 = 1
inv : p1434 + p1437 + p1438 = 1
inv : p990 + p995 = 1
inv : p1983 + p1985 = 1
inv : p1917 + p1920 + p1921 = 1
inv : p1347 + p1352 = 1
inv : p1572 + p1575 + p1576 = 1
inv : p2094 + p2099 = 1
inv : p2301 + p2306 = 1
inv : p657 + p662 = 1
inv : p2545 + p2547 = 1
inv : p1089 + p1092 + p1093 = 1
inv : p35 + p220 + p224 = 1
inv : p899 + p904 = 1
inv : p537 + p542 + p543 = 1
inv : p468 + p471 + p472 = 1
inv : p864 + p869 = 1
inv : p2062 + p2064 = 1
inv : p1858 + p1860 = 1
inv : p2003 + p2008 = 1
inv : p910 + p914 = 1
inv : p1807 + p1811 = 1
inv : p1103 + p1111 = 1
inv : p672 + p674 = 1
inv : p2704 + p2708 = 1
inv : p2290 + p2294 = 1
inv : p616 + p618 = 1
inv : p573 + p576 + p579 + p581 = 1
inv : p1227 + p1230 + p1231 = 1
inv : p2784 + p2789 = 1
inv : p427 + p431 = 1
inv : p35 + p140 + p145 = 1
inv : p1444 + p1446 = 1
inv : p1761 + p1766 = 1
inv : p2193 + p2196 + p2197 = 1
inv : p2508 + p2513 = 1
inv : p35 + p268 + p270 = 1
inv : p1324 + p1328 = 1
inv : p1848 + p1853 + p1854 = 1
inv : p1638 + p1640 = 1
inv : p1503 + p1508 + p1509 = 1
inv : p446 + p450 = 1
inv : p1680 + p1685 = 1
inv : p35 + p209 + p214 = 1
inv : p35 + p93 + p98 = 1
inv : p2175 + p2180 = 1
inv : p1278 + p1283 = 1
inv : p2535 + p2537 = 1
inv : p2607 + p2612 + p2613 = 1
inv : p1927 + p1929 = 1
inv : p1296 + p1301 + p1302 = 1
inv : p1579 + p1581 = 1
inv : p1520 + p1525 = 1
inv : p1876 + p1880 = 1
inv : p2341 + p2343 = 1
inv : p1993 + p1995 = 1
inv : p951 + p956 + p957 = 1
inv : p2262 + p2267 + p2268 = 1
inv : p35 + p123 + p126 + p127 = 1
inv : p35 + p319 + p369 + p374 = 1
inv : p1692 + p1697 = 1
inv : p1147 + p1148 + p1165 + p1167 = 1
inv : p882 + p887 + p888 = 1
inv : p2163 + p2168 = 1
inv : p1266 + p1271 = 1
inv : p554 + p559 = 1
inv : p35 + p192 + p195 + p196 = 1
inv : p1848 + p1851 + p1852 = 1
inv : p35 + p271 + p273 = 1
inv : p1147 + p1148 + p1209 + p1214 = 1
inv : p2538 + p2541 + p2542 = 1
inv : p1917 + p1922 + p1923 = 1
inv : p2635 + p2639 = 1
inv : p1513 + p1515 = 1
inv : p2392 + p2393 + p2407 + p2409 = 1
inv : p606 + p611 + p612 = 1
inv : p2646 + p2651 = 1
inv : p2392 + p2393 + p2397 + p2399 = 1
inv : p882 + p885 + p886 = 1
inv : p2221 + p2225 = 1
inv : p979 + p983 = 1
inv : p1934 + p1939 = 1
inv : p35 + p192 + p197 + p198 = 1
inv : p35 + p319 + p330 + p333 + p334 = 1
inv : p496 + p500 = 1
inv : p852 + p857 = 1
inv : p2577 + p2582 = 1
inv : p1749 + p1754 = 1
inv : p1147 + p1148 + p1155 + p1157 = 1
inv : p537 + p540 + p541 = 1
inv : p741 + p743 = 1
inv : p2466 + p2468 = 1
inv : p2348 + p2353 = 1
inv : p1996 + p1998 = 1
inv : p1099 + p1101 = 1
inv : p682 + p684 = 1
inv : p1451 + p1456 = 1
inv : p35 + p82 + p86 = 1
inv : p1037 + p1042 = 1
inv : p1393 + p1397 = 1
inv : p2796 + p2801 = 1
inv : p438 + p443 = 1
inv : p795 + p800 = 1
Total of 358 invariants.
[2020-05-27 13:27:17] [INFO ] Computed 358 place invariants in 25 ms
[2020-05-27 13:27:18] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(UNSAT) depth K=2 took 614 ms
SDD proceeding with computation, new max is 8192
[2020-05-27 13:27:19] [INFO ] Proved 768 variables to be positive in 2527 ms
[2020-05-27 13:27:19] [INFO ] Computing symmetric may disable matrix : 754 transitions.
[2020-05-27 13:27:19] [INFO ] Computation of disable matrix completed :0/754 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 13:27:19] [INFO ] Computation of Complete disable matrix. took 128 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 13:27:19] [INFO ] Computing symmetric may enable matrix : 754 transitions.
[2020-05-27 13:27:19] [INFO ] Computation of Complete enable matrix. took 85 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 13:27:20] [INFO ] Computing symmetric co enabling matrix : 754 transitions.
SDD proceeding with computation, new max is 16384
[2020-05-27 13:27:20] [INFO ] Proved 768 variables to be positive in 3059 ms
[2020-05-27 13:27:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-09
[2020-05-27 13:27:21] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(SAT) depth K=0 took 124 ms
[2020-05-27 13:27:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-09
[2020-05-27 13:27:21] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(SAT) depth K=1 took 221 ms
[2020-05-27 13:27:22] [INFO ] Computation of co-enabling matrix(91/754) took 2422 ms. Total solver calls (SAT/UNSAT): 663(21/642)
[2020-05-27 13:27:25] [INFO ] Computation of co-enabling matrix(154/754) took 5448 ms. Total solver calls (SAT/UNSAT): 1083(33/1050)
[2020-05-27 13:27:28] [INFO ] Computation of co-enabling matrix(206/754) took 8520 ms. Total solver calls (SAT/UNSAT): 1424(42/1382)
SDD proceeding with computation, new max is 32768
[2020-05-27 13:27:31] [INFO ] Computation of co-enabling matrix(247/754) took 11548 ms. Total solver calls (SAT/UNSAT): 1694(49/1645)
[2020-05-27 13:27:34] [INFO ] Computation of co-enabling matrix(293/754) took 14564 ms. Total solver calls (SAT/UNSAT): 1939(232/1707)
[2020-05-27 13:27:37] [INFO ] Computation of co-enabling matrix(346/754) took 17612 ms. Total solver calls (SAT/UNSAT): 2167(427/1740)
SDD proceeding with computation, new max is 65536
[2020-05-27 13:27:40] [INFO ] Computation of co-enabling matrix(405/754) took 20620 ms. Total solver calls (SAT/UNSAT): 2411(652/1759)
[2020-05-27 13:27:43] [INFO ] Computation of co-enabling matrix(464/754) took 23660 ms. Total solver calls (SAT/UNSAT): 2663(878/1785)
[2020-05-27 13:27:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-09
[2020-05-27 13:27:46] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(SAT) depth K=2 took 24791 ms
[2020-05-27 13:27:46] [INFO ] Computation of co-enabling matrix(524/754) took 26708 ms. Total solver calls (SAT/UNSAT): 2930(1116/1814)
[2020-05-27 13:27:50] [INFO ] Computation of co-enabling matrix(603/754) took 29739 ms. Total solver calls (SAT/UNSAT): 3276(1427/1849)
[2020-05-27 13:27:53] [INFO ] Computation of co-enabling matrix(710/754) took 32744 ms. Total solver calls (SAT/UNSAT): 3517(1623/1894)
[2020-05-27 13:27:54] [INFO ] Computation of Finished co-enabling matrix. took 34307 ms. Total solver calls (SAT/UNSAT): 3630(1730/1900)
[2020-05-27 13:27:54] [INFO ] Computing Do-Not-Accords matrix : 754 transitions.
[2020-05-27 13:27:54] [INFO ] Computation of Completed DNA matrix. took 182 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 13:27:55] [INFO ] Built C files in 38971ms 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]
[2020-05-27 13:27:58] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(UNSAT) depth K=3 took 40248 ms
Compilation finished in 15648 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 149 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPtPT040BReachabilityFireability09==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPtPT040BReachabilityFireability09==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPtPT040BReachabilityFireability09==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
SDD proceeding with computation, new max is 131072
[2020-05-27 13:29:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-09
[2020-05-27 13:29:18] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(SAT) depth K=3 took 92136 ms
[2020-05-27 13:30:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-09
[2020-05-27 13:30:11] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(SAT) depth K=4 took 53072 ms
SDD proceeding with computation, new max is 262144
[2020-05-27 13:31:17] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(UNSAT) depth K=4 took 199024 ms
SDD proceeding with computation, new max is 524288
[2020-05-27 13:41:34] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(UNSAT) depth K=5 took 616772 ms
[2020-05-27 13:41:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-09
[2020-05-27 13:41:44] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(SAT) depth K=5 took 693292 ms
Detected timeout of ITS tools.
[2020-05-27 13:49:00] [INFO ] Applying decomposition
[2020-05-27 13:49:01] [INFO ] Flatten gal took : 161 ms
[2020-05-27 13:49:01] [INFO ] Decomposing Gal with order
[2020-05-27 13:49:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 13:49:01] [INFO ] Removed a total of 898 redundant transitions.
[2020-05-27 13:49:01] [INFO ] Flatten gal took : 222 ms
[2020-05-27 13:49:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 114 ms.
[2020-05-27 13:49:01] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 56 ms
[2020-05-27 13:49:01] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 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/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], 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/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [invariant] property : ShieldIIPt-PT-040B-ReachabilityFireability-09 with value :((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u175.p579!=1)||(i0.i0.i0.i0.i0.i1.i0.i0.i0.u742.p2393!=1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u884.p319!=1))||(((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u545.p2064==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u547.p2077==1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u550.p2111==1))&&(i0.i1.u703.p2725==1))&&((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u430.p1613==1)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u853.p1148==1))))
built 1 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 17 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 36 ordering constraints for composite.
built 28 ordering constraints for composite.
built 20 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
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
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
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\_flat,2.03446e+13,22.7667,366892,257,11,565475,36,810,3.04997e+06,39,36,0
Total reachable state count : 20344605769728

Verifying 1 reachability properties.
Invariant property ShieldIIPt-PT-040B-ReachabilityFireability-09 is true.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-040B-ReachabilityFireability-09,0,22.7809,366892,1,0,565475,36,1037,3.04997e+06,43,36,141
[2020-05-27 13:49:24] [WARNING] Interrupting SMT solver.
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.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-27 13:49:24] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldIIPt-PT-040B-ReachabilityFireability-09 SMT depth 6
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.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 "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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-27 13:49:24] [INFO ] During BMC, SMT solver timed out at depth 6
[2020-05-27 13:49:24] [INFO ] BMC solving timed out (3600000 secs) at depth 6
[2020-05-27 13:49:24] [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.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-27 13:49:24] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldIIPt-PT-040B-ReachabilityFireability-09 K-induction depth 6
Exception in thread "Thread-7" 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.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 "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.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
[2020-05-27 13:49:24] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.

BK_STOP 1590587365328

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="ShieldIIPt-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPt-PT-040B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-tajo-159033475600359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;