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-158922814800774.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814800774
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590135047388

[2020-05-22 08:10:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 08:10:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 08:10:49] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-05-22 08:10:49] [INFO ] Transformed 216 places.
[2020-05-22 08:10:49] [INFO ] Transformed 198 transitions.
[2020-05-22 08:10:49] [INFO ] Parsed PT model containing 216 places and 198 transitions in 102 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 332 resets, run finished after 101 ms. (steps per millisecond=99 ) 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 278 resets, run finished after 39 ms. (steps per millisecond=256 ) 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 276 resets, run finished after 45 ms. (steps per millisecond=222 ) 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 275 resets, run finished after 32 ms. (steps per millisecond=312 ) 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 280 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 10001 steps, including 277 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 284 resets, run finished after 24 ms. (steps per millisecond=416 ) 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 277 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 10000 steps, including 282 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 289 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]
Incomplete Best-First random walk after 10001 steps, including 285 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 10000 steps, including 286 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 282 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 10000 steps, including 289 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]
Incomplete Best-First random walk after 10001 steps, including 286 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]
Incomplete Best-First random walk after 10000 steps, including 281 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]
Incomplete Best-First random walk after 10000 steps, including 276 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, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1]
Probabilistic random walk after 1107687 steps, saw 553820 distinct states, run finished after 3449 ms. (steps per millisecond=321 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1]
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Interrupted probabilistic random walk after 9425918 steps, run timeout after 30167 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
Exhaustive walk after 9425918 steps, saw 4712663 distinct states, run finished after 30168 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
// Phase 1: matrix 198 rows 216 cols
[2020-05-22 08:11:24] [INFO ] Computed 24 place invariants in 17 ms
[2020-05-22 08:11:24] [INFO ] [Real]Absence check using 3 positive place invariants in 27 ms returned sat
[2020-05-22 08:11:24] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned unsat
[2020-05-22 08:11:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2020-05-22 08:11:24] [INFO ] [Real]Absence check using 3 positive place invariants in 33 ms returned sat
[2020-05-22 08:11:24] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned unsat
[2020-05-22 08:11:24] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:11:24] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 34 ms returned sat
[2020-05-22 08:11:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:11:24] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2020-05-22 08:11:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:11:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned unsat
[2020-05-22 08:11:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-05-22 08:11:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-22 08:11:24] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2020-05-22 08:11:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:11:24] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-05-22 08:11:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:11:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned unsat
[2020-05-22 08:11:25] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2020-05-22 08:11:25] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned unsat
[2020-05-22 08:11:25] [INFO ] [Real]Absence check using 3 positive place invariants in 29 ms returned sat
[2020-05-22 08:11:25] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 26 ms returned unsat
[2020-05-22 08:11:25] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2020-05-22 08:11:25] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 115 ms returned sat
[2020-05-22 08:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:11:25] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2020-05-22 08:11:25] [INFO ] Deduced a trap composed of 54 places in 94 ms
[2020-05-22 08:11:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2020-05-22 08:11:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:11:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:11:25] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 62 ms returned sat
[2020-05-22 08:11:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:11:26] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2020-05-22 08:11:26] [INFO ] Deduced a trap composed of 54 places in 69 ms
[2020-05-22 08:11:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2020-05-22 08:11:26] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 37 ms.
[2020-05-22 08:11:26] [INFO ] Added : 195 causal constraints over 41 iterations in 732 ms. Result :sat
[2020-05-22 08:11:26] [INFO ] Deduced a trap composed of 41 places in 50 ms
[2020-05-22 08:11:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-05-22 08:11:27] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned unsat
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 209800 steps, including 7466 resets, run finished after 174 ms. (steps per millisecond=1205 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 198/198 transitions.
Discarding 5 places :
Also discarding 0 output transitions
Graph (complete) has 360 edges and 216 vertex of which 211 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.28 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 210 transition count 150
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 97 place count 163 transition count 150
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 97 place count 163 transition count 144
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 109 place count 157 transition count 144
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 189 place count 117 transition count 104
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 111 transition count 104
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 215 place count 111 transition count 90
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 229 place count 97 transition count 90
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 245 place count 97 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 96 transition count 89
Applied a total of 246 rules in 106 ms. Remains 96 /216 variables (removed 120) and now considering 89/198 (removed 109) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/216 places, 89/198 transitions.
Incomplete random walk after 1000000 steps, including 128448 resets, run finished after 843 ms. (steps per millisecond=1186 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 84701 resets, run finished after 514 ms. (steps per millisecond=1945 ) properties seen :[0]
Interrupted probabilistic random walk after 14283310 steps, run timeout after 30001 ms. (steps per millisecond=476 ) properties seen :[0]
Probabilistic random walk after 14283310 steps, saw 7138680 distinct states, run finished after 30001 ms. (steps per millisecond=476 ) properties seen :[0]
// Phase 1: matrix 89 rows 96 cols
[2020-05-22 08:11:58] [INFO ] Computed 20 place invariants in 3 ms
[2020-05-22 08:11:58] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2020-05-22 08:11:58] [INFO ] [Real]Absence check using 2 positive and 18 generalized place invariants in 9 ms returned sat
[2020-05-22 08:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:11:58] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2020-05-22 08:11:58] [INFO ] State equation strengthened by 15 read => feed constraints.
[2020-05-22 08:11:58] [INFO ] [Real]Added 15 Read/Feed constraints in 6 ms returned sat
[2020-05-22 08:11:58] [INFO ] Computed and/alt/rep : 88/495/88 causal constraints in 12 ms.
[2020-05-22 08:11:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:11:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-05-22 08:11:58] [INFO ] [Nat]Absence check using 2 positive and 18 generalized place invariants in 9 ms returned sat
[2020-05-22 08:11:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:11:59] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2020-05-22 08:11:59] [INFO ] [Nat]Added 15 Read/Feed constraints in 6 ms returned sat
[2020-05-22 08:11:59] [INFO ] Computed and/alt/rep : 88/495/88 causal constraints in 12 ms.
[2020-05-22 08:11:59] [INFO ] Added : 87 causal constraints over 18 iterations in 359 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
Incomplete Parikh walk after 164900 steps, including 24975 resets, run finished after 231 ms. (steps per millisecond=713 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 89/89 transitions.
Applied a total of 0 rules in 6 ms. Remains 96 /96 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 89/89 transitions.
Starting structural reductions, iteration 0 : 96/96 places, 89/89 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 89/89 (removed 0) transitions.
// Phase 1: matrix 89 rows 96 cols
[2020-05-22 08:11:59] [INFO ] Computed 20 place invariants in 2 ms
[2020-05-22 08:11:59] [INFO ] Implicit Places using invariants in 166 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
[2020-05-22 08:11:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 89 rows 95 cols
[2020-05-22 08:11:59] [INFO ] Computed 19 place invariants in 3 ms
[2020-05-22 08:12:00] [INFO ] Dead Transitions using invariants and state equation in 222 ms returned []
Starting structural reductions, iteration 1 : 95/96 places, 89/89 transitions.
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 94 transition count 88
Applied a total of 3 rules in 17 ms. Remains 94 /95 variables (removed 1) and now considering 88/89 (removed 1) transitions.
// Phase 1: matrix 88 rows 94 cols
[2020-05-22 08:12:00] [INFO ] Computed 19 place invariants in 2 ms
[2020-05-22 08:12:00] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 88 rows 94 cols
[2020-05-22 08:12:00] [INFO ] Computed 19 place invariants in 3 ms
[2020-05-22 08:12:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2020-05-22 08:12:00] [INFO ] Implicit Places using invariants and state equation in 201 ms returned [20, 26, 62, 67, 85, 91]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 358 ms to find 6 implicit places.
Starting structural reductions, iteration 2 : 88/96 places, 88/89 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 88 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 85
Applied a total of 6 rules in 5 ms. Remains 85 /88 variables (removed 3) and now considering 85/88 (removed 3) transitions.
// Phase 1: matrix 85 rows 85 cols
[2020-05-22 08:12:00] [INFO ] Computed 13 place invariants in 1 ms
[2020-05-22 08:12:00] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 85 rows 85 cols
[2020-05-22 08:12:00] [INFO ] Computed 13 place invariants in 1 ms
[2020-05-22 08:12:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2020-05-22 08:12:00] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 85/96 places, 85/89 transitions.
Incomplete random walk after 1000000 steps, including 144480 resets, run finished after 730 ms. (steps per millisecond=1369 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 91713 resets, run finished after 442 ms. (steps per millisecond=2262 ) properties seen :[0]
Interrupted probabilistic random walk after 15624790 steps, run timeout after 30001 ms. (steps per millisecond=520 ) properties seen :[0]
Probabilistic random walk after 15624790 steps, saw 7808544 distinct states, run finished after 30001 ms. (steps per millisecond=520 ) properties seen :[0]
// Phase 1: matrix 85 rows 85 cols
[2020-05-22 08:12:31] [INFO ] Computed 13 place invariants in 1 ms
[2020-05-22 08:12:32] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-05-22 08:12:32] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 7 ms returned sat
[2020-05-22 08:12:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:12:32] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2020-05-22 08:12:32] [INFO ] State equation strengthened by 14 read => feed constraints.
[2020-05-22 08:12:32] [INFO ] [Real]Added 14 Read/Feed constraints in 3 ms returned sat
[2020-05-22 08:12:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:12:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-05-22 08:12:32] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 16 ms returned sat
[2020-05-22 08:12:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:12:32] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2020-05-22 08:12:32] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2020-05-22 08:12:32] [INFO ] Deduced a trap composed of 11 places in 45 ms
[2020-05-22 08:12:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2020-05-22 08:12:32] [INFO ] Computed and/alt/rep : 84/461/84 causal constraints in 6 ms.
[2020-05-22 08:12:32] [INFO ] Added : 83 causal constraints over 17 iterations in 232 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 55200 steps, including 9215 resets, run finished after 54 ms. (steps per millisecond=1022 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 85/85 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 85 cols
[2020-05-22 08:12:32] [INFO ] Computed 13 place invariants in 1 ms
[2020-05-22 08:12:32] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 85 rows 85 cols
[2020-05-22 08:12:32] [INFO ] Computed 13 place invariants in 2 ms
[2020-05-22 08:12:32] [INFO ] State equation strengthened by 14 read => feed constraints.
[2020-05-22 08:12:32] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2020-05-22 08:12:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 85 rows 85 cols
[2020-05-22 08:12:32] [INFO ] Computed 13 place invariants in 1 ms
[2020-05-22 08:12:33] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 85/85 transitions.
Incomplete random walk after 100000 steps, including 14566 resets, run finished after 69 ms. (steps per millisecond=1449 ) properties seen :[0]
// Phase 1: matrix 85 rows 85 cols
[2020-05-22 08:12:33] [INFO ] Computed 13 place invariants in 1 ms
[2020-05-22 08:12:33] [INFO ] [Real]Absence check using 2 positive place invariants in 24 ms returned sat
[2020-05-22 08:12:33] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2020-05-22 08:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:12:33] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-05-22 08:12:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2020-05-22 08:12:33] [INFO ] [Real]Added 14 Read/Feed constraints in 3 ms returned sat
[2020-05-22 08:12:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:12:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:12:33] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 6 ms returned sat
[2020-05-22 08:12:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:12:33] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2020-05-22 08:12:33] [INFO ] [Nat]Added 14 Read/Feed constraints in 5 ms returned sat
[2020-05-22 08:12:33] [INFO ] Deduced a trap composed of 11 places in 34 ms
[2020-05-22 08:12:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2020-05-22 08:12:33] [INFO ] Computed and/alt/rep : 84/461/84 causal constraints in 7 ms.
[2020-05-22 08:12:33] [INFO ] Added : 83 causal constraints over 17 iterations in 221 ms. Result :sat
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 85 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 84 transition count 84
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 84 transition count 78
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 78 transition count 78
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 78 transition count 78
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 75 transition count 75
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 75 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 74 transition count 74
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 74 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 73 transition count 73
Applied a total of 27 rules in 11 ms. Remains 73 /85 variables (removed 12) and now considering 73/85 (removed 12) transitions.
// Phase 1: matrix 73 rows 73 cols
[2020-05-22 08:12:33] [INFO ] Computed 13 place invariants in 1 ms
[2020-05-22 08:12:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2020-05-22 08:12:33] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 54 ms returned sat
[2020-05-22 08:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:12:33] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-05-22 08:12:33] [INFO ] Deduced a trap composed of 14 places in 38 ms
[2020-05-22 08:12:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2020-05-22 08:12:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:12:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-05-22 08:12:33] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2020-05-22 08:12:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:12:33] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-05-22 08:12:33] [INFO ] Deduced a trap composed of 14 places in 55 ms
[2020-05-22 08:12:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2020-05-22 08:12:33] [INFO ] Computed and/alt/rep : 72/399/72 causal constraints in 6 ms.
[2020-05-22 08:12:34] [INFO ] Added : 71 causal constraints over 15 iterations in 183 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2020-05-22 08:12:34] [INFO ] Flatten gal took : 66 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 08:12:34] [INFO ] Applying decomposition
[2020-05-22 08:12:34] [INFO ] Flatten gal took : 28 ms
[2020-05-22 08:12:34] [INFO ] Flatten gal took : 43 ms
[2020-05-22 08:12:34] [INFO ] Input system was already deterministic with 85 transitions.
[2020-05-22 08:12:34] [INFO ] Input system was already deterministic with 85 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph13037275245232351120.txt, -o, /tmp/graph13037275245232351120.bin, -w, /tmp/graph13037275245232351120.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/graph13037275245232351120.bin, -l, -1, -v, -w, /tmp/graph13037275245232351120.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 08:12:34] [INFO ] Decomposing Gal with order
[2020-05-22 08:12:34] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
[2020-05-22 08:12:34] [INFO ] Removed a total of 39 redundant transitions.
// Phase 1: matrix 85 rows 85 cols
[2020-05-22 08:12:34] [INFO ] Computed 13 place invariants in 12 ms
inv : p108 - p109 + p111 - p112 = 0
inv : p104 + p106 + p22 + p24 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 = 0
inv : p8 + p9 = 2
inv : p12 + p13 - p34 - p46 = 2
inv : p189 + p201 - p203 - p205 - p207 - p210 - p212 - p213 = 0
inv : -p101 + p157 + p159 + p22 + p24 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 + p69 + p71 - p75 - p77 - p78 - p81 - p87 - p89 - p90 - p93 - p99 = 0
inv : p55 - p57 + p58 - p60 + p81 + p93 = 0
inv : p161 - p163 + p164 - p166 + p187 + p199 = 0
inv : p101 - p109 + p110 - p112 + p113 - p122 - p124 + p128 + p130 + p131 + p140 + p142 + p143 + p152 + p154 - p210 - p212 - p22 - p24 + p28 + p30 + p31 + p34 + p40 + p42 + p43 + p46 + p52 + p54 - p69 - p71 + p75 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p99 = 0
inv : p56 - p57 + p59 - p60 + p81 + p93 = 0
inv : p10 + p11 = 2
inv : p101 - p122 - p124 + p128 + p130 + p131 + p134 + p140 + p142 + p143 + p146 + p152 + p154 - p210 - p212 - p22 - p24 + p28 + p30 + p31 + p34 + p40 + p42 + p43 + p46 + p52 + p54 - p69 - p71 + p75 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p99 = 0
inv : p162 - p163 + p165 - p166 + p187 + p199 = 0
Total of 13 invariants.
[2020-05-22 08:12:34] [INFO ] Computed 13 place invariants in 13 ms
[2020-05-22 08:12:34] [INFO ] Ran tautology test, simplified 0 / 1 in 349 ms.
[2020-05-22 08:12:34] [INFO ] Flatten gal took : 105 ms
[2020-05-22 08:12:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 7 ms.
[2020-05-22 08:12:35] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=0 took 71 ms
[2020-05-22 08:12:35] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 33 ms
[2020-05-22 08:12:35] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
[2020-05-22 08:12:35] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=1 took 38 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/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : DoubleExponent-PT-004-ReachabilityCardinality-10 with value :((gi1.gi1.gu1.p213>=1)&&(gu10.p58<=gu10.p180))
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
[2020-05-22 08:12:35] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=2 took 47 ms
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
SDD proceeding with computation, new max is 256
// Phase 1: matrix 85 rows 85 cols
[2020-05-22 08:12:35] [INFO ] Computed 13 place invariants in 14 ms
inv : p108 - p109 + p111 - p112 = 0
inv : p104 + p106 + p22 + p24 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 = 0
inv : p8 + p9 = 2
inv : p12 + p13 - p34 - p46 = 2
inv : p189 + p201 - p203 - p205 - p207 - p210 - p212 - p213 = 0
inv : -p101 + p157 + p159 + p22 + p24 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 + p69 + p71 - p75 - p77 - p78 - p81 - p87 - p89 - p90 - p93 - p99 = 0
inv : p55 - p57 + p58 - p60 + p81 + p93 = 0
inv : p161 - p163 + p164 - p166 + p187 + p199 = 0
inv : p101 - p109 + p110 - p112 + p113 - p122 - p124 + p128 + p130 + p131 + p140 + p142 + p143 + p152 + p154 - p210 - p212 - p22 - p24 + p28 + p30 + p31 + p34 + p40 + p42 + p43 + p46 + p52 + p54 - p69 - p71 + p75 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p99 = 0
inv : p56 - p57 + p59 - p60 + p81 + p93 = 0
inv : p10 + p11 = 2
inv : p101 - p122 - p124 + p128 + p130 + p131 + p134 + p140 + p142 + p143 + p146 + p152 + p154 - p210 - p212 - p22 - p24 + p28 + p30 + p31 + p34 + p40 + p42 + p43 + p46 + p52 + p54 - p69 - p71 + p75 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p99 = 0
inv : p162 - p163 + p165 - p166 + p187 + p199 = 0
Total of 13 invariants.
[2020-05-22 08:12:35] [INFO ] Computed 13 place invariants in 15 ms
SDD proceeding with computation, new max is 512
[2020-05-22 08:12:35] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=3 took 35 ms
SDD proceeding with computation, new max is 1024
[2020-05-22 08:12:35] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=4 took 56 ms
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
[2020-05-22 08:12:35] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=5 took 125 ms
SDD proceeding with computation, new max is 8192
[2020-05-22 08:12:35] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=6 took 267 ms
[2020-05-22 08:12:35] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=7 took 84 ms
[2020-05-22 08:12:35] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=8 took 190 ms
[2020-05-22 08:12:35] [INFO ] Proved 85 variables to be positive in 1099 ms
[2020-05-22 08:12:35] [INFO ] Computing symmetric may disable matrix : 85 transitions.
[2020-05-22 08:12:35] [INFO ] Computation of disable matrix completed :0/85 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:12:35] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:12:35] [INFO ] Computing symmetric may enable matrix : 85 transitions.
[2020-05-22 08:12:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:12:35] [INFO ] Proved 85 variables to be positive in 841 ms
[2020-05-22 08:12:36] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-10
[2020-05-22 08:12:36] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(SAT) depth K=0 took 9 ms
[2020-05-22 08:12:36] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-10
[2020-05-22 08:12:36] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(SAT) depth K=1 took 51 ms
[2020-05-22 08:12:36] [INFO ] Computing symmetric co enabling matrix : 85 transitions.
[2020-05-22 08:12:36] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-10
[2020-05-22 08:12:36] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(SAT) depth K=2 took 668 ms
SDD proceeding with computation, new max is 16384
[2020-05-22 08:12:37] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=9 took 1428 ms
[2020-05-22 08:12:38] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=10 took 695 ms
[2020-05-22 08:12:38] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=11 took 823 ms
[2020-05-22 08:12:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-10
[2020-05-22 08:12:38] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(SAT) depth K=3 took 2131 ms
[2020-05-22 08:12:39] [INFO ] Computation of co-enabling matrix(37/85) took 2832 ms. Total solver calls (SAT/UNSAT): 1279(1279/0)
[2020-05-22 08:12:41] [INFO ] Computation of Finished co-enabling matrix. took 5432 ms. Total solver calls (SAT/UNSAT): 2046(2046/0)
[2020-05-22 08:12:41] [INFO ] Computing Do-Not-Accords matrix : 85 transitions.
[2020-05-22 08:12:43] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-10
[2020-05-22 08:12:43] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(SAT) depth K=4 took 4704 ms
[2020-05-22 08:12:48] [INFO ] Computation of Completed DNA matrix. took 7156 ms. Total solver calls (SAT/UNSAT): 369(0/369)
[2020-05-22 08:12:48] [INFO ] Built C files in 14222ms 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:12:49] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=12 took 10449 ms
[2020-05-22 08:12:51] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=13 took 1766 ms
Compilation finished in 2422 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 80 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT004ReachabilityCardinality10==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, DoubleExponentPT004ReachabilityCardinality10==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, DoubleExponentPT004ReachabilityCardinality10==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:12:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-10
[2020-05-22 08:12:52] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(SAT) depth K=5 took 9343 ms
[2020-05-22 08:12:54] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=14 took 3498 ms
[2020-05-22 08:12:56] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=15 took 1422 ms
SDD proceeding with computation, new max is 32768
[2020-05-22 08:13:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-10
[2020-05-22 08:13:07] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(SAT) depth K=6 took 14502 ms
[2020-05-22 08:13:08] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=16 took 12882 ms
[2020-05-22 08:13:16] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=17 took 7708 ms
[2020-05-22 08:13:20] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=18 took 3703 ms
[2020-05-22 08:13:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-10
[2020-05-22 08:13:25] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(SAT) depth K=7 took 17973 ms
[2020-05-22 08:13:29] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=19 took 8753 ms
[2020-05-22 08:13:35] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=20 took 6776 ms
SDD proceeding with computation, new max is 65536
[2020-05-22 08:13:45] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=21 took 9139 ms
SDD proceeding with computation, new max is 131072
[2020-05-22 08:13:52] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-10(UNSAT) depth K=22 took 7633 ms
Reachability property DoubleExponent-PT-004-ReachabilityCardinality-10 is true.
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-10 TRUE 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 131073 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\_mod\_flatf,4.40791e+08,85.4955,715860,2,102724,25,1.99728e+06,6,0,450,1.40418e+06,0
Total reachable state count : 440791273

Verifying 1 reachability properties.
Reachability property DoubleExponent-PT-004-ReachabilityCardinality-10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-004-ReachabilityCardinality-10,1,85.7339,715860,2,86,25,1.99728e+06,7,0,457,1.40418e+06,0
[2020-05-22 08:14:01] [WARNING] Interrupting SMT solver.
[2020-05-22 08:14:01] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-22 08:14:01] [WARNING] Unexpected error occurred while running SMT. Was verifying DoubleExponent-PT-004-ReachabilityCardinality-10 K-induction depth 8
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-22 08:14:01] [WARNING] Unexpected error occurred while running SMT. Was verifying DoubleExponent-PT-004-ReachabilityCardinality-10 SMT depth 23
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-22 08:14:01] [INFO ] During BMC, SMT solver timed out at depth 23
[2020-05-22 08:14:01] [INFO ] BMC solving timed out (3600000 secs) at depth 23
[2020-05-22 08:14:01] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.

BK_STOP 1590135241831

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-004"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-004, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922814800774"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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