fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r078-tall-165260110000191
Last Updated
Jun 22, 2022

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
6662.088 2631898.00 5928367.00 6679.40 FTFFTTTTTTFTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110000191.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-004, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000191
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 8.9K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 29 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 29 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 29 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 67K May 10 09:33 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 1654186258863

Running Version 202205111006
[2022-06-02 16:10:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 16:10:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:11:00] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2022-06-02 16:11:00] [INFO ] Transformed 216 places.
[2022-06-02 16:11:00] [INFO ] Transformed 198 transitions.
[2022-06-02 16:11:00] [INFO ] Parsed PT model containing 216 places and 198 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 322 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 35 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 236221 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{0=1, 4=1, 5=1, 10=1, 11=1}
Probabilistic random walk after 236221 steps, saw 118123 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :5
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-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 11 properties.
// Phase 1: matrix 198 rows 216 cols
[2022-06-02 16:11:04] [INFO ] Computed 24 place invariants in 21 ms
[2022-06-02 16:11:04] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2022-06-02 16:11:04] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 12 ms returned sat
[2022-06-02 16:11:04] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:8
[2022-06-02 16:11:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-02 16:11:04] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2022-06-02 16:11:04] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :2
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 4 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 336 ms
[2022-06-02 16:11:05] [INFO ] After 915ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :2
Attempting to minimize the solution found.
Minimization took 267 ms.
[2022-06-02 16:11:05] [INFO ] After 1336ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :2
FORMULA DoubleExponent-PT-004-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-14 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-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1093 ms.
Support contains 40 out of 216 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 216/216 places, 198/198 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.4 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 209 transition count 178
Reduce places removed 18 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 24 rules applied. Total rules applied 46 place count 191 transition count 172
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 52 place count 185 transition count 172
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 52 place count 185 transition count 160
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 76 place count 173 transition count 160
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 112 place count 155 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 118 place count 152 transition count 142
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 152 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 150 transition count 140
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 136 place count 150 transition count 126
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 150 place count 136 transition count 126
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 158 place count 136 transition count 126
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 160 place count 136 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 161 place count 135 transition count 125
Applied a total of 161 rules in 86 ms. Remains 135 /216 variables (removed 81) and now considering 125/198 (removed 73) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/216 places, 125/198 transitions.
Incomplete random walk after 1000000 steps, including 60647 resets, run finished after 6004 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 946762 steps, including 43665 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen 0
Incomplete Best-First random walk after 1000000 steps, including 46109 resets, run finished after 4722 ms. (steps per millisecond=211 ) properties (out of 2) seen :0
Probably explored full state space saw : 966372 states, properties seen :1
Probabilistic random walk after 1932868 steps, saw 966372 distinct states, run finished after 5791 ms. (steps per millisecond=333 ) properties seen :1
FORMULA DoubleExponent-PT-004-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Interrupted probabilistic random walk after 15486974 steps, run timeout after 45001 ms. (steps per millisecond=344 ) properties seen :{}
Exhaustive walk after 15486974 steps, saw 7743512 distinct states, run finished after 45002 ms. (steps per millisecond=344 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 135 cols
[2022-06-02 16:12:13] [INFO ] Computed 20 place invariants in 12 ms
[2022-06-02 16:12:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-02 16:12:13] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 5 ms returned sat
[2022-06-02 16:12:13] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:12:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-02 16:12:13] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 5 ms returned sat
[2022-06-02 16:12:13] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:12:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-02 16:12:13] [INFO ] After 68ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:12:13] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2022-06-02 16:12:13] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2022-06-02 16:12:13] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2022-06-02 16:12:14] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2022-06-02 16:12:14] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2022-06-02 16:12:14] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2022-06-02 16:12:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 405 ms
[2022-06-02 16:12:14] [INFO ] After 531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-06-02 16:12:14] [INFO ] After 725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 136 ms.
Support contains 40 out of 135 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 135/135 places, 125/125 transitions.
Applied a total of 0 rules in 14 ms. Remains 135 /135 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 125/125 transitions.
Incomplete random walk after 1000000 steps, including 60932 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 46155 resets, run finished after 928 ms. (steps per millisecond=1077 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1094765 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :{}
Probabilistic random walk after 1094765 steps, saw 547508 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 135 cols
[2022-06-02 16:12:19] [INFO ] Computed 20 place invariants in 11 ms
[2022-06-02 16:12:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-02 16:12:19] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 5 ms returned sat
[2022-06-02 16:12:19] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:12:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-02 16:12:19] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 5 ms returned sat
[2022-06-02 16:12:19] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:12:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-02 16:12:19] [INFO ] After 70ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:12:19] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2022-06-02 16:12:19] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2022-06-02 16:12:19] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2022-06-02 16:12:19] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2022-06-02 16:12:19] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2022-06-02 16:12:19] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2022-06-02 16:12:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 325 ms
[2022-06-02 16:12:19] [INFO ] After 448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2022-06-02 16:12:19] [INFO ] After 645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 110 ms.
Support contains 40 out of 135 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 135/135 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 135 /135 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 125/125 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 135/135 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 135 /135 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 135 cols
[2022-06-02 16:12:20] [INFO ] Computed 20 place invariants in 4 ms
[2022-06-02 16:12:20] [INFO ] Implicit Places using invariants in 63 ms returned [31, 99, 123]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 65 ms to find 3 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 132/135 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 132/135 places, 125/125 transitions.
Incomplete random walk after 1000000 steps, including 60825 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 46055 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1150865 steps, run timeout after 3001 ms. (steps per millisecond=383 ) properties seen :{}
Probabilistic random walk after 1150865 steps, saw 575430 distinct states, run finished after 3001 ms. (steps per millisecond=383 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 132 cols
[2022-06-02 16:12:24] [INFO ] Computed 17 place invariants in 6 ms
[2022-06-02 16:12:24] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-06-02 16:12:24] [INFO ] [Real]Absence check using 6 positive and 11 generalized place invariants in 3 ms returned sat
[2022-06-02 16:12:24] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:12:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-06-02 16:12:24] [INFO ] [Nat]Absence check using 6 positive and 11 generalized place invariants in 3 ms returned sat
[2022-06-02 16:12:25] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:12:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-02 16:12:25] [INFO ] After 55ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:12:25] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2022-06-02 16:12:25] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2022-06-02 16:12:25] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2022-06-02 16:12:25] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2022-06-02 16:12:25] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2022-06-02 16:12:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 276 ms
[2022-06-02 16:12:25] [INFO ] After 391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-06-02 16:12:25] [INFO ] After 591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 74 ms.
Support contains 40 out of 132 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 132/132 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 125/125 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 132/132 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 132 cols
[2022-06-02 16:12:25] [INFO ] Computed 17 place invariants in 2 ms
[2022-06-02 16:12:25] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 125 rows 132 cols
[2022-06-02 16:12:25] [INFO ] Computed 17 place invariants in 1 ms
[2022-06-02 16:12:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-02 16:12:25] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2022-06-02 16:12:25] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 125 rows 132 cols
[2022-06-02 16:12:25] [INFO ] Computed 17 place invariants in 11 ms
[2022-06-02 16:12:25] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 125/125 transitions.
Incomplete random walk after 1000000 steps, including 60696 resets, run finished after 863 ms. (steps per millisecond=1158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 46130 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1166444 steps, run timeout after 3001 ms. (steps per millisecond=388 ) properties seen :{}
Probabilistic random walk after 1166444 steps, saw 583219 distinct states, run finished after 3001 ms. (steps per millisecond=388 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 132 cols
[2022-06-02 16:12:30] [INFO ] Computed 17 place invariants in 5 ms
[2022-06-02 16:12:30] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-06-02 16:12:30] [INFO ] [Real]Absence check using 6 positive and 11 generalized place invariants in 3 ms returned sat
[2022-06-02 16:12:30] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:12:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-06-02 16:12:30] [INFO ] [Nat]Absence check using 6 positive and 11 generalized place invariants in 4 ms returned sat
[2022-06-02 16:12:30] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:12:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-02 16:12:31] [INFO ] After 52ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:12:31] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-06-02 16:12:31] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2022-06-02 16:12:31] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2022-06-02 16:12:31] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2022-06-02 16:12:31] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2022-06-02 16:12:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 256 ms
[2022-06-02 16:12:31] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-06-02 16:12:31] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 76 ms.
Support contains 40 out of 132 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 132/132 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 125/125 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 132/132 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 132 cols
[2022-06-02 16:12:31] [INFO ] Computed 17 place invariants in 4 ms
[2022-06-02 16:12:31] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 125 rows 132 cols
[2022-06-02 16:12:31] [INFO ] Computed 17 place invariants in 2 ms
[2022-06-02 16:12:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-02 16:12:31] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2022-06-02 16:12:31] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 125 rows 132 cols
[2022-06-02 16:12:31] [INFO ] Computed 17 place invariants in 4 ms
[2022-06-02 16:12:31] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 125/125 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 131 transition count 124
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 131 transition count 121
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 128 transition count 121
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 128 transition count 119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 126 transition count 119
Applied a total of 12 rules in 14 ms. Remains 126 /132 variables (removed 6) and now considering 119/125 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 119 rows 126 cols
[2022-06-02 16:12:31] [INFO ] Computed 17 place invariants in 2 ms
[2022-06-02 16:12:31] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-06-02 16:12:31] [INFO ] [Real]Absence check using 6 positive and 11 generalized place invariants in 3 ms returned sat
[2022-06-02 16:12:31] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:12:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-02 16:12:31] [INFO ] [Nat]Absence check using 6 positive and 11 generalized place invariants in 2 ms returned sat
[2022-06-02 16:12:32] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:12:32] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2022-06-02 16:12:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2022-06-02 16:12:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2022-06-02 16:12:32] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-06-02 16:12:32] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:12:32] [INFO ] Flatten gal took : 47 ms
[2022-06-02 16:12:32] [INFO ] Flatten gal took : 13 ms
[2022-06-02 16:12:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14660190681782151933.gal : 10 ms
[2022-06-02 16:12:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4541614140643790768.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14660190681782151933.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4541614140643790768.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality4541614140643790768.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 53
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :53 after 106
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :106 after 489
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :489 after 1174
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1174 after 3929
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3929 after 57148
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :57148 after 226745
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :226745 after 602568
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :602568 after 1.39716e+06
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.39716e+06 after 1.39221e+08
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.39221e+08 after 1.01546e+09
Detected timeout of ITS tools.
[2022-06-02 16:12:47] [INFO ] Flatten gal took : 12 ms
[2022-06-02 16:12:47] [INFO ] Applying decomposition
[2022-06-02 16:12:47] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11850167780680341285.txt' '-o' '/tmp/graph11850167780680341285.bin' '-w' '/tmp/graph11850167780680341285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11850167780680341285.bin' '-l' '-1' '-v' '-w' '/tmp/graph11850167780680341285.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:12:47] [INFO ] Decomposing Gal with order
[2022-06-02 16:12:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:12:47] [INFO ] Removed a total of 55 redundant transitions.
[2022-06-02 16:12:48] [INFO ] Flatten gal took : 133 ms
[2022-06-02 16:12:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2022-06-02 16:12:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4627702181480874994.gal : 4 ms
[2022-06-02 16:12:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7563886935464283834.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4627702181480874994.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7563886935464283834.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality7563886935464283834.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :82 after 116
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2188 after 2193
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2193 after 2313
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :170476 after 170525
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin732047458460590626
[2022-06-02 16:13:03] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin732047458460590626
Running compilation step : cd /tmp/ltsmin732047458460590626;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 931 ms.
Running link step : cd /tmp/ltsmin732047458460590626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 96 ms.
Running LTSmin : cd /tmp/ltsmin732047458460590626;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'DoubleExponentPT004ReachabilityFireability02==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-02 16:13:18] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11360875662876618115
[2022-06-02 16:13:18] [INFO ] Applying decomposition
[2022-06-02 16:13:18] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-06-02 16:13:18] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:13:18] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-06-02 16:13:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:13:18] [INFO ] Flatten gal took : 9 ms
[2022-06-02 16:13:18] [INFO ] Flatten gal took : 9 ms
[2022-06-02 16:13:18] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-06-02 16:13:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:13:18] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11360875662876618115
Running compilation step : cd /tmp/ltsmin11360875662876618115;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-02 16:13:18] [INFO ] Input system was already deterministic with 125 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3955081564571429155.txt' '-o' '/tmp/graph3955081564571429155.bin' '-w' '/tmp/graph3955081564571429155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3955081564571429155.bin' '-l' '-1' '-v' '-w' '/tmp/graph3955081564571429155.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:13:18] [INFO ] Decomposing Gal with order
[2022-06-02 16:13:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:13:18] [INFO ] Removed a total of 53 redundant transitions.
[2022-06-02 16:13:18] [INFO ] Flatten gal took : 38 ms
[2022-06-02 16:13:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-06-02 16:13:18] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability220831315339403991.gal : 3 ms
[2022-06-02 16:13:18] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10344652570425535605.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability220831315339403991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10344652570425535605.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
[2022-06-02 16:13:18] [INFO ] Ran tautology test, simplified 0 / 1 in 160 ms.
Loading property file /tmp/ReachabilityFireability10344652570425535605.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 14
[2022-06-02 16:13:18] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=0 took 16 ms
[2022-06-02 16:13:18] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=1 took 3 ms
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 17
[2022-06-02 16:13:18] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=2 took 34 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :115 after 138
[2022-06-02 16:13:18] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=3 took 40 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 125 rows 132 cols
[2022-06-02 16:13:18] [INFO ] Computed 17 place invariants in 1 ms
[2022-06-02 16:13:18] [INFO ] Computed 17 place invariants in 2 ms
Compilation finished in 297 ms.
Running link step : cd /tmp/ltsmin11360875662876618115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2022-06-02 16:13:18] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=4 took 49 ms
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin11360875662876618115;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT004ReachabilityFireability02==true'
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2041 after 2272
[2022-06-02 16:13:18] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=5 took 81 ms
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2272 after 2548
[2022-06-02 16:13:18] [INFO ] Proved 132 variables to be positive in 260 ms
[2022-06-02 16:13:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:13:18] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=0 took 50 ms
[2022-06-02 16:13:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:13:19] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=1 took 166 ms
[2022-06-02 16:13:19] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=6 took 1169 ms
[2022-06-02 16:13:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:13:20] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=2 took 1144 ms
[2022-06-02 16:13:21] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=7 took 1647 ms
[2022-06-02 16:13:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:13:22] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=3 took 2513 ms
[2022-06-02 16:13:23] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=8 took 1597 ms
[2022-06-02 16:13:27] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=9 took 4113 ms
[2022-06-02 16:13:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:13:32] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=4 took 9338 ms
[2022-06-02 16:13:34] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=10 took 7211 ms
[2022-06-02 16:13:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:13:48] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=5 took 16356 ms
[2022-06-02 16:13:50] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=11 took 16450 ms
[2022-06-02 16:14:01] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=12 took 10195 ms
[2022-06-02 16:14:16] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=13 took 15095 ms
[2022-06-02 16:14:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:14:21] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=6 took 32791 ms
[2022-06-02 16:14:45] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=14 took 28991 ms
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :793264 after 794082
[2022-06-02 16:15:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:15:14] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=7 took 53240 ms
[2022-06-02 16:15:25] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=15 took 40401 ms
[2022-06-02 16:16:36] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=16 took 70591 ms
[2022-06-02 16:16:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:16:44] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=8 took 90158 ms
[2022-06-02 16:17:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:17:47] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=9 took 63009 ms
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Initializing POR dependencies: labels 126, guards 125
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.040: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 6/ 8), 0.066: "DoubleExponentPT004ReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.062: "DoubleExponentPT004ReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.060: "DoubleExponentPT004ReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.060: There are 126 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.060: State length is 132, there are 125 groups
pins2lts-mc-linux64( 0/ 8), 0.060: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.060: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.060: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.060: Visible groups: 0 / 125, labels: 1 / 126
pins2lts-mc-linux64( 0/ 8), 0.060: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.060: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.061: "DoubleExponentPT004ReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.066: "DoubleExponentPT004ReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.064: "DoubleExponentPT004ReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.063: "DoubleExponentPT004ReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.053: "DoubleExponentPT004ReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.076: ~67 levels ~960 states ~992 transitions
pins2lts-mc-linux64( 0/ 8), 0.081: ~84 levels ~1920 states ~2000 transitions
pins2lts-mc-linux64( 0/ 8), 0.117: ~115 levels ~3840 states ~3864 transitions
pins2lts-mc-linux64( 0/ 8), 0.183: ~227 levels ~7680 states ~7696 transitions
pins2lts-mc-linux64( 0/ 8), 0.287: ~404 levels ~15360 states ~15416 transitions
pins2lts-mc-linux64( 0/ 8), 0.569: ~625 levels ~30720 states ~30936 transitions
pins2lts-mc-linux64( 0/ 8), 0.833: ~979 levels ~61440 states ~61560 transitions
pins2lts-mc-linux64( 0/ 8), 1.357: ~1353 levels ~122880 states ~123416 transitions
pins2lts-mc-linux64( 1/ 8), 2.185: ~1979 levels ~245760 states ~247368 transitions
pins2lts-mc-linux64( 1/ 8), 3.743: ~4912 levels ~491520 states ~492320 transitions
pins2lts-mc-linux64( 1/ 8), 5.849: ~8499 levels ~983040 states ~987304 transitions
pins2lts-mc-linux64( 5/ 8), 9.395: ~16566 levels ~1966080 states ~1974960 transitions
pins2lts-mc-linux64( 1/ 8), 13.591: ~17027 levels ~3932160 states ~3929904 transitions
pins2lts-mc-linux64( 5/ 8), 21.976: ~17951 levels ~7864320 states ~7890272 transitions
pins2lts-mc-linux64( 5/ 8), 38.836: ~19903 levels ~15728640 states ~15717984 transitions
pins2lts-mc-linux64( 1/ 8), 74.057: ~20010 levels ~31457280 states ~31525720 transitions
pins2lts-mc-linux64( 1/ 8), 141.156: ~38548 levels ~62914560 states ~62886888 transitions
pins2lts-mc-linux64( 1/ 8), 279.691: ~49170 levels ~125829120 states ~125816896 transitions
pins2lts-mc-linux64( 0/ 8), 313.728: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 313.757:
pins2lts-mc-linux64( 0/ 8), 313.757: mean standard work distribution: 2.6% (states) 2.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 313.757:
pins2lts-mc-linux64( 0/ 8), 313.757: Explored 133957264 states 134217340 transitions, fanout: 1.002
pins2lts-mc-linux64( 0/ 8), 313.757: Total exploration time 313.690 sec (313.660 sec minimum, 313.676 sec on average)
pins2lts-mc-linux64( 0/ 8), 313.757: States per second: 427037, Transitions per second: 427866
pins2lts-mc-linux64( 0/ 8), 313.757: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 313.757:
pins2lts-mc-linux64( 0/ 8), 313.757: Queue width: 8B, total height: 340786, memory: 2.60MB
pins2lts-mc-linux64( 0/ 8), 313.757: Tree memory: 1155.4MB, 9.0 B/state, compr.: 1.7%
pins2lts-mc-linux64( 0/ 8), 313.757: Tree fill ratio (roots/leafs): 99.0%/51.0%
pins2lts-mc-linux64( 0/ 8), 313.757: Stored 126 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 313.757: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 313.757: Est. total memory use: 1158.0MB (~1026.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11360875662876618115;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT004ReachabilityFireability02==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11360875662876618115;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT004ReachabilityFireability02==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 16:18:34] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=17 took 117810 ms
[2022-06-02 16:18:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:18:51] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=10 took 64127 ms
[2022-06-02 16:19:05] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=18 took 31162 ms
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.47605e+06 after 1.57225e+06
[2022-06-02 16:19:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:19:39] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=11 took 48101 ms
[2022-06-02 16:19:57] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=19 took 52607 ms
[2022-06-02 16:20:18] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=20 took 20392 ms
[2022-06-02 16:20:43] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:20:43] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=12 took 63797 ms
[2022-06-02 16:21:15] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=21 took 57211 ms
[2022-06-02 16:22:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:22:45] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=13 took 121395 ms
[2022-06-02 16:25:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:25:40] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=14 took 175259 ms
[2022-06-02 16:26:02] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=22 took 286521 ms
[2022-06-02 16:26:31] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=23 took 29731 ms
[2022-06-02 16:29:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:29:53] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=15 took 253385 ms
[2022-06-02 16:33:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:33:54] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=16 took 240995 ms
Detected timeout of ITS tools.
[2022-06-02 16:34:04] [INFO ] Applying decomposition
[2022-06-02 16:34:04] [INFO ] Flatten gal took : 8 ms
[2022-06-02 16:34:04] [INFO ] Decomposing Gal with order
[2022-06-02 16:34:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:34:04] [INFO ] Could not find partition element corresponding to p142 in partition [p119, p120, p162, p165],[p169, p171, p175, p181],[p163, p184, p187, p188],[p161, p164],[p166, p198, p199],[p109, p112, p116, p117, p129, p130, p132, p206, p207],[p126, p127, p128, p131],[p110, p134, p135, p150],[p108, p111, p205],[p114, p71, p95, p96],[p122, p124],[p140, p203],[p143, p145, p146],[p159, p160],[p209, p210],[p148, p149],[p189, p190],[p212, p213],[p125, p167],[p176, p191],[p192, p196],[p101, p103, p104, p106, p99],[p10, p11],[p19, p20],[p26, p31, p35],[p33, p34],[p22, p24],[p36, p37, p40, p54],[p43, p45, p46],[p12, p13, p50, p52],[p14, p3, p6],[p16, p8, p9],[p113, p154, p155],[p156, p157, p75],[p66, p67, p69],[p152, p56, p59, p63, p64, p76, p77],[p55, p58],[p92, p93],[p85, p90, p94],[p57, p60, p78, p80, p81, p97],

