MCC'2020 - Execution of r066-tajo-158922814800775

About the Execution of ITS-Tools for DoubleExponent-PT-004

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15742.220	3600000.00	10403870.00	5249.10	TTFT?T??FFFTFTFF	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814800775.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 DoubleExponent-PT-004, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814800775
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.6K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 67K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-00
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-01
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-02
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-03
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-04
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-05
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-06
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-07
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-08
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-09
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-10
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-11
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-12
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-13
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-14
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590135253959

[2020-05-22 08:14:15] [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-22 08:14:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 08:14:15] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2020-05-22 08:14:15] [INFO ] Transformed 216 places.
[2020-05-22 08:14:15] [INFO ] Transformed 198 transitions.
[2020-05-22 08:14:15] [INFO ] Parsed PT model containing 216 places and 198 transitions in 75 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 320 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 288 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probably explored full state space saw : 553820 states, properties seen :[0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0]
Probabilistic random walk after 1107687 steps, saw 553820 distinct states, run finished after 3452 ms. (steps per millisecond=320 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0]
FORMULA DoubleExponent-PT-004-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Interrupted probabilistic random walk after 9474997 steps, run timeout after 30001 ms. (steps per millisecond=315 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
Exhaustive walk after 9474997 steps, saw 4737202 distinct states, run finished after 30001 ms. (steps per millisecond=315 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA DoubleExponent-PT-004-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
// Phase 1: matrix 198 rows 216 cols
[2020-05-22 08:14:49] [INFO ] Computed 24 place invariants in 28 ms
[2020-05-22 08:14:49] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-05-22 08:14:49] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2020-05-22 08:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:14:50] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2020-05-22 08:14:50] [INFO ] Deduced a trap composed of 16 places in 164 ms
[2020-05-22 08:14:50] [INFO ] Deduced a trap composed of 54 places in 153 ms
[2020-05-22 08:14:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 372 ms
[2020-05-22 08:14:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:14:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 59 ms returned sat
[2020-05-22 08:14:50] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 141 ms returned sat
[2020-05-22 08:14:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:14:50] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2020-05-22 08:14:51] [INFO ] Deduced a trap composed of 16 places in 86 ms
[2020-05-22 08:14:51] [INFO ] Deduced a trap composed of 54 places in 42 ms
[2020-05-22 08:14:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2020-05-22 08:14:51] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2020-05-22 08:14:52] [INFO ] Added : 193 causal constraints over 39 iterations in 947 ms. Result :sat
[2020-05-22 08:14:52] [INFO ] Deduced a trap composed of 68 places in 148 ms
[2020-05-22 08:14:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-05-22 08:14:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-22 08:14:52] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 22 ms returned sat
[2020-05-22 08:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:14:52] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2020-05-22 08:14:52] [INFO ] Deduced a trap composed of 54 places in 119 ms
[2020-05-22 08:14:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2020-05-22 08:14:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:14:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-05-22 08:14:52] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 20 ms returned sat
[2020-05-22 08:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:14:53] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2020-05-22 08:14:53] [INFO ] Deduced a trap composed of 54 places in 68 ms
[2020-05-22 08:14:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2020-05-22 08:14:53] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 94 ms.
[2020-05-22 08:14:54] [INFO ] Added : 195 causal constraints over 40 iterations in 841 ms. Result :sat
[2020-05-22 08:14:54] [INFO ] Deduced a trap composed of 40 places in 86 ms
[2020-05-22 08:14:54] [INFO ] Deduced a trap composed of 43 places in 108 ms
[2020-05-22 08:14:54] [INFO ] Deduced a trap composed of 24 places in 81 ms
[2020-05-22 08:14:54] [INFO ] Deduced a trap composed of 25 places in 282 ms
[2020-05-22 08:14:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 669 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-05-22 08:14:54] [INFO ] [Real]Absence check using 3 positive place invariants in 23 ms returned unsat
[2020-05-22 08:14:54] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:14:55] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2020-05-22 08:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:14:55] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2020-05-22 08:14:55] [INFO ] Deduced a trap composed of 52 places in 20 ms
[2020-05-22 08:14:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2020-05-22 08:14:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:14:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:14:55] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 19 ms returned sat
[2020-05-22 08:14:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:14:55] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2020-05-22 08:14:55] [INFO ] Deduced a trap composed of 52 places in 22 ms
[2020-05-22 08:14:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2020-05-22 08:14:55] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2020-05-22 08:14:56] [INFO ] Added : 194 causal constraints over 39 iterations in 524 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-05-22 08:14:56] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:14:56] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2020-05-22 08:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:14:56] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2020-05-22 08:14:56] [INFO ] Deduced a trap composed of 16 places in 103 ms
[2020-05-22 08:14:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2020-05-22 08:14:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:14:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:14:56] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2020-05-22 08:14:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:14:56] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-05-22 08:14:56] [INFO ] Deduced a trap composed of 54 places in 36 ms
[2020-05-22 08:14:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2020-05-22 08:14:56] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 17 ms.
[2020-05-22 08:14:57] [INFO ] Added : 193 causal constraints over 39 iterations in 584 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2020-05-22 08:14:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-05-22 08:14:57] [INFO ] [Real]Absence check using 3 positive place invariants in 26 ms returned unsat
[2020-05-22 08:14:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-05-22 08:14:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
FORMULA DoubleExponent-PT-004-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 228700 steps, including 8155 resets, run finished after 439 ms. (steps per millisecond=520 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 222000 steps, including 7925 resets, run finished after 238 ms. (steps per millisecond=932 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 296200 steps, including 10691 resets, run finished after 231 ms. (steps per millisecond=1282 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 184600 steps, including 6600 resets, run finished after 186 ms. (steps per millisecond=992 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 14 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 198/198 transitions.
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 360 edges and 216 vertex of which 210 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 209 transition count 155
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 86 place count 168 transition count 155
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 86 place count 168 transition count 147
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 102 place count 160 transition count 147
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 174 place count 124 transition count 111
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 184 place count 119 transition count 111
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 192 place count 119 transition count 103
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 200 place count 111 transition count 103
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 215 place count 111 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 216 place count 110 transition count 102
Applied a total of 216 rules in 116 ms. Remains 110 /216 variables (removed 106) and now considering 102/198 (removed 96) transitions.
Finished structural reductions, in 1 iterations. Remains : 110/216 places, 102/198 transitions.
Incomplete random walk after 1000000 steps, including 92638 resets, run finished after 1097 ms. (steps per millisecond=911 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 67418 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 67802 resets, run finished after 623 ms. (steps per millisecond=1605 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 67363 resets, run finished after 531 ms. (steps per millisecond=1883 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 67405 resets, run finished after 628 ms. (steps per millisecond=1592 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 13177027 steps, run timeout after 30001 ms. (steps per millisecond=439 ) properties seen :[1, 0, 0, 0]
Probabilistic random walk after 13177027 steps, saw 6585674 distinct states, run finished after 30001 ms. (steps per millisecond=439 ) properties seen :[1, 0, 0, 0]
FORMULA DoubleExponent-PT-004-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 102 rows 110 cols
[2020-05-22 08:15:32] [INFO ] Computed 20 place invariants in 3 ms
[2020-05-22 08:15:32] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-05-22 08:15:32] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 8 ms returned sat
[2020-05-22 08:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:15:32] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2020-05-22 08:15:32] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-05-22 08:15:32] [INFO ] [Real]Added 11 Read/Feed constraints in 2 ms returned sat
[2020-05-22 08:15:32] [INFO ] Deduced a trap composed of 7 places in 34 ms
[2020-05-22 08:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2020-05-22 08:15:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:15:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 28 ms returned sat
[2020-05-22 08:15:32] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 31 ms returned sat
[2020-05-22 08:15:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:15:32] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2020-05-22 08:15:32] [INFO ] [Nat]Added 11 Read/Feed constraints in 4 ms returned sat
[2020-05-22 08:15:32] [INFO ] Deduced a trap composed of 7 places in 36 ms
[2020-05-22 08:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2020-05-22 08:15:32] [INFO ] Computed and/alt/rep : 101/447/101 causal constraints in 5 ms.
[2020-05-22 08:15:32] [INFO ] Added : 101 causal constraints over 21 iterations in 266 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-05-22 08:15:32] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-05-22 08:15:32] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-22 08:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:15:32] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-05-22 08:15:32] [INFO ] [Real]Added 11 Read/Feed constraints in 2 ms returned sat
[2020-05-22 08:15:32] [INFO ] Deduced a trap composed of 16 places in 26 ms
[2020-05-22 08:15:32] [INFO ] Deduced a trap composed of 5 places in 34 ms
[2020-05-22 08:15:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2020-05-22 08:15:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:15:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-05-22 08:15:33] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 4 ms returned sat
[2020-05-22 08:15:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:15:33] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2020-05-22 08:15:33] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2020-05-22 08:15:33] [INFO ] Deduced a trap composed of 5 places in 37 ms
[2020-05-22 08:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2020-05-22 08:15:33] [INFO ] Computed and/alt/rep : 101/447/101 causal constraints in 8 ms.
[2020-05-22 08:15:33] [INFO ] Added : 99 causal constraints over 20 iterations in 233 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-05-22 08:15:33] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-05-22 08:15:33] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 10 ms returned sat
[2020-05-22 08:15:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:15:33] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-05-22 08:15:33] [INFO ] [Real]Added 11 Read/Feed constraints in 2 ms returned sat
[2020-05-22 08:15:33] [INFO ] Deduced a trap composed of 10 places in 22 ms
[2020-05-22 08:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2020-05-22 08:15:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:15:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-05-22 08:15:33] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 6 ms returned sat
[2020-05-22 08:15:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:15:33] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2020-05-22 08:15:33] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2020-05-22 08:15:33] [INFO ] Deduced a trap composed of 10 places in 33 ms
[2020-05-22 08:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2020-05-22 08:15:33] [INFO ] Computed and/alt/rep : 101/447/101 causal constraints in 5 ms.
[2020-05-22 08:15:33] [INFO ] Added : 98 causal constraints over 20 iterations in 182 ms. Result :sat
[2020-05-22 08:15:33] [INFO ] Deduced a trap composed of 10 places in 23 ms
[2020-05-22 08:15:33] [INFO ] Deduced a trap composed of 13 places in 25 ms
[2020-05-22 08:15:33] [INFO ] Deduced a trap composed of 17 places in 24 ms
[2020-05-22 08:15:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 102 ms
Attempting to minimize the solution found.
Minimization took 4 ms.
Incomplete Parikh walk after 130700 steps, including 14127 resets, run finished after 101 ms. (steps per millisecond=1294 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 96800 steps, including 10521 resets, run finished after 75 ms. (steps per millisecond=1290 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 164800 steps, including 17777 resets, run finished after 125 ms. (steps per millisecond=1318 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 12 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 102/102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 101
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 99
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 99
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 107 transition count 99
Applied a total of 7 rules in 12 ms. Remains 107 /110 variables (removed 3) and now considering 99/102 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/110 places, 99/102 transitions.
Incomplete random walk after 1000000 steps, including 92519 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 67824 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 67322 resets, run finished after 516 ms. (steps per millisecond=1937 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 67813 resets, run finished after 557 ms. (steps per millisecond=1795 ) properties seen :[0, 0, 0]
Probably explored full state space saw : 1128969 states, properties seen :[0, 0, 0]
Probabilistic random walk after 2258074 steps, saw 1128969 distinct states, run finished after 4568 ms. (steps per millisecond=494 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 12211507 steps, run timeout after 30001 ms. (steps per millisecond=407 ) properties seen :[0, 0, 0]
Exhaustive walk after 12211507 steps, saw 6105695 distinct states, run finished after 30001 ms. (steps per millisecond=407 ) properties seen :[0, 0, 0]
// Phase 1: matrix 99 rows 107 cols
[2020-05-22 08:16:11] [INFO ] Computed 20 place invariants in 7 ms
[2020-05-22 08:16:11] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2020-05-22 08:16:11] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 10 ms returned sat
[2020-05-22 08:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:11] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2020-05-22 08:16:11] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-05-22 08:16:11] [INFO ] [Real]Added 11 Read/Feed constraints in 3 ms returned sat
[2020-05-22 08:16:11] [INFO ] Deduced a trap composed of 15 places in 35 ms
[2020-05-22 08:16:11] [INFO ] Deduced a trap composed of 17 places in 25 ms
[2020-05-22 08:16:11] [INFO ] Deduced a trap composed of 13 places in 9 ms
[2020-05-22 08:16:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 102 ms
[2020-05-22 08:16:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:16:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 26 ms returned sat
[2020-05-22 08:16:11] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 81 ms returned sat
[2020-05-22 08:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:11] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2020-05-22 08:16:11] [INFO ] [Nat]Added 11 Read/Feed constraints in 14 ms returned sat
[2020-05-22 08:16:11] [INFO ] Computed and/alt/rep : 98/473/98 causal constraints in 8 ms.
[2020-05-22 08:16:11] [INFO ] Added : 97 causal constraints over 20 iterations in 343 ms. Result :sat
[2020-05-22 08:16:12] [INFO ] Deduced a trap composed of 13 places in 442 ms
[2020-05-22 08:16:12] [INFO ] Deduced a trap composed of 17 places in 15 ms
[2020-05-22 08:16:12] [INFO ] Deduced a trap composed of 19 places in 16 ms
[2020-05-22 08:16:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 503 ms
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-05-22 08:16:12] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-05-22 08:16:12] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-22 08:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:12] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-05-22 08:16:12] [INFO ] [Real]Added 11 Read/Feed constraints in 4 ms returned sat
[2020-05-22 08:16:12] [INFO ] Deduced a trap composed of 15 places in 37 ms
[2020-05-22 08:16:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2020-05-22 08:16:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:16:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-05-22 08:16:12] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 4 ms returned sat
[2020-05-22 08:16:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:12] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2020-05-22 08:16:12] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2020-05-22 08:16:12] [INFO ] Deduced a trap composed of 9 places in 19 ms
[2020-05-22 08:16:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2020-05-22 08:16:12] [INFO ] Computed and/alt/rep : 98/473/98 causal constraints in 5 ms.
[2020-05-22 08:16:12] [INFO ] Added : 97 causal constraints over 20 iterations in 183 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-05-22 08:16:12] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-05-22 08:16:12] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 4 ms returned sat
[2020-05-22 08:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:12] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-05-22 08:16:12] [INFO ] [Real]Added 11 Read/Feed constraints in 2 ms returned sat
[2020-05-22 08:16:12] [INFO ] Deduced a trap composed of 13 places in 27 ms
[2020-05-22 08:16:12] [INFO ] Deduced a trap composed of 11 places in 24 ms
[2020-05-22 08:16:13] [INFO ] Deduced a trap composed of 16 places in 25 ms
[2020-05-22 08:16:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 90 ms
[2020-05-22 08:16:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:16:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-05-22 08:16:13] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-22 08:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:13] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2020-05-22 08:16:13] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2020-05-22 08:16:13] [INFO ] Deduced a trap composed of 13 places in 14 ms
[2020-05-22 08:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2020-05-22 08:16:13] [INFO ] Computed and/alt/rep : 98/473/98 causal constraints in 5 ms.
[2020-05-22 08:16:13] [INFO ] Added : 95 causal constraints over 19 iterations in 210 ms. Result :sat
[2020-05-22 08:16:13] [INFO ] Deduced a trap composed of 9 places in 49 ms
[2020-05-22 08:16:13] [INFO ] Deduced a trap composed of 13 places in 19 ms
[2020-05-22 08:16:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
Attempting to minimize the solution found.
Minimization took 3 ms.
Incomplete Parikh walk after 93600 steps, including 10110 resets, run finished after 357 ms. (steps per millisecond=262 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 135600 steps, including 14573 resets, run finished after 106 ms. (steps per millisecond=1279 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 69100 steps, including 7461 resets, run finished after 60 ms. (steps per millisecond=1151 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 12 out of 107 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 107/107 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 99/99 transitions.
Starting structural reductions, iteration 0 : 107/107 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 107 cols
[2020-05-22 08:16:13] [INFO ] Computed 20 place invariants in 1 ms
[2020-05-22 08:16:14] [INFO ] Implicit Places using invariants in 79 ms returned [24, 46, 52, 69, 77, 98, 104]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 93 ms to find 7 implicit places.
[2020-05-22 08:16:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 99 rows 100 cols
[2020-05-22 08:16:14] [INFO ] Computed 14 place invariants in 1 ms
[2020-05-22 08:16:14] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Starting structural reductions, iteration 1 : 100/107 places, 99/99 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 99 transition count 98
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 99 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 97 transition count 96
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 97 transition count 96
Applied a total of 8 rules in 10 ms. Remains 97 /100 variables (removed 3) and now considering 96/99 (removed 3) transitions.
// Phase 1: matrix 96 rows 97 cols
[2020-05-22 08:16:14] [INFO ] Computed 14 place invariants in 1 ms
[2020-05-22 08:16:14] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 96 rows 97 cols
[2020-05-22 08:16:14] [INFO ] Computed 14 place invariants in 1 ms
[2020-05-22 08:16:14] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-05-22 08:16:14] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 97/107 places, 96/99 transitions.
Incomplete random walk after 1000000 steps, including 100559 resets, run finished after 853 ms. (steps per millisecond=1172 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 72001 resets, run finished after 578 ms. (steps per millisecond=1730 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 71849 resets, run finished after 522 ms. (steps per millisecond=1915 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 71622 resets, run finished after 554 ms. (steps per millisecond=1805 ) properties seen :[0, 0, 0]
Probably explored full state space saw : 713805 states, properties seen :[0, 0, 0]
Probabilistic random walk after 1427670 steps, saw 713805 distinct states, run finished after 2692 ms. (steps per millisecond=530 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 13355909 steps, run timeout after 30001 ms. (steps per millisecond=445 ) properties seen :[0, 0, 0]
Exhaustive walk after 13355909 steps, saw 6677947 distinct states, run finished after 30001 ms. (steps per millisecond=445 ) properties seen :[0, 0, 0]
// Phase 1: matrix 96 rows 97 cols
[2020-05-22 08:16:49] [INFO ] Computed 14 place invariants in 3 ms
[2020-05-22 08:16:49] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2020-05-22 08:16:49] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-22 08:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:49] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-05-22 08:16:49] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-05-22 08:16:49] [INFO ] [Real]Added 11 Read/Feed constraints in 2 ms returned sat
[2020-05-22 08:16:49] [INFO ] Deduced a trap composed of 13 places in 43 ms
[2020-05-22 08:16:49] [INFO ] Deduced a trap composed of 5 places in 46 ms
[2020-05-22 08:16:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2020-05-22 08:16:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:16:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-22 08:16:49] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2020-05-22 08:16:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:50] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2020-05-22 08:16:50] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2020-05-22 08:16:50] [INFO ] Deduced a trap composed of 13 places in 34 ms
[2020-05-22 08:16:50] [INFO ] Deduced a trap composed of 9 places in 34 ms
[2020-05-22 08:16:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2020-05-22 08:16:50] [INFO ] Computed and/alt/rep : 95/453/95 causal constraints in 8 ms.
[2020-05-22 08:16:50] [INFO ] Added : 95 causal constraints over 19 iterations in 272 ms. Result :sat
[2020-05-22 08:16:50] [INFO ] Deduced a trap composed of 14 places in 38 ms
[2020-05-22 08:16:50] [INFO ] Deduced a trap composed of 18 places in 34 ms
[2020-05-22 08:16:50] [INFO ] Deduced a trap composed of 15 places in 18 ms
[2020-05-22 08:16:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 136 ms
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-05-22 08:16:50] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-22 08:16:50] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-22 08:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:50] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-22 08:16:50] [INFO ] [Real]Added 11 Read/Feed constraints in 1 ms returned sat
[2020-05-22 08:16:50] [INFO ] Computed and/alt/rep : 95/453/95 causal constraints in 8 ms.
[2020-05-22 08:16:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:16:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-22 08:16:50] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 1 ms returned sat
[2020-05-22 08:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:50] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2020-05-22 08:16:50] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2020-05-22 08:16:50] [INFO ] Computed and/alt/rep : 95/453/95 causal constraints in 5 ms.
[2020-05-22 08:16:50] [INFO ] Added : 94 causal constraints over 19 iterations in 166 ms. Result :sat
[2020-05-22 08:16:50] [INFO ] Deduced a trap composed of 13 places in 18 ms
[2020-05-22 08:16:50] [INFO ] Deduced a trap composed of 15 places in 17 ms
[2020-05-22 08:16:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 56 ms
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-05-22 08:16:50] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-22 08:16:50] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2020-05-22 08:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:51] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-05-22 08:16:51] [INFO ] [Real]Added 11 Read/Feed constraints in 21 ms returned sat
[2020-05-22 08:16:51] [INFO ] Deduced a trap composed of 13 places in 14 ms
[2020-05-22 08:16:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2020-05-22 08:16:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:16:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-22 08:16:51] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2020-05-22 08:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:51] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2020-05-22 08:16:51] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2020-05-22 08:16:51] [INFO ] Computed and/alt/rep : 95/453/95 causal constraints in 5 ms.
[2020-05-22 08:16:51] [INFO ] Added : 94 causal constraints over 19 iterations in 189 ms. Result :sat
[2020-05-22 08:16:51] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2020-05-22 08:16:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 109900 steps, including 12687 resets, run finished after 83 ms. (steps per millisecond=1324 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 97400 steps, including 11262 resets, run finished after 74 ms. (steps per millisecond=1316 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 80500 steps, including 9296 resets, run finished after 60 ms. (steps per millisecond=1341 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 12 out of 97 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 97/97 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 97/97 places, 96/96 transitions.
Starting structural reductions, iteration 0 : 97/97 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 97 cols
[2020-05-22 08:16:51] [INFO ] Computed 14 place invariants in 1 ms
[2020-05-22 08:16:51] [INFO ] Implicit Places using invariants in 223 ms returned []
// Phase 1: matrix 96 rows 97 cols
[2020-05-22 08:16:51] [INFO ] Computed 14 place invariants in 1 ms
[2020-05-22 08:16:51] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-05-22 08:16:52] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2020-05-22 08:16:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 96 rows 97 cols
[2020-05-22 08:16:52] [INFO ] Computed 14 place invariants in 0 ms
[2020-05-22 08:16:52] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 97/97 places, 96/96 transitions.
Incomplete random walk after 100000 steps, including 10061 resets, run finished after 310 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0]
// Phase 1: matrix 96 rows 97 cols
[2020-05-22 08:16:52] [INFO ] Computed 14 place invariants in 1 ms
[2020-05-22 08:16:52] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-22 08:16:52] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2020-05-22 08:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:52] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-05-22 08:16:52] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-05-22 08:16:52] [INFO ] [Real]Added 11 Read/Feed constraints in 2 ms returned sat
[2020-05-22 08:16:52] [INFO ] Deduced a trap composed of 13 places in 25 ms
[2020-05-22 08:16:52] [INFO ] Deduced a trap composed of 5 places in 30 ms
[2020-05-22 08:16:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2020-05-22 08:16:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:16:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-22 08:16:52] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-22 08:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:52] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-05-22 08:16:52] [INFO ] [Nat]Added 11 Read/Feed constraints in 4 ms returned sat
[2020-05-22 08:16:52] [INFO ] Deduced a trap composed of 13 places in 31 ms
[2020-05-22 08:16:52] [INFO ] Deduced a trap composed of 9 places in 26 ms
[2020-05-22 08:16:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2020-05-22 08:16:52] [INFO ] Computed and/alt/rep : 95/453/95 causal constraints in 6 ms.
[2020-05-22 08:16:53] [INFO ] Added : 95 causal constraints over 19 iterations in 257 ms. Result :sat
[2020-05-22 08:16:53] [INFO ] Deduced a trap composed of 14 places in 39 ms
[2020-05-22 08:16:53] [INFO ] Deduced a trap composed of 18 places in 35 ms
[2020-05-22 08:16:53] [INFO ] Deduced a trap composed of 15 places in 19 ms
[2020-05-22 08:16:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 150 ms
[2020-05-22 08:16:53] [INFO ] [Real]Absence check using 8 positive place invariants in 24 ms returned sat
[2020-05-22 08:16:53] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-22 08:16:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:53] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2020-05-22 08:16:53] [INFO ] [Real]Added 11 Read/Feed constraints in 3 ms returned sat
[2020-05-22 08:16:53] [INFO ] Computed and/alt/rep : 95/453/95 causal constraints in 7 ms.
[2020-05-22 08:16:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:16:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-22 08:16:53] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2020-05-22 08:16:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:53] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2020-05-22 08:16:53] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2020-05-22 08:16:53] [INFO ] Computed and/alt/rep : 95/453/95 causal constraints in 6 ms.
[2020-05-22 08:16:53] [INFO ] Added : 94 causal constraints over 19 iterations in 252 ms. Result :sat
[2020-05-22 08:16:53] [INFO ] Deduced a trap composed of 13 places in 26 ms
[2020-05-22 08:16:53] [INFO ] Deduced a trap composed of 15 places in 23 ms
[2020-05-22 08:16:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2020-05-22 08:16:53] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-22 08:16:53] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2020-05-22 08:16:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:53] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-05-22 08:16:53] [INFO ] [Real]Added 11 Read/Feed constraints in 2 ms returned sat
[2020-05-22 08:16:53] [INFO ] Deduced a trap composed of 13 places in 19 ms
[2020-05-22 08:16:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2020-05-22 08:16:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:16:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-05-22 08:16:53] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-22 08:16:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:53] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2020-05-22 08:16:53] [INFO ] [Nat]Added 11 Read/Feed constraints in 4 ms returned sat
[2020-05-22 08:16:53] [INFO ] Computed and/alt/rep : 95/453/95 causal constraints in 10 ms.
[2020-05-22 08:16:54] [INFO ] Added : 94 causal constraints over 19 iterations in 308 ms. Result :sat
[2020-05-22 08:16:54] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2020-05-22 08:16:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 96 transition count 95
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 96 transition count 91
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 92 transition count 91
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 92 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 91 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 90 transition count 89
Applied a total of 15 rules in 16 ms. Remains 90 /97 variables (removed 7) and now considering 89/96 (removed 7) transitions.
// Phase 1: matrix 89 rows 90 cols
[2020-05-22 08:16:54] [INFO ] Computed 14 place invariants in 3 ms
[2020-05-22 08:16:54] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-05-22 08:16:54] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2020-05-22 08:16:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:54] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-05-22 08:16:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-22 08:16:54] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-05-22 08:16:54] [INFO ] Deduced a trap composed of 13 places in 15 ms
[2020-05-22 08:16:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2020-05-22 08:16:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:16:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-05-22 08:16:54] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2020-05-22 08:16:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:54] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-05-22 08:16:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-05-22 08:16:54] [INFO ] Deduced a trap composed of 13 places in 38 ms
[2020-05-22 08:16:54] [INFO ] Deduced a trap composed of 14 places in 31 ms
[2020-05-22 08:16:54] [INFO ] Deduced a trap composed of 17 places in 29 ms
[2020-05-22 08:16:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 127 ms
[2020-05-22 08:16:54] [INFO ] Computed and/alt/rep : 88/421/88 causal constraints in 7 ms.
[2020-05-22 08:16:55] [INFO ] Added : 88 causal constraints over 18 iterations in 348 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2020-05-22 08:16:55] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-05-22 08:16:55] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 4 ms returned sat
[2020-05-22 08:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:55] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-05-22 08:16:55] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-05-22 08:16:55] [INFO ] Deduced a trap composed of 6 places in 34 ms
[2020-05-22 08:16:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2020-05-22 08:16:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:16:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 55 ms returned sat
[2020-05-22 08:16:55] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 53 ms returned sat
[2020-05-22 08:16:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:55] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2020-05-22 08:16:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2020-05-22 08:16:55] [INFO ] Deduced a trap composed of 6 places in 48 ms
[2020-05-22 08:16:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2020-05-22 08:16:55] [INFO ] Computed and/alt/rep : 88/421/88 causal constraints in 9 ms.
[2020-05-22 08:16:55] [INFO ] Added : 88 causal constraints over 18 iterations in 321 ms. Result :sat
[2020-05-22 08:16:55] [INFO ] Deduced a trap composed of 17 places in 49 ms
[2020-05-22 08:16:55] [INFO ] Deduced a trap composed of 10 places in 40 ms
[2020-05-22 08:16:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
[2020-05-22 08:16:56] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-05-22 08:16:56] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2020-05-22 08:16:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:56] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-05-22 08:16:56] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2020-05-22 08:16:56] [INFO ] Computed and/alt/rep : 88/421/88 causal constraints in 7 ms.
[2020-05-22 08:16:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:16:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-05-22 08:16:56] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2020-05-22 08:16:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:16:56] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2020-05-22 08:16:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-05-22 08:16:56] [INFO ] Deduced a trap composed of 13 places in 11 ms
[2020-05-22 08:16:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2020-05-22 08:16:56] [INFO ] Computed and/alt/rep : 88/421/88 causal constraints in 6 ms.
[2020-05-22 08:16:56] [INFO ] Added : 86 causal constraints over 19 iterations in 286 ms. Result :sat
[2020-05-22 08:16:56] [INFO ] Deduced a trap composed of 16 places in 21 ms
[2020-05-22 08:16:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-05-22 08:16:56] [INFO ] Flatten gal took : 63 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 08:16:56] [INFO ] Applying decomposition
[2020-05-22 08:16:56] [INFO ] Flatten gal took : 34 ms
[2020-05-22 08:16:56] [INFO ] Flatten gal took : 9 ms
[2020-05-22 08:16:57] [INFO ] Input system was already deterministic with 96 transitions.
[2020-05-22 08:16:57] [INFO ] Input system was already deterministic with 96 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 96 rows 97 cols
[2020-05-22 08:16:57] [INFO ] Computed 14 place invariants in 1 ms
inv : p101 + p103 + p116 + p12 + p126 + p127 + p128 + p129 + p13 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p149 + p150 + p152 + p154 + p16 + p167 + p169 + p176 + p181 + p184 + p187 + p193 + p196 + p197 + p199 + p203 + p205 + p207 + p213 + p28 + p30 + p31 + 2*p4 + p40 + p42 + p43 + p44 + p45 + 2*p5 + 2*p51 + p52 + p54 + p63 + p75 + p76 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p99 = 3
inv : p162 - p163 + p165 - p166 + p187 + p199 = 0
inv : p101 + p103 + p104 + p106 + p116 + p126 + p127 + p128 + p129 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p149 + p150 + p152 + p154 + p16 + p167 + p169 + p176 + p181 + p184 + p187 + p193 + p196 + p197 + p199 + p203 + p205 + p207 + p213 + p22 + p24 + p4 + p5 + p63 + p75 + p76 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p99 = 1
inv : p116 + p122 + p124 + p14 + p16 + p167 + p169 + p176 + p181 + p184 + p187 + p193 + p196 + p197 + p199 + p203 + p205 + p207 + p210 + p212 + p213 + p22 + p24 + p4 + p5 + p63 + p69 + p71 = 1
inv : p10 + p11 + p4 + p5 = 2
inv : p116 + p126 + p127 + p128 + p129 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p149 + p150 + p152 + p154 + p157 + p159 + p16 + p167 + p169 + p176 + p181 + p184 + p187 + p193 + p196 + p197 + p199 + p203 + p205 + p207 + p213 + p22 + p24 + p4 + p5 + p63 + p69 + p71 = 1
inv : p55 - p57 + p58 - p60 + p81 + p93 = 0
inv : p4 + p44 + p8 + p9 = 2
inv : p56 - p57 + p59 - p60 + p76 + p81 + p93 = 0
inv : p109 - p110 + p112 - p113 + p129 + p134 + p146 = 0
inv : p108 - p110 + p111 - p113 + p134 + p146 = 0
inv : p161 - p163 + p164 - p166 + p187 + p197 + p199 = 0
inv : p101 + p103 + p116 + p126 + p127 + p128 + p129 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p149 + p150 + p152 + p154 + p16 + p167 + p169 + p176 + p181 + p184 + p187 + p193 + p196 + p197 + p199 + p203 + p205 + p207 + p213 + p28 + p30 + p31 + p34 + p4 + p40 + p42 + p43 + p44 + p45 + p46 + p5 + p51 + p52 + p54 + p63 + p75 + p76 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p99 = 1
inv : p116 + p122 + p14 + p140 + p142 + p143 + p146 + p148 + p149 + p16 + p167 + p169 + p176 + p181 + p184 + p187 + p193 + p196 + p197 + p199 + p203 + p205 + p207 + p210 + p213 + p22 + p24 + p4 + p5 + p63 + p69 + p71 = 1
Total of 14 invariants.
[2020-05-22 08:16:57] [INFO ] Computed 14 place invariants in 2 ms
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/graph3066021422390415528.txt, -o, /tmp/graph3066021422390415528.bin, -w, /tmp/graph3066021422390415528.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/graph3066021422390415528.bin, -l, -1, -v, -w, /tmp/graph3066021422390415528.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 08:16:57] [INFO ] Decomposing Gal with order
[2020-05-22 08:16:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 08:16:57] [INFO ] Removed a total of 35 redundant transitions.
[2020-05-22 08:16:57] [INFO ] Ran tautology test, simplified 0 / 3 in 338 ms.
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=0 took 64 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=0 took 8 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=0 took 3 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=1 took 1 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=1 took 0 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=1 took 1 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=2 took 6 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=2 took 1 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=2 took 1 ms
[2020-05-22 08:16:57] [INFO ] Flatten gal took : 134 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=3 took 8 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=3 took 0 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 96 rows 97 cols
[2020-05-22 08:16:57] [INFO ] Computed 14 place invariants in 1 ms
inv : p101 + p103 + p116 + p12 + p126 + p127 + p128 + p129 + p13 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p149 + p150 + p152 + p154 + p16 + p167 + p169 + p176 + p181 + p184 + p187 + p193 + p196 + p197 + p199 + p203 + p205 + p207 + p213 + p28 + p30 + p31 + 2*p4 + p40 + p42 + p43 + p44 + p45 + 2*p5 + 2*p51 + p52 + p54 + p63 + p75 + p76 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p99 = 3
inv : p162 - p163 + p165 - p166 + p187 + p199 = 0
inv : p101 + p103 + p104 + p106 + p116 + p126 + p127 + p128 + p129 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p149 + p150 + p152 + p154 + p16 + p167 + p169 + p176 + p181 + p184 + p187 + p193 + p196 + p197 + p199 + p203 + p205 + p207 + p213 + p22 + p24 + p4 + p5 + p63 + p75 + p76 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p99 = 1
inv : p116 + p122 + p124 + p14 + p16 + p167 + p169 + p176 + p181 + p184 + p187 + p193 + p196 + p197 + p199 + p203 + p205 + p207 + p210 + p212 + p213 + p22 + p24 + p4 + p5 + p63 + p69 + p71 = 1
inv : p10 + p11 + p4 + p5 = 2
inv : p116 + p126 + p127 + p128 + p129 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p149 + p150 + p152 + p154 + p157 + p159 + p16 + p167 + p169 + p176 + p181 + p184 + p187 + p193 + p196 + p197 + p199 + p203 + p205 + p207 + p213 + p22 + p24 + p4 + p5 + p63 + p69 + p71 = 1
inv : p55 - p57 + p58 - p60 + p81 + p93 = 0
inv : p4 + p44 + p8 + p9 = 2
inv : p56 - p57 + p59 - p60 + p76 + p81 + p93 = 0
inv : p109 - p110 + p112 - p113 + p129 + p134 + p146 = 0
inv : p108 - p110 + p111 - p113 + p134 + p146 = 0
inv : p161 - p163 + p164 - p166 + p187 + p197 + p199 = 0
inv : p101 + p103 + p116 + p126 + p127 + p128 + p129 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p149 + p150 + p152 + p154 + p16 + p167 + p169 + p176 + p181 + p184 + p187 + p193 + p196 + p197 + p199 + p203 + p205 + p207 + p213 + p28 + p30 + p31 + p34 + p4 + p40 + p42 + p43 + p44 + p45 + p46 + p5 + p51 + p52 + p54 + p63 + p75 + p76 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p99 = 1
inv : p116 + p122 + p14 + p140 + p142 + p143 + p146 + p148 + p149 + p16 + p167 + p169 + p176 + p181 + p184 + p187 + p193 + p196 + p197 + p199 + p203 + p205 + p207 + p210 + p213 + p22 + p24 + p4 + p5 + p63 + p69 + p71 = 1
Total of 14 invariants.
[2020-05-22 08:16:57] [INFO ] Computed 14 place invariants in 2 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=3 took 18 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=4 took 8 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=4 took 2 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=4 took 2 ms
[2020-05-22 08:16:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 25 ms.
[2020-05-22 08:16:57] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 15 ms
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=5 took 28 ms
[2020-05-22 08:16:57] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 3 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-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=5 took 41 ms

[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=5 took 58 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 : DoubleExponent-PT-004-ReachabilityFireability-04 with value :((((i5.i1.u17.p76>=1)||(i4.u11.p149<1))||(i4.u11.p212<1))||(i6.i1.u18.p44>=1))
Read [reachable] property : DoubleExponent-PT-004-ReachabilityFireability-06 with value :(i3.u7.p197>=1)
Read [reachable] property : DoubleExponent-PT-004-ReachabilityFireability-07 with value :(((((i3.u8.p176>=1)&&(i0.u12.p45<1))&&(i6.i0.u1.p103<1))&&((i1.u5.p127<1)||(i1.u3.p129<1)))&&((i0.u13.p51<1)||(i6.i1.u10.p5<1)))
built 14 ordering constraints for composite.
built 27 ordering constraints for composite.
built 18 ordering constraints for composite.
built 26 ordering constraints for composite.
built 19 ordering constraints for composite.
built 14 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 19 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
[2020-05-22 08:16:57] [INFO ] Proved 97 variables to be positive in 530 ms
[2020-05-22 08:16:57] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2020-05-22 08:16:57] [INFO ] Computation of disable matrix completed :0/96 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:16:57] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:16:57] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2020-05-22 08:16:57] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
[2020-05-22 08:16:57] [INFO ] Computing symmetric co enabling matrix : 96 transitions.
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=6 took 248 ms
[2020-05-22 08:16:57] [INFO ] Proved 97 variables to be positive in 431 ms
[2020-05-22 08:16:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:16:57] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=0 took 8 ms
[2020-05-22 08:16:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:16:57] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=0 took 4 ms
[2020-05-22 08:16:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:16:57] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=0 took 3 ms
[2020-05-22 08:16:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:16:57] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=1 took 18 ms
[2020-05-22 08:16:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:16:57] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=1 took 7 ms
[2020-05-22 08:16:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:16:57] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=1 took 7 ms
SDD proceeding with computation, new max is 1024
[2020-05-22 08:16:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=6 took 94 ms
SDD proceeding with computation, new max is 2048
[2020-05-22 08:16:58] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=6 took 193 ms
[2020-05-22 08:16:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:16:58] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=2 took 311 ms
[2020-05-22 08:16:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:16:58] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=2 took 85 ms
[2020-05-22 08:16:58] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=7 took 239 ms
[2020-05-22 08:16:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:16:58] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=2 took 79 ms
SDD proceeding with computation, new max is 4096
[2020-05-22 08:16:58] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=7 took 217 ms
[2020-05-22 08:16:58] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=7 took 210 ms
[2020-05-22 08:16:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:16:59] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=3 took 715 ms
[2020-05-22 08:16:59] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=8 took 410 ms
[2020-05-22 08:16:59] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=8 took 349 ms
[2020-05-22 08:16:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:16:59] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=3 took 608 ms
SDD proceeding with computation, new max is 8192
[2020-05-22 08:16:59] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=8 took 479 ms
[2020-05-22 08:17:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:17:00] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=3 took 797 ms
[2020-05-22 08:17:00] [INFO ] Computation of co-enabling matrix(56/96) took 2935 ms. Total solver calls (SAT/UNSAT): 3819(9/3810)
[2020-05-22 08:17:01] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=9 took 1046 ms
[2020-05-22 08:17:01] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=9 took 507 ms
[2020-05-22 08:17:01] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=9 took 206 ms
[2020-05-22 08:17:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:17:01] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=4 took 1291 ms
[2020-05-22 08:17:01] [INFO ] Computation of Finished co-enabling matrix. took 4192 ms. Total solver calls (SAT/UNSAT): 4560(21/4539)
[2020-05-22 08:17:01] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2020-05-22 08:17:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:17:02] [INFO ] Built C files in 5022ms 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-22 08:17:02] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=10 took 958 ms
[2020-05-22 08:17:02] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=10 took 272 ms
[2020-05-22 08:17:03] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=10 took 545 ms
Compilation finished in 1706 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 52 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT004ReachabilityFireability04==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, DoubleExponentPT004ReachabilityFireability04==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, DoubleExponentPT004ReachabilityFireability04==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)
[2020-05-22 08:17:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:17:03] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=4 took 2062 ms
[2020-05-22 08:17:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:17:04] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=4 took 1155 ms
[2020-05-22 08:17:06] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=11 took 2827 ms
[2020-05-22 08:17:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:17:06] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=5 took 1945 ms
[2020-05-22 08:17:07] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=11 took 1244 ms
SDD proceeding with computation, new max is 16384
[2020-05-22 08:17:09] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=11 took 1536 ms
[2020-05-22 08:17:10] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=12 took 1678 ms
[2020-05-22 08:17:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:17:11] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=5 took 4242 ms
[2020-05-22 08:17:12] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=12 took 1524 ms
[2020-05-22 08:17:13] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=12 took 1047 ms
[2020-05-22 08:17:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:17:14] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=5 took 2872 ms
[2020-05-22 08:17:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=13 took 1242 ms
[2020-05-22 08:17:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:17:17] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=6 took 3164 ms
[2020-05-22 08:17:20] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=13 took 5782 ms
[2020-05-22 08:17:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:17:22] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=6 took 5719 ms
SDD proceeding with computation, new max is 32768
[2020-05-22 08:17:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:17:28] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=6 took 5870 ms
[2020-05-22 08:17:31] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=13 took 10801 ms
[2020-05-22 08:17:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:17:34] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=7 took 5371 ms
[2020-05-22 08:17:36] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=14 took 5345 ms
[2020-05-22 08:17:41] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=14 took 4919 ms
[2020-05-22 08:17:44] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=14 took 3039 ms
[2020-05-22 08:17:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:17:44] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=7 took 10629 ms
[2020-05-22 08:17:48] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=15 took 4078 ms
[2020-05-22 08:17:49] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=15 took 1315 ms
[2020-05-22 08:17:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:17:50] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=7 took 5897 ms
[2020-05-22 08:17:54] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=15 took 4231 ms
[2020-05-22 08:17:56] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=16 took 2532 ms
[2020-05-22 08:18:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:18:00] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=8 took 9842 ms
[2020-05-22 08:18:02] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=16 took 5735 ms
[2020-05-22 08:18:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:18:10] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=8 took 9700 ms
[2020-05-22 08:18:13] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=16 took 10604 ms
[2020-05-22 08:18:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:18:16] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=8 took 5847 ms
[2020-05-22 08:18:22] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=17 took 9515 ms
SDD proceeding with computation, new max is 65536
[2020-05-22 08:18:27] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=17 took 4446 ms
[2020-05-22 08:18:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:18:29] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=9 took 13204 ms
[2020-05-22 08:18:33] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=17 took 6780 ms
[2020-05-22 08:18:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:18:40] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=9 took 11622 ms
[2020-05-22 08:18:42] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=18 took 8208 ms
[2020-05-22 08:18:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:18:56] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=9 took 15527 ms
[2020-05-22 08:19:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:19:10] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=10 took 14129 ms
[2020-05-22 08:19:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:19:23] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=10 took 13250 ms
[2020-05-22 08:19:30] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=18 took 48840 ms
[2020-05-22 08:19:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:19:42] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=10 took 18850 ms
[2020-05-22 08:19:47] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=18 took 17069 ms
[2020-05-22 08:19:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:19:57] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=11 took 15111 ms
[2020-05-22 08:19:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=19 took 10041 ms
[2020-05-22 08:20:10] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=19 took 12483 ms
[2020-05-22 08:20:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:20:12] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=11 took 14804 ms
[2020-05-22 08:20:29] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=19 took 19334 ms
[2020-05-22 08:20:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:20:35] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=11 took 22637 ms
[2020-05-22 08:20:58] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=20 took 28462 ms
[2020-05-22 08:21:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:21:06] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=12 took 30915 ms
[2020-05-22 08:21:27] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=20 took 29466 ms
[2020-05-22 08:21:38] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=20 took 10561 ms
[2020-05-22 08:21:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:21:39] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=12 took 33747 ms
[2020-05-22 08:21:48] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=21 took 10058 ms
[2020-05-22 08:22:02] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=21 took 14537 ms
[2020-05-22 08:22:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:22:16] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=12 took 36184 ms
[2020-05-22 08:22:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:22:58] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=13 took 42799 ms
[2020-05-22 08:24:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:24:00] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=13 took 61122 ms
[2020-05-22 08:24:04] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=21 took 121849 ms
[2020-05-22 08:24:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:24:34] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=13 took 34009 ms
[2020-05-22 08:24:37] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=22 took 32663 ms
[2020-05-22 08:24:51] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=22 took 13650 ms
[2020-05-22 08:25:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:25:20] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=14 took 46351 ms
[2020-05-22 08:25:30] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=22 took 39300 ms
[2020-05-22 08:26:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:26:14] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=14 took 54259 ms
[2020-05-22 08:26:55] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=23 took 85147 ms
[2020-05-22 08:27:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:27:04] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=14 took 50180 ms
[2020-05-22 08:27:09] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=23 took 14357 ms
[2020-05-22 08:27:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:27:42] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=15 took 37904 ms
[2020-05-22 08:27:46] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=23 took 37102 ms
[2020-05-22 08:28:05] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=24 took 18136 ms
[2020-05-22 08:29:00] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=24 took 55609 ms
[2020-05-22 08:29:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:29:00] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=15 took 78223 ms
[2020-05-22 08:29:18] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=24 took 17832 ms
[2020-05-22 08:30:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=25 took 55666 ms
[2020-05-22 08:30:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:30:24] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=15 took 83755 ms
[2020-05-22 08:31:33] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=25 took 79299 ms
[2020-05-22 08:32:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:32:01] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=16 took 96689 ms
[2020-05-22 08:33:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:33:08] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=16 took 67059 ms
[2020-05-22 08:33:54] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=25 took 140807 ms
[2020-05-22 08:34:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:34:10] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=16 took 62500 ms
[2020-05-22 08:34:47] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=26 took 53571 ms
[2020-05-22 08:35:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:35:27] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=17 took 76847 ms
[2020-05-22 08:37:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:37:13] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=17 took 105418 ms
Detected timeout of ITS tools.
[2020-05-22 08:37:51] [INFO ] Flatten gal took : 83 ms
[2020-05-22 08:37:51] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 109 ms
[2020-05-22 08:37:51] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 11 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, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityFireability.prop.
Read [invariant] property : DoubleExponent-PT-004-ReachabilityFireability-04 with value :((((p76>=1)||(p149<1))||(p212<1))||(p44>=1))
Read [reachable] property : DoubleExponent-PT-004-ReachabilityFireability-06 with value :(p197>=1)
Read [reachable] property : DoubleExponent-PT-004-ReachabilityFireability-07 with value :(((((p176>=1)&&(p45<1))&&(p103<1))&&((p127<1)||(p129<1)))&&((p51<1)||(p5<1)))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
SDD proceeding with computation, new max is 131072
SDD proceeding with computation, new max is 262144
SDD proceeding with computation, new max is 524288
[2020-05-22 08:38:49] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=26 took 241919 ms
[2020-05-22 08:39:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:39:27] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=17 took 134051 ms
SDD proceeding with computation, new max is 1048576
[2020-05-22 08:41:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:41:42] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=18 took 134866 ms
SDD proceeding with computation, new max is 2097152
[2020-05-22 08:42:49] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=26 took 240032 ms
[2020-05-22 08:43:09] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=27 took 19708 ms
[2020-05-22 08:44:28] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=27 took 78992 ms
[2020-05-22 08:45:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:45:00] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=18 took 197852 ms
[2020-05-22 08:47:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:47:00] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=18 took 120133 ms
[2020-05-22 08:48:49] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=27 took 260564 ms
ITS-tools command line returned an error code 137
[2020-05-22 08:49:19] [INFO ] Flatten gal took : 110 ms
[2020-05-22 08:49:19] [INFO ] Input system was already deterministic with 96 transitions.
[2020-05-22 08:49:19] [INFO ] Transformed 97 places.
[2020-05-22 08:49:19] [INFO ] Transformed 96 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-22 08:49:19] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 1 ms
[2020-05-22 08:49:19] [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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file ReachabilityFireability.prop.
Read [invariant] property : DoubleExponent-PT-004-ReachabilityFireability-04 with value :((((p76>=1)||(p149<1))||(p212<1))||(p44>=1))
Read [reachable] property : DoubleExponent-PT-004-ReachabilityFireability-06 with value :(p197>=1)
Read [reachable] property : DoubleExponent-PT-004-ReachabilityFireability-07 with value :(((((p176>=1)&&(p45<1))&&(p103<1))&&((p127<1)||(p129<1)))&&((p51<1)||(p5<1)))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
[2020-05-22 08:49:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:49:47] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=19 took 167353 ms
[2020-05-22 08:51:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 08:51:37] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=19 took 110371 ms
[2020-05-22 08:54:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 08:54:25] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=19 took 167063 ms
[2020-05-22 08:55:33] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=28 took 403939 ms
SDD proceeding with computation, new max is 32768
[2020-05-22 08:58:19] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=28 took 165956 ms
[2020-05-22 08:58:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 08:58:54] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=20 took 269494 ms
[2020-05-22 08:59:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=28 took 98593 ms
[2020-05-22 09:01:09] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=29 took 71832 ms
[2020-05-22 09:01:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 09:01:53] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=20 took 178879 ms
[2020-05-22 09:04:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-07
[2020-05-22 09:04:57] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-07(SAT) depth K=20 took 184389 ms
[2020-05-22 09:08:30] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=29 took 441226 ms
[2020-05-22 09:08:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-04
[2020-05-22 09:08:40] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-04(SAT) depth K=21 took 222361 ms
SDD proceeding with computation, new max is 65536
Detected timeout of ITS tools.
[2020-05-22 09:11:15] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-07(UNSAT) depth K=29 took 164324 ms
[2020-05-22 09:11:49] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-04(UNSAT) depth K=30 took 34088 ms
[2020-05-22 09:11:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-06
[2020-05-22 09:11:52] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-06(SAT) depth K=21 took 192146 ms
[2020-05-22 09:12:54] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-06(UNSAT) depth K=30 took 65241 ms

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DoubleExponent-PT-004"
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 DoubleExponent-PT-004, 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 r066-tajo-158922814800775"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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