fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r006-smll-158897515500048
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for ASLink-PT-03a

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.520 412122.00 458195.00 1301.40 TFTTTTFFTFFTTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r006-smll-158897515500048.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 ASLink-PT-03a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-smll-158897515500048
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 3.3K Mar 25 09:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 25 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 09:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 09:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 8 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 25 09:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 09:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 25 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 09:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 25 09:04 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 357K 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 ASLink-PT-03a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589235874786

[2020-05-11 22:24:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-11 22:24:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 22:24:37] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2020-05-11 22:24:37] [INFO ] Transformed 821 places.
[2020-05-11 22:24:37] [INFO ] Transformed 1281 transitions.
[2020-05-11 22:24:37] [INFO ] Found NUPN structural information;
[2020-05-11 22:24:37] [INFO ] Parsed PT model containing 821 places and 1281 transitions in 290 ms.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 87 resets, run finished after 131 ms. (steps per millisecond=76 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1]
FORMULA ASLink-PT-03a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1268 rows 821 cols
[2020-05-11 22:24:37] [INFO ] Computed 156 place invariants in 91 ms
[2020-05-11 22:24:38] [INFO ] [Real]Absence check using 36 positive place invariants in 66 ms returned sat
[2020-05-11 22:24:38] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 101 ms returned sat
[2020-05-11 22:24:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:24:41] [INFO ] [Real]Absence check using state equation in 3147 ms returned sat
[2020-05-11 22:24:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:24:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 110 ms returned sat
[2020-05-11 22:24:42] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 121 ms returned sat
[2020-05-11 22:24:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:24:42] [INFO ] [Nat]Absence check using state equation in 510 ms returned unsat
[2020-05-11 22:24:42] [INFO ] [Real]Absence check using 36 positive place invariants in 52 ms returned sat
[2020-05-11 22:24:43] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 101 ms returned sat
[2020-05-11 22:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:24:45] [INFO ] [Real]Absence check using state equation in 2969 ms returned sat
[2020-05-11 22:24:46] [INFO ] Computed and/alt/rep : 1267/15825/1267 causal constraints in 202 ms.
[2020-05-11 22:24:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:24:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 68 ms returned sat
[2020-05-11 22:24:47] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 98 ms returned sat
[2020-05-11 22:24:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:24:50] [INFO ] [Nat]Absence check using state equation in 3042 ms returned sat
[2020-05-11 22:24:50] [INFO ] Computed and/alt/rep : 1267/15825/1267 causal constraints in 166 ms.
[2020-05-11 22:24:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t72 0) (or (and (> t0 0) (< o0 o72)) (and (> t1 0) (< o1 o72)) (and (> t2 0) (< o2 o72)) (and (> t3 0) (< o3 o72)) (and (> t4 0) (< o4 o72)) (and (> t34 0) (< o34 o72)) (and (> t1237 0) (< o1237 o72)) (and (> t1238 0) (< o1238 o72))))") while checking expression at index 1
[2020-05-11 22:24:51] [INFO ] [Real]Absence check using 36 positive place invariants in 58 ms returned sat
[2020-05-11 22:24:52] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 99 ms returned sat
[2020-05-11 22:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:24:55] [INFO ] [Real]Absence check using state equation in 3043 ms returned sat
[2020-05-11 22:24:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:24:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 83 ms returned sat
[2020-05-11 22:24:55] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 101 ms returned sat
[2020-05-11 22:24:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:24:57] [INFO ] [Nat]Absence check using state equation in 1585 ms returned unsat
[2020-05-11 22:24:57] [INFO ] [Real]Absence check using 36 positive place invariants in 54 ms returned sat
[2020-05-11 22:24:57] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 111 ms returned sat
[2020-05-11 22:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:00] [INFO ] [Real]Absence check using state equation in 2785 ms returned sat
[2020-05-11 22:25:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:25:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 73 ms returned sat
[2020-05-11 22:25:00] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 104 ms returned sat
[2020-05-11 22:25:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:03] [INFO ] [Nat]Absence check using state equation in 2596 ms returned unsat
[2020-05-11 22:25:03] [INFO ] [Real]Absence check using 36 positive place invariants in 54 ms returned sat
[2020-05-11 22:25:03] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 100 ms returned sat
[2020-05-11 22:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:06] [INFO ] [Real]Absence check using state equation in 3010 ms returned sat
[2020-05-11 22:25:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:25:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 65 ms returned sat
[2020-05-11 22:25:06] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 97 ms returned sat
[2020-05-11 22:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:07] [INFO ] [Nat]Absence check using state equation in 444 ms returned unsat
[2020-05-11 22:25:07] [INFO ] [Real]Absence check using 36 positive place invariants in 86 ms returned sat
[2020-05-11 22:25:07] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 8 ms returned unsat
[2020-05-11 22:25:07] [INFO ] [Real]Absence check using 36 positive place invariants in 56 ms returned sat
[2020-05-11 22:25:07] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 106 ms returned sat
[2020-05-11 22:25:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:11] [INFO ] [Real]Absence check using state equation in 3305 ms returned sat
[2020-05-11 22:25:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:25:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 68 ms returned sat
[2020-05-11 22:25:11] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 102 ms returned sat
[2020-05-11 22:25:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:14] [INFO ] [Nat]Absence check using state equation in 2863 ms returned sat
[2020-05-11 22:25:14] [INFO ] Deduced a trap composed of 128 places in 410 ms
[2020-05-11 22:25:15] [INFO ] Deduced a trap composed of 24 places in 193 ms
[2020-05-11 22:25:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1346 ms
[2020-05-11 22:25:16] [INFO ] Computed and/alt/rep : 1267/15825/1267 causal constraints in 181 ms.
[2020-05-11 22:25:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t3 0) (and (and (> t123 0) (< o123 o3)) (and (> t1253 0) (< o1253 o3))))") while checking expression at index 6
[2020-05-11 22:25:16] [INFO ] [Real]Absence check using 36 positive place invariants in 54 ms returned sat
[2020-05-11 22:25:16] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 126 ms returned sat
[2020-05-11 22:25:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:19] [INFO ] [Real]Absence check using state equation in 3263 ms returned sat
[2020-05-11 22:25:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:25:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 83 ms returned sat
[2020-05-11 22:25:20] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 143 ms returned sat
[2020-05-11 22:25:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:22] [INFO ] [Nat]Absence check using state equation in 2335 ms returned unsat
[2020-05-11 22:25:23] [INFO ] [Real]Absence check using 36 positive place invariants in 81 ms returned sat
[2020-05-11 22:25:23] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 160 ms returned sat
[2020-05-11 22:25:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:26] [INFO ] [Real]Absence check using state equation in 3660 ms returned sat
[2020-05-11 22:25:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:25:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 67 ms returned sat
[2020-05-11 22:25:27] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 105 ms returned sat
[2020-05-11 22:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:29] [INFO ] [Nat]Absence check using state equation in 2296 ms returned unsat
[2020-05-11 22:25:29] [INFO ] [Real]Absence check using 36 positive place invariants in 52 ms returned sat
[2020-05-11 22:25:29] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 115 ms returned sat
[2020-05-11 22:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:33] [INFO ] [Real]Absence check using state equation in 3371 ms returned sat
[2020-05-11 22:25:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:25:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 103 ms returned sat
[2020-05-11 22:25:33] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 160 ms returned sat
[2020-05-11 22:25:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:37] [INFO ] [Nat]Absence check using state equation in 3719 ms returned sat
[2020-05-11 22:25:37] [INFO ] Computed and/alt/rep : 1267/15825/1267 causal constraints in 188 ms.
[2020-05-11 22:25:38] [INFO ] Added : 20 causal constraints over 4 iterations in 670 ms. Result :(error "Failed to check-sat")
[2020-05-11 22:25:38] [INFO ] [Real]Absence check using 36 positive place invariants in 67 ms returned sat
[2020-05-11 22:25:38] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 107 ms returned sat
[2020-05-11 22:25:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:42] [INFO ] [Real]Absence check using state equation in 3627 ms returned sat
[2020-05-11 22:25:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:25:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 71 ms returned sat
[2020-05-11 22:25:42] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 96 ms returned sat
[2020-05-11 22:25:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:47] [INFO ] [Nat]Absence check using state equation in 4708 ms returned (error "Solver has unexpectedly terminated")
FORMULA ASLink-PT-03a-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 10 out of 821 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 11 places
Discarding 6 places :
Implicit places reduction removed 6 places
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 804 transition count 1200
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 153 place count 736 transition count 1200
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 153 place count 736 transition count 1131
Deduced a syphon composed of 69 places in 5 ms
Ensure Unique test removed 27 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 318 place count 640 transition count 1131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 319 place count 640 transition count 1130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 320 place count 639 transition count 1130
Symmetric choice reduction at 4 with 5 rule applications. Total rules 325 place count 639 transition count 1130
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 23 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 335 place count 634 transition count 1107
Ensure Unique test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 7 rules applied. Total rules applied 342 place count 632 transition count 1102
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 345 place count 629 transition count 1102
Symmetric choice reduction at 6 with 1 rule applications. Total rules 346 place count 629 transition count 1102
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 628 transition count 1094
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 390 place count 607 transition count 1073
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 393 place count 607 transition count 1070
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 396 place count 604 transition count 1070
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 399 place count 604 transition count 1070
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 402 place count 604 transition count 1070
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 403 place count 603 transition count 1069
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 408 place count 598 transition count 1069
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 408 place count 598 transition count 1063
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 420 place count 592 transition count 1063
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 421 place count 591 transition count 1063
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 427 place count 588 transition count 1060
Symmetric choice reduction at 9 with 1 rule applications. Total rules 428 place count 588 transition count 1060
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 430 place count 587 transition count 1059
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 431 place count 587 transition count 1058
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 432 place count 586 transition count 1058
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 434 place count 586 transition count 1058
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 435 place count 586 transition count 1058
Applied a total of 435 rules in 666 ms. Remains 586 /821 variables (removed 235) and now considering 1058/1268 (removed 210) transitions.
Finished structural reductions, in 1 iterations. Remains : 586/821 places, 1058/1268 transitions.
Incomplete random walk after 1000000 steps, including 14746 resets, run finished after 3970 ms. (steps per millisecond=251 ) properties seen :[1, 0, 0, 0]
FORMULA ASLink-PT-03a-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 4114 resets, run finished after 1660 ms. (steps per millisecond=602 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4147 resets, run finished after 1607 ms. (steps per millisecond=622 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4139 resets, run finished after 1645 ms. (steps per millisecond=607 ) properties seen :[0, 0, 0]
// Phase 1: matrix 1058 rows 586 cols
[2020-05-11 22:25:56] [INFO ] Computed 104 place invariants in 51 ms
[2020-05-11 22:25:57] [INFO ] [Real]Absence check using 26 positive place invariants in 35 ms returned sat
[2020-05-11 22:25:57] [INFO ] [Real]Absence check using 26 positive and 78 generalized place invariants in 55 ms returned sat
[2020-05-11 22:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:25:58] [INFO ] [Real]Absence check using state equation in 1635 ms returned sat
[2020-05-11 22:25:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:25:59] [INFO ] [Nat]Absence check using 26 positive place invariants in 56 ms returned sat
[2020-05-11 22:25:59] [INFO ] [Nat]Absence check using 26 positive and 78 generalized place invariants in 76 ms returned sat
[2020-05-11 22:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:26:01] [INFO ] [Nat]Absence check using state equation in 2219 ms returned sat
[2020-05-11 22:26:01] [INFO ] Computed and/alt/rep : 1035/13422/1035 causal constraints in 98 ms.
[2020-05-11 22:26:11] [INFO ] Added : 130 causal constraints over 26 iterations in 10326 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 51 ms.
[2020-05-11 22:26:12] [INFO ] [Real]Absence check using 26 positive place invariants in 38 ms returned sat
[2020-05-11 22:26:12] [INFO ] [Real]Absence check using 26 positive and 78 generalized place invariants in 58 ms returned sat
[2020-05-11 22:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:26:13] [INFO ] [Real]Absence check using state equation in 1754 ms returned sat
[2020-05-11 22:26:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:26:14] [INFO ] [Nat]Absence check using 26 positive place invariants in 39 ms returned sat
[2020-05-11 22:26:14] [INFO ] [Nat]Absence check using 26 positive and 78 generalized place invariants in 61 ms returned sat
[2020-05-11 22:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:26:15] [INFO ] [Nat]Absence check using state equation in 1735 ms returned sat
[2020-05-11 22:26:16] [INFO ] Computed and/alt/rep : 1035/13422/1035 causal constraints in 92 ms.
[2020-05-11 22:26:24] [INFO ] Added : 130 causal constraints over 26 iterations in 8344 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 46 ms.
[2020-05-11 22:26:24] [INFO ] [Real]Absence check using 26 positive place invariants in 35 ms returned sat
[2020-05-11 22:26:24] [INFO ] [Real]Absence check using 26 positive and 78 generalized place invariants in 52 ms returned sat
[2020-05-11 22:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:26:26] [INFO ] [Real]Absence check using state equation in 1654 ms returned sat
[2020-05-11 22:26:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:26:26] [INFO ] [Nat]Absence check using 26 positive place invariants in 41 ms returned sat
[2020-05-11 22:26:26] [INFO ] [Nat]Absence check using 26 positive and 78 generalized place invariants in 55 ms returned sat
[2020-05-11 22:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:26:27] [INFO ] [Nat]Absence check using state equation in 1238 ms returned unsat
FORMULA ASLink-PT-03a-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 56300 steps, including 1310 resets, run finished after 314 ms. (steps per millisecond=179 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 55700 steps, including 1298 resets, run finished after 251 ms. (steps per millisecond=221 ) properties seen :[0, 0] could not realise parikh vector
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 586/586 places, 1058/1058 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 586 transition count 1057
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 585 transition count 1057
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 584 transition count 1057
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 584 transition count 1057
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 583 transition count 1049
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 583 transition count 1049
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 582 transition count 1041
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 582 transition count 1041
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 581 transition count 1033
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 581 transition count 1033
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 580 transition count 1025
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 580 transition count 1025
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 579 transition count 1017
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 579 transition count 1017
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 578 transition count 1009
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 578 transition count 1009
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 577 transition count 1001
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 577 transition count 1001
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 576 transition count 993
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 576 transition count 993
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 575 transition count 985
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 575 transition count 985
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 574 transition count 977
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 574 transition count 977
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 573 transition count 969
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 573 transition count 969
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 572 transition count 961
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 572 transition count 961
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 571 transition count 953
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 571 transition count 953
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 570 transition count 945
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 570 transition count 945
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 569 transition count 937
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 568 transition count 936
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 568 transition count 936
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 567 transition count 935
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 567 transition count 934
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 566 transition count 934
Applied a total of 55 rules in 281 ms. Remains 566 /586 variables (removed 20) and now considering 934/1058 (removed 124) transitions.
Finished structural reductions, in 1 iterations. Remains : 566/586 places, 934/1058 transitions.
Incomplete random walk after 1000000 steps, including 14183 resets, run finished after 3593 ms. (steps per millisecond=278 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4087 resets, run finished after 1421 ms. (steps per millisecond=703 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4085 resets, run finished after 1459 ms. (steps per millisecond=685 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 3568678 steps, run timeout after 30001 ms. (steps per millisecond=118 ) properties seen :[0, 0]
Probabilistic random walk after 3568678 steps, saw 1117116 distinct states, run finished after 30001 ms. (steps per millisecond=118 ) properties seen :[0, 0]
// Phase 1: matrix 934 rows 566 cols
[2020-05-11 22:27:05] [INFO ] Computed 103 place invariants in 27 ms
[2020-05-11 22:27:05] [INFO ] [Real]Absence check using 26 positive place invariants in 57 ms returned sat
[2020-05-11 22:27:05] [INFO ] [Real]Absence check using 26 positive and 77 generalized place invariants in 80 ms returned sat
[2020-05-11 22:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:27:07] [INFO ] [Real]Absence check using state equation in 2120 ms returned sat
[2020-05-11 22:27:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:27:07] [INFO ] [Nat]Absence check using 26 positive place invariants in 49 ms returned sat
[2020-05-11 22:27:07] [INFO ] [Nat]Absence check using 26 positive and 77 generalized place invariants in 74 ms returned sat
[2020-05-11 22:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:27:10] [INFO ] [Nat]Absence check using state equation in 2509 ms returned sat
[2020-05-11 22:27:10] [INFO ] Computed and/alt/rep : 912/9762/912 causal constraints in 111 ms.
[2020-05-11 22:27:18] [INFO ] Added : 130 causal constraints over 26 iterations in 8129 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 45 ms.
[2020-05-11 22:27:18] [INFO ] [Real]Absence check using 26 positive place invariants in 31 ms returned sat
[2020-05-11 22:27:18] [INFO ] [Real]Absence check using 26 positive and 77 generalized place invariants in 48 ms returned sat
[2020-05-11 22:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:27:20] [INFO ] [Real]Absence check using state equation in 2030 ms returned sat
[2020-05-11 22:27:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:27:21] [INFO ] [Nat]Absence check using 26 positive place invariants in 52 ms returned sat
[2020-05-11 22:27:21] [INFO ] [Nat]Absence check using 26 positive and 77 generalized place invariants in 86 ms returned sat
[2020-05-11 22:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:27:23] [INFO ] [Nat]Absence check using state equation in 2098 ms returned sat
[2020-05-11 22:27:23] [INFO ] Deduced a trap composed of 26 places in 169 ms
[2020-05-11 22:27:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2020-05-11 22:27:23] [INFO ] Computed and/alt/rep : 912/9762/912 causal constraints in 106 ms.
[2020-05-11 22:27:34] [INFO ] Added : 130 causal constraints over 26 iterations in 11103 ms. Result :unknown
Incomplete Parikh walk after 50200 steps, including 1486 resets, run finished after 240 ms. (steps per millisecond=209 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 64600 steps, including 1594 resets, run finished after 270 ms. (steps per millisecond=239 ) properties seen :[0, 0] could not realise parikh vector
Support contains 4 out of 566 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 566/566 places, 934/934 transitions.
Applied a total of 0 rules in 17 ms. Remains 566 /566 variables (removed 0) and now considering 934/934 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 566/566 places, 934/934 transitions.
Starting structural reductions, iteration 0 : 566/566 places, 934/934 transitions.
Applied a total of 0 rules in 18 ms. Remains 566 /566 variables (removed 0) and now considering 934/934 (removed 0) transitions.
// Phase 1: matrix 934 rows 566 cols
[2020-05-11 22:27:35] [INFO ] Computed 103 place invariants in 14 ms
[2020-05-11 22:27:37] [INFO ] Implicit Places using invariants in 2510 ms returned [0, 18, 19, 21, 50, 68, 137, 148, 163, 164, 165, 183, 201, 270, 274, 275, 286, 287, 288, 306, 324, 393, 397, 398, 401, 412, 413, 414, 432, 434, 437, 455, 456, 457, 458, 470, 476, 482, 488, 494, 500, 506, 512, 518, 524, 530]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 2513 ms to find 46 implicit places.
[2020-05-11 22:27:37] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 934 rows 520 cols
[2020-05-11 22:27:37] [INFO ] Computed 57 place invariants in 11 ms
[2020-05-11 22:27:41] [INFO ] Dead Transitions using invariants and state equation in 3521 ms returned []
Starting structural reductions, iteration 1 : 520/566 places, 934/934 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 520 transition count 864
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 450 transition count 864
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 140 place count 450 transition count 844
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 181 place count 429 transition count 844
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 193 place count 425 transition count 836
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 201 place count 417 transition count 836
Symmetric choice reduction at 4 with 15 rule applications. Total rules 216 place count 417 transition count 836
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 246 place count 402 transition count 821
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 249 place count 402 transition count 818
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 249 place count 402 transition count 817
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 251 place count 401 transition count 817
Symmetric choice reduction at 5 with 3 rule applications. Total rules 254 place count 401 transition count 817
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 260 place count 398 transition count 814
Symmetric choice reduction at 5 with 1 rule applications. Total rules 261 place count 398 transition count 814
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 397 transition count 813
Symmetric choice reduction at 5 with 1 rule applications. Total rules 264 place count 397 transition count 813
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 396 transition count 812
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 334 place count 362 transition count 778
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 336 place count 362 transition count 776
Symmetric choice reduction at 6 with 3 rule applications. Total rules 339 place count 362 transition count 776
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 4 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 345 place count 359 transition count 772
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 347 place count 359 transition count 770
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 348 place count 359 transition count 769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 349 place count 358 transition count 769
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 356 place count 358 transition count 762
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 364 place count 350 transition count 762
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 373 place count 350 transition count 762
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 374 place count 350 transition count 762
Applied a total of 374 rules in 117 ms. Remains 350 /520 variables (removed 170) and now considering 762/934 (removed 172) transitions.
// Phase 1: matrix 762 rows 350 cols
[2020-05-11 22:27:41] [INFO ] Computed 51 place invariants in 8 ms
[2020-05-11 22:27:42] [INFO ] Implicit Places using invariants in 679 ms returned [96, 102, 105, 107, 111, 118, 119, 173, 190, 196, 199, 201, 206, 207, 259, 276, 282, 285, 287]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 680 ms to find 19 implicit places.
Starting structural reductions, iteration 2 : 331/566 places, 762/934 transitions.
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 331 transition count 762
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 30 place count 321 transition count 752
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 321 transition count 752
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 39 place count 318 transition count 749
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 49 place count 313 transition count 744
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 313 transition count 735
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 67 place count 304 transition count 735
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 304 transition count 733
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 302 transition count 733
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 302 transition count 733
Applied a total of 74 rules in 61 ms. Remains 302 /331 variables (removed 29) and now considering 733/762 (removed 29) transitions.
// Phase 1: matrix 733 rows 302 cols
[2020-05-11 22:27:42] [INFO ] Computed 32 place invariants in 7 ms
[2020-05-11 22:27:43] [INFO ] Implicit Places using invariants in 812 ms returned []
// Phase 1: matrix 733 rows 302 cols
[2020-05-11 22:27:43] [INFO ] Computed 32 place invariants in 13 ms
[2020-05-11 22:27:46] [INFO ] Implicit Places using invariants and state equation in 3279 ms returned []
Implicit Place search using SMT with State Equation took 4093 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 302/566 places, 733/934 transitions.
Incomplete random walk after 1000000 steps, including 21352 resets, run finished after 3395 ms. (steps per millisecond=294 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7296 resets, run finished after 1440 ms. (steps per millisecond=694 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 7327 resets, run finished after 1547 ms. (steps per millisecond=646 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 6393820 steps, run timeout after 30001 ms. (steps per millisecond=213 ) properties seen :[0, 1]
Probabilistic random walk after 6393820 steps, saw 1589829 distinct states, run finished after 30001 ms. (steps per millisecond=213 ) properties seen :[0, 1]
FORMULA ASLink-PT-03a-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 733 rows 302 cols
[2020-05-11 22:28:22] [INFO ] Computed 32 place invariants in 8 ms
[2020-05-11 22:28:22] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2020-05-11 22:28:22] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 13 ms returned sat
[2020-05-11 22:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:28:23] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2020-05-11 22:28:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:28:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 24 ms returned sat
[2020-05-11 22:28:23] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 18 ms returned sat
[2020-05-11 22:28:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:28:24] [INFO ] [Nat]Absence check using state equation in 698 ms returned sat
[2020-05-11 22:28:24] [INFO ] Computed and/alt/rep : 715/9378/715 causal constraints in 82 ms.
[2020-05-11 22:28:45] [INFO ] Added : 350 causal constraints over 70 iterations in 21345 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 103 ms.
Incomplete Parikh walk after 87300 steps, including 3465 resets, run finished after 312 ms. (steps per millisecond=279 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 302 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 302/302 places, 733/733 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 301 transition count 732
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 299 transition count 732
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 299 transition count 731
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 298 transition count 731
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 296 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 296 transition count 728
Applied a total of 11 rules in 23 ms. Remains 296 /302 variables (removed 6) and now considering 728/733 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 296/302 places, 728/733 transitions.
Incomplete random walk after 1000000 steps, including 21245 resets, run finished after 2831 ms. (steps per millisecond=353 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 7339 resets, run finished after 1211 ms. (steps per millisecond=825 ) properties seen :[0]
Interrupted probabilistic random walk after 6064196 steps, run timeout after 30001 ms. (steps per millisecond=202 ) properties seen :[0]
Probabilistic random walk after 6064196 steps, saw 1761128 distinct states, run finished after 30001 ms. (steps per millisecond=202 ) properties seen :[0]
// Phase 1: matrix 728 rows 296 cols
[2020-05-11 22:29:20] [INFO ] Computed 30 place invariants in 7 ms
[2020-05-11 22:29:20] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2020-05-11 22:29:20] [INFO ] [Real]Absence check using 7 positive and 23 generalized place invariants in 12 ms returned sat
[2020-05-11 22:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:29:20] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2020-05-11 22:29:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:29:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 22 ms returned sat
[2020-05-11 22:29:20] [INFO ] [Nat]Absence check using 7 positive and 23 generalized place invariants in 13 ms returned sat
[2020-05-11 22:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:29:21] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2020-05-11 22:29:21] [INFO ] Computed and/alt/rep : 710/9375/710 causal constraints in 92 ms.
[2020-05-11 22:29:47] [INFO ] Added : 350 causal constraints over 70 iterations in 25239 ms.(timeout) Result :unknown
Incomplete Parikh walk after 74100 steps, including 2807 resets, run finished after 320 ms. (steps per millisecond=231 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 296/296 places, 728/728 transitions.
Applied a total of 0 rules in 11 ms. Remains 296 /296 variables (removed 0) and now considering 728/728 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 296/296 places, 728/728 transitions.
Starting structural reductions, iteration 0 : 296/296 places, 728/728 transitions.
Applied a total of 0 rules in 10 ms. Remains 296 /296 variables (removed 0) and now considering 728/728 (removed 0) transitions.
// Phase 1: matrix 728 rows 296 cols
[2020-05-11 22:29:47] [INFO ] Computed 30 place invariants in 7 ms
[2020-05-11 22:29:47] [INFO ] Implicit Places using invariants in 600 ms returned [74, 95]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 603 ms to find 2 implicit places.
[2020-05-11 22:29:47] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 728 rows 294 cols
[2020-05-11 22:29:47] [INFO ] Computed 28 place invariants in 9 ms
[2020-05-11 22:29:49] [INFO ] Dead Transitions using invariants and state equation in 1228 ms returned []
Starting structural reductions, iteration 1 : 294/296 places, 728/728 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 292 transition count 726
Applied a total of 4 rules in 25 ms. Remains 292 /294 variables (removed 2) and now considering 726/728 (removed 2) transitions.
// Phase 1: matrix 726 rows 292 cols
[2020-05-11 22:29:49] [INFO ] Computed 28 place invariants in 13 ms
[2020-05-11 22:29:49] [INFO ] Implicit Places using invariants in 648 ms returned []
// Phase 1: matrix 726 rows 292 cols
[2020-05-11 22:29:49] [INFO ] Computed 28 place invariants in 14 ms
[2020-05-11 22:29:52] [INFO ] Implicit Places using invariants and state equation in 2806 ms returned []
Implicit Place search using SMT with State Equation took 3456 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 292/296 places, 726/728 transitions.
Incomplete random walk after 1000000 steps, including 21357 resets, run finished after 2853 ms. (steps per millisecond=350 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 7393 resets, run finished after 1410 ms. (steps per millisecond=709 ) properties seen :[0]
Interrupted probabilistic random walk after 5584663 steps, run timeout after 30001 ms. (steps per millisecond=186 ) properties seen :[0]
Probabilistic random walk after 5584663 steps, saw 1762358 distinct states, run finished after 30001 ms. (steps per millisecond=186 ) properties seen :[0]
// Phase 1: matrix 726 rows 292 cols
[2020-05-11 22:30:26] [INFO ] Computed 28 place invariants in 7 ms
[2020-05-11 22:30:27] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2020-05-11 22:30:27] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 18 ms returned sat
[2020-05-11 22:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:30:27] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2020-05-11 22:30:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:30:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 27 ms returned sat
[2020-05-11 22:30:27] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 16 ms returned sat
[2020-05-11 22:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:30:28] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2020-05-11 22:30:28] [INFO ] Computed and/alt/rep : 708/9377/708 causal constraints in 56 ms.
[2020-05-11 22:30:42] [INFO ] Added : 350 causal constraints over 70 iterations in 14400 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 96 ms.
Incomplete Parikh walk after 56600 steps, including 2331 resets, run finished after 266 ms. (steps per millisecond=212 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 292 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 292/292 places, 726/726 transitions.
Applied a total of 0 rules in 8 ms. Remains 292 /292 variables (removed 0) and now considering 726/726 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 292/292 places, 726/726 transitions.
Starting structural reductions, iteration 0 : 292/292 places, 726/726 transitions.
Applied a total of 0 rules in 9 ms. Remains 292 /292 variables (removed 0) and now considering 726/726 (removed 0) transitions.
// Phase 1: matrix 726 rows 292 cols
[2020-05-11 22:30:43] [INFO ] Computed 28 place invariants in 8 ms
[2020-05-11 22:30:43] [INFO ] Implicit Places using invariants in 558 ms returned []
// Phase 1: matrix 726 rows 292 cols
[2020-05-11 22:30:43] [INFO ] Computed 28 place invariants in 7 ms
[2020-05-11 22:30:46] [INFO ] Implicit Places using invariants and state equation in 2854 ms returned []
Implicit Place search using SMT with State Equation took 3414 ms to find 0 implicit places.
[2020-05-11 22:30:46] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 726 rows 292 cols
[2020-05-11 22:30:46] [INFO ] Computed 28 place invariants in 12 ms
[2020-05-11 22:30:48] [INFO ] Dead Transitions using invariants and state equation in 1311 ms returned []
Finished structural reductions, in 1 iterations. Remains : 292/292 places, 726/726 transitions.
Incomplete random walk after 100000 steps, including 2152 resets, run finished after 483 ms. (steps per millisecond=207 ) properties seen :[0]
// Phase 1: matrix 726 rows 292 cols
[2020-05-11 22:30:48] [INFO ] Computed 28 place invariants in 11 ms
[2020-05-11 22:30:48] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2020-05-11 22:30:48] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 15 ms returned sat
[2020-05-11 22:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:30:49] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2020-05-11 22:30:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:30:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2020-05-11 22:30:49] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 11 ms returned sat
[2020-05-11 22:30:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:30:50] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2020-05-11 22:30:50] [INFO ] Computed and/alt/rep : 708/9377/708 causal constraints in 56 ms.
[2020-05-11 22:31:04] [INFO ] Added : 350 causal constraints over 70 iterations in 14495 ms. Result :sat
Applied a total of 0 rules in 17 ms. Remains 292 /292 variables (removed 0) and now considering 726/726 (removed 0) transitions.
// Phase 1: matrix 726 rows 292 cols
[2020-05-11 22:31:04] [INFO ] Computed 28 place invariants in 11 ms
[2020-05-11 22:31:04] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2020-05-11 22:31:04] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 13 ms returned sat
[2020-05-11 22:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 22:31:05] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2020-05-11 22:31:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 22:31:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2020-05-11 22:31:05] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 13 ms returned sat
[2020-05-11 22:31:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 22:31:06] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2020-05-11 22:31:06] [INFO ] Computed and/alt/rep : 708/9377/708 causal constraints in 87 ms.
[2020-05-11 22:31:21] [INFO ] Added : 350 causal constraints over 70 iterations in 15402 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 98 ms.
[2020-05-11 22:31:22] [INFO ] Flatten gal took : 166 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-11 22:31:22] [INFO ] Applying decomposition
[2020-05-11 22:31:22] [INFO ] Flatten gal took : 89 ms
[2020-05-11 22:31:22] [INFO ] Flatten gal took : 224 ms
[2020-05-11 22:31:22] [INFO ] Input system was already deterministic with 726 transitions.
[2020-05-11 22:31:22] [INFO ] Input system was already deterministic with 726 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/graph7990946835062281415.txt, -o, /tmp/graph7990946835062281415.bin, -w, /tmp/graph7990946835062281415.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/graph7990946835062281415.bin, -l, -1, -v, -w, /tmp/graph7990946835062281415.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-11 22:31:23] [INFO ] Decomposing Gal with order
[2020-05-11 22:31:23] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 726 rows 292 cols
[2020-05-11 22:31:23] [INFO ] Ran tautology test, simplified 0 / 1 in 739 ms.
[2020-05-11 22:31:23] [INFO ] Computed 28 place invariants in 20 ms
inv : -p97 - p99 - p100 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 = 0
inv : p600 + p604 + p606 + p607 + p609 - p658 - p660 - p662 - p664 - p666 - p668 - p670 - p672 - p674 - p676 + p707 + p721 + p727 + p733 + p739 + p759 + p773 = 1
inv : p56 + p58 + p60 + p62 + p64 + p66 + p68 + p70 + p100 + p134 + p156 + p176 + p212 - p402 - p403 - p407 = 0
inv : p249 + p251 + p253 + p255 + p257 + p259 + p261 + p263 + p265 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p290 - p294 + p296 + p298 + p300 + p302 + p304 - p405 - p407 = 0
inv : p486 + p488 + p489 - p491 - p493 - p495 - p497 - p499 = 0
inv : p35 + p36 + p55 + p57 + p59 + p61 + p63 + p65 + p67 + p69 + p71 + p96 + p97 + p99 - p105 - p107 - p109 - p111 - p212 + p402 + p403 + p407 = 1
inv : p37 + p39 + p41 + p43 + p45 + p47 + p49 + p51 + p53 - p55 - p57 - p59 - p61 - p63 - p65 - p67 - p69 - p71 - p96 - p97 - p99 + p105 + p107 + p109 + p111 + p212 + p268 + p270 + p272 + p274 + p276 + p278 + p280 + p282 - p402 - p403 - p407 = 0
inv : p684 + p686 + p688 + p690 + p699 + p707 + p721 + p727 + p733 + p739 + p759 + p773 + p782 + p807 = 1
inv : -p489 - p523 - p545 - p565 + p607 + p608 + p609 = 0
inv : p210 + p402 + p403 + p407 = 1
inv : p232 + p234 + p236 + p238 + p240 + p242 + p244 + p246 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p464 + p466 + p468 + p470 + p472 + p474 + p476 + p485 + p491 + p493 + p495 + p497 + p499 + p523 + p545 + p565 = 1
inv : p291 + p293 + p294 - p296 - p298 - p300 - p302 - p304 = 0
inv : p250 + p252 + p254 + p256 + p258 + p260 + p262 + p264 + p294 + p328 + p350 + p370 + p405 + p407 = 1
inv : p405 - p445 - p447 - p449 - p451 - p453 - p455 - p457 - p459 - p489 - p523 - p545 - p565 + p597 + p598 + p604 + p606 + p607 + p609 - p658 - p660 - p662 - p664 - p666 - p668 - p670 - p672 - p674 - p676 + p707 + p721 + p727 + p733 + p739 + p759 + p773 = 1
inv : p38 + p40 + p42 + p44 + p46 + p48 + p50 + p52 - p268 - p270 - p272 - p274 - p276 - p278 - p280 - p282 = 0
inv : p657 + p658 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 - p707 - p721 - p727 - p733 - p739 - p759 - p773 = 0
inv : p55 + p57 + p59 + p61 + p63 + p65 + p67 + p69 + p71 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p91 + p96 + p97 + p99 - p212 + p402 + p403 + p407 = 1
inv : p231 + p233 + p235 + p237 + p239 + p241 + p243 + p245 + p247 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p455 - p456 - p457 - p458 - p459 - p460 - p464 - p466 - p468 - p470 - p472 - p474 - p476 - p485 - p491 - p493 - p495 - p497 - p499 - p523 - p545 - p565 = 0
inv : p445 + p447 + p449 + p451 + p453 + p455 + p457 + p459 + p489 + p523 + p545 + p565 + p602 - p604 - p606 - p607 - p609 + p658 + p660 + p662 + p664 + p666 + p668 + p670 + p672 + p674 + p676 - p707 - p721 - p727 - p733 - p739 - p759 - p773 = 0
inv : p658 + p700 - p707 + p708 - p721 - p727 - p733 - p739 - p759 - p773 = 0
inv : p2 + p4 + p6 + p8 + p10 + p12 + p14 + p16 + p18 - p55 - p57 - p59 - p61 - p63 - p65 - p67 - p69 - p71 - p75 - p77 - p79 - p81 - p83 - p85 - p87 - p89 - p91 - p96 - p97 - p99 + p212 - p402 - p403 - p407 = 0
inv : p22 + p29 + p31 + p207 + p212 = 1
inv : p427 + p429 + p431 + p433 + p435 + p437 + p439 + p441 + p620 + p622 + p624 + p626 + p628 + p630 + p632 + p634 + p636 + p699 + p707 + p721 + p727 + p733 + p739 + p759 + p773 = 1
inv : p426 + p428 + p430 + p432 + p434 + p436 + p438 + p440 + p442 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p455 - p456 - p457 - p458 - p459 - p460 - p485 - p491 - p493 - p495 - p497 - p499 - p523 - p545 - p565 - p620 - p622 - p624 - p626 - p628 - p630 - p632 - p634 - p636 - p699 - p707 - p721 - p727 - p733 - p739 - p759 - p773 = -1
inv : p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p485 + p491 + p493 + p495 + p497 + p499 + p523 + p545 + p565 = 1
inv : p3 + p5 + p7 + p9 + p11 + p13 + p15 + p17 + p55 + p57 + p59 + p61 + p63 + p65 + p67 + p69 + p71 + p75 + p77 + p79 + p81 + p83 + p85 + p87 + p89 + p91 + p96 + p97 + p99 - p212 + p402 + p403 + p407 = 1
inv : -p445 - p447 - p449 - p451 - p453 - p455 - p457 - p459 + p604 + p605 + p606 = 0
inv : p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p699 + p707 + p721 + p727 + p733 + p739 + p759 + p773 = 1
Total of 28 invariants.
[2020-05-11 22:31:23] [INFO ] Computed 28 place invariants in 30 ms
[2020-05-11 22:31:23] [INFO ] BMC solution for property ASLink-PT-03a-ReachabilityFireability-08(UNSAT) depth K=0 took 11 ms
[2020-05-11 22:31:23] [INFO ] BMC solution for property ASLink-PT-03a-ReachabilityFireability-08(UNSAT) depth K=1 took 12 ms
[2020-05-11 22:31:23] [INFO ] Removed a total of 1388 redundant transitions.
[2020-05-11 22:31:23] [INFO ] Flatten gal took : 284 ms
[2020-05-11 22:31:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 31 ms.
[2020-05-11 22:31:23] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 18 ms
[2020-05-11 22:31:23] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [reachable] property : ASLink-PT-03a-ReachabilityFireability-08 with value :((i3.u16.p36==1)&&(i3.u16.p107==1))
built 12 ordering constraints for composite.
built 142 ordering constraints for composite.
built 135 ordering constraints for composite.
built 139 ordering constraints for composite.
built 135 ordering constraints for composite.
SDD proceeding with computation, new max is 4
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 726 rows 292 cols
SDD proceeding with computation, new max is 8
[2020-05-11 22:31:23] [INFO ] Computed 28 place invariants in 7 ms
inv : -p97 - p99 - p100 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 = 0
inv : p600 + p604 + p606 + p607 + p609 - p658 - p660 - p662 - p664 - p666 - p668 - p670 - p672 - p674 - p676 + p707 + p721 + p727 + p733 + p739 + p759 + p773 = 1
inv : p56 + p58 + p60 + p62 + p64 + p66 + p68 + p70 + p100 + p134 + p156 + p176 + p212 - p402 - p403 - p407 = 0
inv : p249 + p251 + p253 + p255 + p257 + p259 + p261 + p263 + p265 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p290 - p294 + p296 + p298 + p300 + p302 + p304 - p405 - p407 = 0
inv : p486 + p488 + p489 - p491 - p493 - p495 - p497 - p499 = 0
SDD proceeding with computation, new max is 16
inv : p35 + p36 + p55 + p57 + p59 + p61 + p63 + p65 + p67 + p69 + p71 + p96 + p97 + p99 - p105 - p107 - p109 - p111 - p212 + p402 + p403 + p407 = 1
inv : p37 + p39 + p41 + p43 + p45 + p47 + p49 + p51 + p53 - p55 - p57 - p59 - p61 - p63 - p65 - p67 - p69 - p71 - p96 - p97 - p99 + p105 + p107 + p109 + p111 + p212 + p268 + p270 + p272 + p274 + p276 + p278 + p280 + p282 - p402 - p403 - p407 = 0
inv : p684 + p686 + p688 + p690 + p699 + p707 + p721 + p727 + p733 + p739 + p759 + p773 + p782 + p807 = 1
inv : -p489 - p523 - p545 - p565 + p607 + p608 + p609 = 0
inv : p210 + p402 + p403 + p407 = 1
inv : p232 + p234 + p236 + p238 + p240 + p242 + p244 + p246 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p464 + p466 + p468 + p470 + p472 + p474 + p476 + p485 + p491 + p493 + p495 + p497 + p499 + p523 + p545 + p565 = 1
inv : p291 + p293 + p294 - p296 - p298 - p300 - p302 - p304 = 0
inv : p250 + p252 + p254 + p256 + p258 + p260 + p262 + p264 + p294 + p328 + p350 + p370 + p405 + p407 = 1
inv : p405 - p445 - p447 - p449 - p451 - p453 - p455 - p457 - p459 - p489 - p523 - p545 - p565 + p597 + p598 + p604 + p606 + p607 + p609 - p658 - p660 - p662 - p664 - p666 - p668 - p670 - p672 - p674 - p676 + p707 + p721 + p727 + p733 + p739 + p759 + p773 = 1
inv : p38 + p40 + p42 + p44 + p46 + p48 + p50 + p52 - p268 - p270 - p272 - p274 - p276 - p278 - p280 - p282 = 0
inv : p657 + p658 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 - p707 - p721 - p727 - p733 - p739 - p759 - p773 = 0
SDD proceeding with computation, new max is 32
inv : p55 + p57 + p59 + p61 + p63 + p65 + p67 + p69 + p71 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p91 + p96 + p97 + p99 - p212 + p402 + p403 + p407 = 1
inv : p231 + p233 + p235 + p237 + p239 + p241 + p243 + p245 + p247 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p455 - p456 - p457 - p458 - p459 - p460 - p464 - p466 - p468 - p470 - p472 - p474 - p476 - p485 - p491 - p493 - p495 - p497 - p499 - p523 - p545 - p565 = 0
inv : p445 + p447 + p449 + p451 + p453 + p455 + p457 + p459 + p489 + p523 + p545 + p565 + p602 - p604 - p606 - p607 - p609 + p658 + p660 + p662 + p664 + p666 + p668 + p670 + p672 + p674 + p676 - p707 - p721 - p727 - p733 - p739 - p759 - p773 = 0
inv : p658 + p700 - p707 + p708 - p721 - p727 - p733 - p739 - p759 - p773 = 0
inv : p2 + p4 + p6 + p8 + p10 + p12 + p14 + p16 + p18 - p55 - p57 - p59 - p61 - p63 - p65 - p67 - p69 - p71 - p75 - p77 - p79 - p81 - p83 - p85 - p87 - p89 - p91 - p96 - p97 - p99 + p212 - p402 - p403 - p407 = 0
inv : p22 + p29 + p31 + p207 + p212 = 1
inv : p427 + p429 + p431 + p433 + p435 + p437 + p439 + p441 + p620 + p622 + p624 + p626 + p628 + p630 + p632 + p634 + p636 + p699 + p707 + p721 + p727 + p733 + p739 + p759 + p773 = 1
inv : p426 + p428 + p430 + p432 + p434 + p436 + p438 + p440 + p442 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p455 - p456 - p457 - p458 - p459 - p460 - p485 - p491 - p493 - p495 - p497 - p499 - p523 - p545 - p565 - p620 - p622 - p624 - p626 - p628 - p630 - p632 - p634 - p636 - p699 - p707 - p721 - p727 - p733 - p739 - p759 - p773 = -1
inv : p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p485 + p491 + p493 + p495 + p497 + p499 + p523 + p545 + p565 = 1
inv : p3 + p5 + p7 + p9 + p11 + p13 + p15 + p17 + p55 + p57 + p59 + p61 + p63 + p65 + p67 + p69 + p71 + p75 + p77 + p79 + p81 + p83 + p85 + p87 + p89 + p91 + p96 + p97 + p99 - p212 + p402 + p403 + p407 = 1
inv : -p445 - p447 - p449 - p451 - p453 - p455 - p457 - p459 + p604 + p605 + p606 = 0
inv : p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p699 + p707 + p721 + p727 + p733 + p739 + p759 + p773 = 1
Total of 28 invariants.
[2020-05-11 22:31:23] [INFO ] Computed 28 place invariants in 16 ms
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
[2020-05-11 22:31:25] [INFO ] Proved 292 variables to be positive in 1309 ms
[2020-05-11 22:31:25] [INFO ] Proved 292 variables to be positive in 1822 ms
[2020-05-11 22:31:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesASLink-PT-03a-ReachabilityFireability-08
[2020-05-11 22:31:25] [INFO ] KInduction solution for property ASLink-PT-03a-ReachabilityFireability-08(SAT) depth K=0 took 37 ms
[2020-05-11 22:31:25] [INFO ] Computing symmetric may disable matrix : 726 transitions.
[2020-05-11 22:31:25] [INFO ] Computation of disable matrix completed :0/726 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 22:31:25] [INFO ] Computation of Complete disable matrix. took 147 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 22:31:25] [INFO ] Computing symmetric may enable matrix : 726 transitions.
Reachability property ASLink-PT-03a-ReachabilityFireability-08 is true.
FORMULA ASLink-PT-03a-ReachabilityFireability-08 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 4097 fixpoint passes
[2020-05-11 22:31:25] [INFO ] BMC solution for property ASLink-PT-03a-ReachabilityFireability-08(UNSAT) depth K=2 took 1900 ms
[2020-05-11 22:31:25] [INFO ] Computation of Complete enable matrix. took 73 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 22:31:25] [INFO ] Computing symmetric co enabling matrix : 726 transitions.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.57893e+07,1.89096,46100,1612,7293,10607,130868,808,17357,442,321089,0
Total reachable state count : 55789348

Verifying 1 reachability properties.
Reachability property ASLink-PT-03a-ReachabilityFireability-08 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
ASLink-PT-03a-ReachabilityFireability-08,12,1.89359,46100,81,156,10607,130868,820,17357,449,321089,0
[2020-05-11 22:31:25] [WARNING] Interrupting SMT solver.
SMT solver raised 'unknown', retrying with same input.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:492)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-11 22:31:25] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-11 22:31:25] [WARNING] Unexpected error occurred while running SMT. Was verifying ASLink-PT-03a-ReachabilityFireability-08 K-induction depth 1
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
[2020-05-11 22:31:25] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
[2020-05-11 22:31:25] [INFO ] Built C files in 3165ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589236286908

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-03a, 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 r006-smll-158897515500048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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