[2022-06-02 16:34:04] [INFO ] Could not find partition element corresponding to p183 in partition [p119, p120, p162, p165],[p169, p171, p175, p181],[p163, p184, p187, p188],[p161, p164],[p166, p198, p199],[p109, p112, p116, p117, p129, p130, p132, p206, p207],[p126, p127, p128, p131],[p110, p134, p135, p150],[p108, p111, p205],[p114, p71, p95, p96],[p122, p124],[p140, p203],[p143, p145, p146],[p159, p160],[p209, p210],[p148, p149],[p189, p190],[p212, p213],[p125, p167],[p176, p191],[p192, p196],[p101, p103, p104, p106, p99],[p10, p11],[p19, p20],[p26, p31, p35],[p33, p34],[p22, p24],[p36, p37, p40, p54],[p43, p45, p46],[p12, p13, p50, p52],[p14, p3, p6],[p16, p8, p9],[p113, p154, p155],[p156, p157, p75],[p66, p67, p69],[p152, p56, p59, p63, p64, p76, p77],[p55, p58],[p92, p93],[p85, p90, p94],[p57, p60, p78, p80, p81, p97],

[2022-06-02 16:34:04] [INFO ] Could not find partition element corresponding to p193 in partition [p119, p120, p162, p165],[p169, p171, p175, p181],[p163, p184, p187, p188],[p161, p164],[p166, p198, p199],[p109, p112, p116, p117, p129, p130, p132, p206, p207],[p126, p127, p128, p131],[p110, p134, p135, p150],[p108, p111, p205],[p114, p71, p95, p96],[p122, p124],[p140, p203],[p143, p145, p146],[p159, p160],[p209, p210],[p148, p149],[p189, p190],[p212, p213],[p125, p167],[p176, p191],[p192, p196],[p101, p103, p104, p106, p99],[p10, p11],[p19, p20],[p26, p31, p35],[p33, p34],[p22, p24],[p36, p37, p40, p54],[p43, p45, p46],[p12, p13, p50, p52],[p14, p3, p6],[p16, p8, p9],[p113, p154, p155],[p156, p157, p75],[p66, p67, p69],[p152, p56, p59, p63, p64, p76, p77],[p55, p58],[p92, p93],[p85, p90, p94],[p57, p60, p78, p80, p81, p97],

