fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of ITS-Tools for GPPP-PT-C0100N0000000010

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.570 251758.00 271572.00 754.10 TTFTFTTTFTTTTFTF 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.r081-smll-158922978000495.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 GPPP-PT-C0100N0000000010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922978000495
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.1K Apr 4 20:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 4 20:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 4 09:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 09:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 8 14:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 3 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 3 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 3 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 3 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000000010-ReachabilityFireability-00
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-01
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-02
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-03
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-04
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-05
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-06
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-07
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-08
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-09
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-10
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-11
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-12
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-13
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-14
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589780075429

[2020-05-18 05:34:38] [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-18 05:34:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 05:34:38] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-05-18 05:34:38] [INFO ] Transformed 33 places.
[2020-05-18 05:34:38] [INFO ] Transformed 22 transitions.
[2020-05-18 05:34:38] [INFO ] Parsed PT model containing 33 places and 22 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10004 steps, including 23 resets, run finished after 66 ms. (steps per millisecond=151 ) properties seen :[1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1]
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 67 ms. (steps per millisecond=149 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 67 ms. (steps per millisecond=149 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 90 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 22 rows 33 cols
[2020-05-18 05:34:39] [INFO ] Computed 12 place invariants in 6 ms
[2020-05-18 05:34:39] [INFO ] [Real]Absence check using 6 positive place invariants in 19 ms returned sat
[2020-05-18 05:34:39] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 05:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:34:39] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2020-05-18 05:34:39] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-18 05:34:39] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2020-05-18 05:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:34:39] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-05-18 05:34:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 05:34:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-05-18 05:34:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:34:44] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4973 ms returned unknown
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 05:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 05:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-18 05:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2020-05-18 05:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:34:44] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-05-18 05:34:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 05:34:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-05-18 05:34:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:34:49] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4975 ms returned unknown
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 14 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 30 transition count 18
Applied a total of 7 rules in 27 ms. Remains 30 /33 variables (removed 3) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 30 cols
[2020-05-18 05:34:49] [INFO ] Computed 12 place invariants in 2 ms
[2020-05-18 05:34:49] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/33 places, 18/22 transitions.
Incomplete random walk after 1000005 steps, including 2556 resets, run finished after 1164 ms. (steps per millisecond=859 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 627 resets, run finished after 1604 ms. (steps per millisecond=623 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 620 resets, run finished after 940 ms. (steps per millisecond=1063 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 26474486 steps, run timeout after 30001 ms. (steps per millisecond=882 ) properties seen :[0, 0]
Probabilistic random walk after 26474486 steps, saw 3839193 distinct states, run finished after 30001 ms. (steps per millisecond=882 ) properties seen :[0, 0]
// Phase 1: matrix 18 rows 30 cols
[2020-05-18 05:35:23] [INFO ] Computed 12 place invariants in 3 ms
[2020-05-18 05:35:23] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-18 05:35:23] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2020-05-18 05:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:35:23] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-18 05:35:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 05:35:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-05-18 05:35:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:35:32] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 9011 ms returned unknown
[2020-05-18 05:35:32] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-18 05:35:32] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 05:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:35:32] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-05-18 05:35:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 05:35:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-18 05:35:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:35:41] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 9040 ms returned unknown
Support contains 14 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 18/18 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 30 cols
[2020-05-18 05:35:41] [INFO ] Computed 12 place invariants in 1 ms
[2020-05-18 05:35:41] [INFO ] Implicit Places using invariants in 38 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
[2020-05-18 05:35:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 29 cols
[2020-05-18 05:35:41] [INFO ] Computed 11 place invariants in 2 ms
[2020-05-18 05:35:41] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 29/30 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2020-05-18 05:35:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 29 cols
[2020-05-18 05:35:41] [INFO ] Computed 11 place invariants in 1 ms
[2020-05-18 05:35:41] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/30 places, 18/18 transitions.
Incomplete random walk after 1000007 steps, including 2559 resets, run finished after 913 ms. (steps per millisecond=1095 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 624 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 616 resets, run finished after 897 ms. (steps per millisecond=1114 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 27771498 steps, run timeout after 30001 ms. (steps per millisecond=925 ) properties seen :[0, 0]
Probabilistic random walk after 27771498 steps, saw 4023244 distinct states, run finished after 30001 ms. (steps per millisecond=925 ) properties seen :[0, 0]
// Phase 1: matrix 18 rows 29 cols
[2020-05-18 05:36:14] [INFO ] Computed 11 place invariants in 7 ms
[2020-05-18 05:36:14] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-18 05:36:14] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-18 05:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:36:14] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-05-18 05:36:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 05:36:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-18 05:36:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:36:23] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 9042 ms returned unknown
[2020-05-18 05:36:23] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-18 05:36:23] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-18 05:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:36:23] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-18 05:36:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 05:36:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-18 05:36:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:36:32] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 9023 ms returned unknown
Support contains 14 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 18/18 transitions.
Starting structural reductions, iteration 0 : 29/29 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 29 cols
[2020-05-18 05:36:32] [INFO ] Computed 11 place invariants in 1 ms
[2020-05-18 05:36:33] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 18 rows 29 cols
[2020-05-18 05:36:33] [INFO ] Computed 11 place invariants in 1 ms
[2020-05-18 05:36:33] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [2, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 82 ms to find 2 implicit places.
[2020-05-18 05:36:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 27 cols
[2020-05-18 05:36:33] [INFO ] Computed 9 place invariants in 1 ms
[2020-05-18 05:36:33] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 27/29 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2020-05-18 05:36:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 27 cols
[2020-05-18 05:36:33] [INFO ] Computed 9 place invariants in 0 ms
[2020-05-18 05:36:33] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 27/29 places, 18/18 transitions.
Incomplete random walk after 1000000 steps, including 2569 resets, run finished after 879 ms. (steps per millisecond=1137 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 628 resets, run finished after 967 ms. (steps per millisecond=1034 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 622 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 29207417 steps, run timeout after 30001 ms. (steps per millisecond=973 ) properties seen :[0, 0]
Probabilistic random walk after 29207417 steps, saw 4226980 distinct states, run finished after 30001 ms. (steps per millisecond=973 ) properties seen :[0, 0]
// Phase 1: matrix 18 rows 27 cols
[2020-05-18 05:37:05] [INFO ] Computed 9 place invariants in 1 ms
[2020-05-18 05:37:05] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-18 05:37:05] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-18 05:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:37:05] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-05-18 05:37:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 05:37:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-18 05:37:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:37:11] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 6013 ms returned unknown
[2020-05-18 05:37:11] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-05-18 05:37:11] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-18 05:37:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:37:11] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-05-18 05:37:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 05:37:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-18 05:37:12] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 262 ms returned sat
[2020-05-18 05:37:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 05:37:12] [INFO ] [Nat]Absence check using state equation in 466 ms returned unsat
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 9 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 18/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 25 transition count 16
Applied a total of 4 rules in 5 ms. Remains 25 /27 variables (removed 2) and now considering 16/18 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/27 places, 16/18 transitions.
Incomplete random walk after 1000003 steps, including 2609 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 639 resets, run finished after 953 ms. (steps per millisecond=1049 ) properties seen :[0]
Interrupted probabilistic random walk after 30929233 steps, run timeout after 30001 ms. (steps per millisecond=1030 ) properties seen :[0]
Probabilistic random walk after 30929233 steps, saw 4510725 distinct states, run finished after 30001 ms. (steps per millisecond=1030 ) properties seen :[0]
// Phase 1: matrix 16 rows 25 cols
[2020-05-18 05:37:44] [INFO ] Computed 9 place invariants in 0 ms
[2020-05-18 05:37:44] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-05-18 05:37:44] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-18 05:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:37:44] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-18 05:37:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 05:37:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-18 05:37:44] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 59 ms returned sat
[2020-05-18 05:37:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 05:37:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:37:53] [INFO ] [Nat]Absence check using state equation in 9053 ms returned unknown
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 16/16 transitions.
Starting structural reductions, iteration 0 : 25/25 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2020-05-18 05:37:53] [INFO ] Computed 9 place invariants in 1 ms
[2020-05-18 05:37:53] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 16 rows 25 cols
[2020-05-18 05:37:53] [INFO ] Computed 9 place invariants in 0 ms
[2020-05-18 05:37:53] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [0, 18]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 72 ms to find 2 implicit places.
[2020-05-18 05:37:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2020-05-18 05:37:53] [INFO ] Computed 8 place invariants in 0 ms
[2020-05-18 05:37:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 23/25 places, 15/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2020-05-18 05:37:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2020-05-18 05:37:53] [INFO ] Computed 8 place invariants in 1 ms
[2020-05-18 05:37:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 15/16 transitions.
Incomplete random walk after 1000004 steps, including 2614 resets, run finished after 575 ms. (steps per millisecond=1739 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 642 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties seen :[0]
Interrupted probabilistic random walk after 32835644 steps, run timeout after 30001 ms. (steps per millisecond=1094 ) properties seen :[0]
Probabilistic random walk after 32835644 steps, saw 4788395 distinct states, run finished after 30001 ms. (steps per millisecond=1094 ) properties seen :[0]
// Phase 1: matrix 15 rows 23 cols
[2020-05-18 05:38:25] [INFO ] Computed 8 place invariants in 1 ms
[2020-05-18 05:38:25] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-05-18 05:38:25] [INFO ] [Real]Absence check using 4 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-18 05:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:38:25] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-05-18 05:38:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 05:38:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-05-18 05:38:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:38:31] [INFO ] [Nat]Absence check using 4 positive and 4 generalized place invariants in 6045 ms returned unknown
Support contains 9 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 15/15 transitions.
Applied a total of 0 rules in 4 ms. Remains 23 /23 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 15/15 transitions.
Starting structural reductions, iteration 0 : 23/23 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 23 cols
[2020-05-18 05:38:31] [INFO ] Computed 8 place invariants in 0 ms
[2020-05-18 05:38:31] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2020-05-18 05:38:31] [INFO ] Computed 8 place invariants in 0 ms
[2020-05-18 05:38:31] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2020-05-18 05:38:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2020-05-18 05:38:31] [INFO ] Computed 8 place invariants in 0 ms
[2020-05-18 05:38:31] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 15/15 transitions.
Incomplete random walk after 100007 steps, including 258 resets, run finished after 101 ms. (steps per millisecond=990 ) properties seen :[0]
// Phase 1: matrix 15 rows 23 cols
[2020-05-18 05:38:31] [INFO ] Computed 8 place invariants in 2 ms
[2020-05-18 05:38:31] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-05-18 05:38:31] [INFO ] [Real]Absence check using 4 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-18 05:38:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:38:31] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-05-18 05:38:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 05:38:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-05-18 05:38:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:38:37] [INFO ] [Nat]Absence check using 4 positive and 4 generalized place invariants in 6027 ms returned unknown
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 23 cols
[2020-05-18 05:38:37] [INFO ] Computed 8 place invariants in 1 ms
[2020-05-18 05:38:37] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-05-18 05:38:37] [INFO ] [Real]Absence check using 4 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-18 05:38:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:38:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-05-18 05:38:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 05:38:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-05-18 05:38:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:38:43] [INFO ] [Nat]Absence check using 4 positive and 4 generalized place invariants in 6028 ms returned unknown
[2020-05-18 05:38:43] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 05:38:43] [INFO ] Applying decomposition
[2020-05-18 05:38:43] [INFO ] Flatten gal took : 28 ms
[2020-05-18 05:38:43] [INFO ] Flatten gal took : 20 ms
[2020-05-18 05:38:44] [INFO ] Input system was already deterministic with 15 transitions.
[2020-05-18 05:38:44] [INFO ] Input system was already deterministic with 15 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 15 rows 23 cols
[2020-05-18 05:38:44] [INFO ] Computed 8 place invariants in 8 ms
inv : a1 + a2 = 200
inv : c1 + c2 = 700
inv : 99*ATP + 99*Ru5P - 251*Xu5P + 70099*R5P + 69749*S7P + 449*E4P + 99*F6P + 99*G6P + 198*FBP + 99*DHAP + 99*_3PG - 350*a2 + 99*c2 = 3960
inv : -19800*ATP - 19866*Ru5P + 84883*Xu5P - 20969666*R5P - 20874883*S7P - 94783*E4P - 19800*G6P - 19800*FBP - 9900*DHAP - 19800*_3PG + 66*b1 + 104749*a2 - 29700*c2 = -772200
inv : 2*GSSG + GSH = 20
inv : NADH - _3PG - Pyr = 0
inv : NADPplus + NADPH = 20
inv : 19800*ATP + 19866*Ru5P - 84883*Xu5P + 20969666*R5P + 20874883*S7P + 94783*E4P + 19800*G6P + 19800*FBP + 9900*DHAP + 19800*_3PG + 66*b2 - 104749*a2 + 29700*c2 = 792000
Total of 8 invariants.
[2020-05-18 05:38:44] [INFO ] Computed 8 place invariants in 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph11915197655188284518.txt, -o, /tmp/graph11915197655188284518.bin, -w, /tmp/graph11915197655188284518.weights], workingDir=null]
[2020-05-18 05:38:44] [INFO ] Ran tautology test, simplified 0 / 1 in 127 ms.
[2020-05-18 05:38:44] [INFO ] BMC solution for property GPPP-PT-C0100N0000000010-ReachabilityFireability-02(UNSAT) depth K=0 took 6 ms
[2020-05-18 05:38:44] [INFO ] BMC solution for property GPPP-PT-C0100N0000000010-ReachabilityFireability-02(UNSAT) depth K=1 took 2 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph11915197655188284518.bin, -l, -1, -v, -w, /tmp/graph11915197655188284518.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 05:38:44] [INFO ] BMC solution for property GPPP-PT-C0100N0000000010-ReachabilityFireability-02(UNSAT) depth K=2 took 9 ms
[2020-05-18 05:38:44] [INFO ] BMC solution for property GPPP-PT-C0100N0000000010-ReachabilityFireability-02(UNSAT) depth K=3 took 28 ms
[2020-05-18 05:38:44] [INFO ] Decomposing Gal with order
[2020-05-18 05:38:44] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 15 rows 23 cols
[2020-05-18 05:38:44] [INFO ] Computed 8 place invariants in 0 ms
inv : a1 + a2 = 200
inv : c1 + c2 = 700
inv : 99*ATP + 99*Ru5P - 251*Xu5P + 70099*R5P + 69749*S7P + 449*E4P + 99*F6P + 99*G6P + 198*FBP + 99*DHAP + 99*_3PG - 350*a2 + 99*c2 = 3960
inv : -19800*ATP - 19866*Ru5P + 84883*Xu5P - 20969666*R5P - 20874883*S7P - 94783*E4P - 19800*G6P - 19800*FBP - 9900*DHAP - 19800*_3PG + 66*b1 + 104749*a2 - 29700*c2 = -772200
inv : 2*GSSG + GSH = 20
inv : NADH - _3PG - Pyr = 0
inv : NADPplus + NADPH = 20
inv : 19800*ATP + 19866*Ru5P - 84883*Xu5P + 20969666*R5P + 20874883*S7P + 94783*E4P + 19800*G6P + 19800*FBP + 9900*DHAP + 19800*_3PG + 66*b2 - 104749*a2 + 29700*c2 = 792000
Total of 8 invariants.
[2020-05-18 05:38:44] [INFO ] Computed 8 place invariants in 1 ms
[2020-05-18 05:38:44] [INFO ] Removed a total of 2 redundant transitions.
[2020-05-18 05:38:44] [INFO ] Proved 23 variables to be positive in 161 ms
[2020-05-18 05:38:44] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2020-05-18 05:38:44] [INFO ] Computation of disable matrix completed :0/15 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 05:38:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 05:38:44] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2020-05-18 05:38:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 05:38:44] [INFO ] BMC solution for property GPPP-PT-C0100N0000000010-ReachabilityFireability-02(UNSAT) depth K=4 took 49 ms
[2020-05-18 05:38:44] [INFO ] Flatten gal took : 59 ms
[2020-05-18 05:38:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-18 05:38:44] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 3 ms
[2020-05-18 05:38:44] [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 : GPPP-PT-C0100N0000000010-ReachabilityFireability-02 with value :((((i0.u0.G6P>=1)&&(i0.u5.b1>=300))&&((i1.u1.NADPH<1)||(i1.u2.GSSG<1)))&&(((i2.u7.NADH>=1)&&(i0.u4.Pyr>=1))||(((i2.u3.FBP>=1)&&(u6.Xu5P>=1))&&(u6.R5P>=1))))
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 2 ordering constraints for composite.
built 9 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
[2020-05-18 05:38:44] [INFO ] Proved 23 variables to be positive in 155 ms
SDD proceeding with computation, new max is 256
[2020-05-18 05:38:44] [INFO ] BMC solution for property GPPP-PT-C0100N0000000010-ReachabilityFireability-02(UNSAT) depth K=5 took 147 ms
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
[2020-05-18 05:38:44] [INFO ] BMC solution for property GPPP-PT-C0100N0000000010-ReachabilityFireability-02(UNSAT) depth K=6 took 232 ms
[2020-05-18 05:38:44] [INFO ] Computing symmetric co enabling matrix : 15 transitions.
[2020-05-18 05:38:44] [INFO ] BMC solution for property GPPP-PT-C0100N0000000010-ReachabilityFireability-02(UNSAT) depth K=7 took 327 ms
SDD proceeding with computation, new max is 2048
[2020-05-18 05:38:45] [INFO ] Computation of Finished co-enabling matrix. took 555 ms. Total solver calls (SAT/UNSAT): 69(64/5)
[2020-05-18 05:38:45] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2020-05-18 05:38:45] [INFO ] BMC solution for property GPPP-PT-C0100N0000000010-ReachabilityFireability-02(UNSAT) depth K=8 took 357 ms
[2020-05-18 05:38:45] [INFO ] BMC solution for property GPPP-PT-C0100N0000000010-ReachabilityFireability-02(UNSAT) depth K=9 took 358 ms
[2020-05-18 05:38:45] [INFO ] Computation of Completed DNA matrix. took 607 ms. Total solver calls (SAT/UNSAT): 29(0/29)
[2020-05-18 05:38:45] [INFO ] Built C files in 1781ms 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]
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,9.96027e+08,1.76728,35292,8542,3983,47005,12652,132,57467,68,246077,0
Total reachable state count : 996027405

Verifying 1 reachability properties.
Reachability property GPPP-PT-C0100N0000000010-ReachabilityFireability-02 does not hold.
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : GPPP-PT-C0100N0000000010-ReachabilityFireability-02

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
GPPP-PT-C0100N0000000010-ReachabilityFireability-02,0,1.852,35196,1,0,47005,12652,151,57467,125,246077,8799
[2020-05-18 05:38:46] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-18 05:38:46] [WARNING] Unexpected error occurred while running SMT. Was verifying GPPP-PT-C0100N0000000010-ReachabilityFireability-02 SMT depth 10
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-18 05:38:46] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2020-05-18 05:38:46] [INFO ] During BMC, SMT solver timed out at depth 10
[2020-05-18 05:38:46] [INFO ] BMC solving timed out (3600000 secs) at depth 10
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-18 05:38:46] [WARNING] Unexpected error occurred while running SMT. Was verifying GPPP-PT-C0100N0000000010-ReachabilityFireability-02 K-induction depth 0
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-18 05:38:46] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.

BK_STOP 1589780327187

--------------------
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="GPPP-PT-C0100N0000000010"
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 GPPP-PT-C0100N0000000010, 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 r081-smll-158922978000495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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