[2022-06-02 16:34:04] [INFO ] Could not find partition element corresponding to p30 in partition [p119, p120, p162, p165],[p169, p171, p175, p181],[p163, p184, p187, p188],[p161, p164],[p166, p198, p199],[p109, p112, p116, p117, p129, p130, p132, p206, p207],[p126, p127, p128, p131],[p110, p134, p135, p150],[p108, p111, p205],[p114, p71, p95, p96],[p122, p124],[p140, p203],[p143, p145, p146],[p159, p160],[p209, p210],[p148, p149],[p189, p190],[p212, p213],[p125, p167],[p176, p191],[p192, p196],[p101, p103, p104, p106, p99],[p10, p11],[p19, p20],[p26, p31, p35],[p33, p34],[p22, p24],[p36, p37, p40, p54],[p43, p45, p46],[p12, p13, p50, p52],[p14, p3, p6],[p16, p8, p9],[p113, p154, p155],[p156, p157, p75],[p66, p67, p69],[p152, p56, p59, p63, p64, p76, p77],[p55, p58],[p92, p93],[p85, p90, p94],[p57, p60, p78, p80, p81, p97],

[2022-06-02 16:34:04] [INFO ] Could not find partition element corresponding to p42 in partition [p119, p120, p162, p165],[p169, p171, p175, p181],[p163, p184, p187, p188],[p161, p164],[p166, p198, p199],[p109, p112, p116, p117, p129, p130, p132, p206, p207],[p126, p127, p128, p131],[p110, p134, p135, p150],[p108, p111, p205],[p114, p71, p95, p96],[p122, p124],[p140, p203],[p143, p145, p146],[p159, p160],[p209, p210],[p148, p149],[p189, p190],[p212, p213],[p125, p167],[p176, p191],[p192, p196],[p101, p103, p104, p106, p99],[p10, p11],[p19, p20],[p26, p31, p35],[p33, p34],[p22, p24],[p36, p37, p40, p54],[p43, p45, p46],[p12, p13, p50, p52],[p14, p3, p6],[p16, p8, p9],[p113, p154, p155],[p156, p157, p75],[p66, p67, p69],[p152, p56, p59, p63, p64, p76, p77],[p55, p58],[p92, p93],[p85, p90, p94],[p57, p60, p78, p80, p81, p97],

[2022-06-02 16:34:04] [INFO ] Could not find partition element corresponding to p89 in partition [p119, p120, p162, p165],[p169, p171, p175, p181],[p163, p184, p187, p188],[p161, p164],[p166, p198, p199],[p109, p112, p116, p117, p129, p130, p132, p206, p207],[p126, p127, p128, p131],[p110, p134, p135, p150],[p108, p111, p205],[p114, p71, p95, p96],[p122, p124],[p140, p203],[p143, p145, p146],[p159, p160],[p209, p210],[p148, p149],[p189, p190],[p212, p213],[p125, p167],[p176, p191],[p192, p196],[p101, p103, p104, p106, p99],[p10, p11],[p19, p20],[p26, p31, p35],[p33, p34],[p22, p24],[p36, p37, p40, p54],[p43, p45, p46],[p12, p13, p50, p52],[p14, p3, p6],[p16, p8, p9],[p113, p154, p155],[p156, p157, p75],[p66, p67, p69],[p152, p56, p59, p63, p64, p76, p77],[p55, p58],[p92, p93],[p85, p90, p94],[p57, p60, p78, p80, p81, p97],

[2022-06-02 16:34:04] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.ArrayIndexOutOfBoundsException: Index -1 out of bounds for length 52
at org.eclipse.emf.common.util.BasicEList.get(BasicEList.java:348)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:564)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:231)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:116)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:957)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-02 16:34:04] [INFO ] Flatten gal took : 7 ms
[2022-06-02 16:34:04] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13335416806358081877.gal : 3 ms
[2022-06-02 16:34:04] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4452968329041008191.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability13335416806358081877.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4452968329041008191.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityFireability4452968329041008191.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5 after 15
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :15 after 31
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31 after 54
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :54 after 110
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :110 after 449
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :449 after 1212
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1212 after 4988
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4988 after 60076
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :60076 after 334134
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :334134 after 936630
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :936630 after 1.48024e+07
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.48024e+07 after 3.22992e+08
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :3.22992e+08 after 1.64386e+09
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.64386e+09 after 6.05221e+09
[2022-06-02 16:34:46] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=24 took 494487 ms
[2022-06-02 16:35:27] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=25 took 40830 ms
Invariant property DoubleExponent-PT-004-ReachabilityFireability-02 does not hold.
FORMULA DoubleExponent-PT-004-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 262145 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_inst,1.58402e+10,102.617,1375564,2,332677,24,3.09224e+06,6,0,655,2.67796e+06,0
Total reachable state count : 15840156088

Verifying 1 reachability properties.
[2022-06-02 16:36:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityFireability-02
[2022-06-02 16:36:19] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityFireability-02(SAT) depth K=17 took 144535 ms
[2022-06-02 16:37:47] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityFireability-02(UNSAT) depth K=26 took 140638 ms
[2022-06-02 16:37:47] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2630734 ms.

BK_STOP 1654188890761

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 r078-tall-165260110000191"
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 ;