Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257700474.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ParamProductionCell-PT-1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257700474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 3.8K Apr 13 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 13 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 13 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 13 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 13 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 13 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 13 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 13 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 13 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 13 14:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 13 14:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 13 14:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-1-00
FORMULA_NAME ParamProductionCell-PT-1-01
FORMULA_NAME ParamProductionCell-PT-1-02
FORMULA_NAME ParamProductionCell-PT-1-03
FORMULA_NAME ParamProductionCell-PT-1-04
FORMULA_NAME ParamProductionCell-PT-1-05
FORMULA_NAME ParamProductionCell-PT-1-06
FORMULA_NAME ParamProductionCell-PT-1-07
FORMULA_NAME ParamProductionCell-PT-1-08
FORMULA_NAME ParamProductionCell-PT-1-09
FORMULA_NAME ParamProductionCell-PT-1-10
FORMULA_NAME ParamProductionCell-PT-1-11
FORMULA_NAME ParamProductionCell-PT-1-12
FORMULA_NAME ParamProductionCell-PT-1-13
FORMULA_NAME ParamProductionCell-PT-1-14
FORMULA_NAME ParamProductionCell-PT-1-15

=== Now, execution of the tool begins

BK_START 1590000551636

[2020-05-20 18:49:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-20 18:49:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:49:14] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2020-05-20 18:49:14] [INFO ] Transformed 231 places.
[2020-05-20 18:49:14] [INFO ] Transformed 202 transitions.
[2020-05-20 18:49:14] [INFO ] Found NUPN structural information;
[2020-05-20 18:49:14] [INFO ] Parsed PT model containing 231 places and 202 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 243 ms. (steps per millisecond=411 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1]
// Phase 1: matrix 202 rows 231 cols
[2020-05-20 18:49:14] [INFO ] Computed 59 place invariants in 22 ms
[2020-05-20 18:49:14] [INFO ] [Real]Absence check using 35 positive place invariants in 38 ms returned sat
[2020-05-20 18:49:14] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2020-05-20 18:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:14] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2020-05-20 18:49:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2020-05-20 18:49:15] [INFO ] [Real]Added 68 Read/Feed constraints in 35 ms returned sat
[2020-05-20 18:49:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 26 ms returned sat
[2020-05-20 18:49:15] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-05-20 18:49:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:15] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2020-05-20 18:49:15] [INFO ] [Nat]Added 68 Read/Feed constraints in 24 ms returned sat
[2020-05-20 18:49:15] [INFO ] Deduced a trap composed of 7 places in 200 ms
[2020-05-20 18:49:16] [INFO ] Deduced a trap composed of 6 places in 161 ms
[2020-05-20 18:49:16] [INFO ] Deduced a trap composed of 5 places in 154 ms
[2020-05-20 18:49:16] [INFO ] Deduced a trap composed of 7 places in 104 ms
[2020-05-20 18:49:16] [INFO ] Deduced a trap composed of 7 places in 187 ms
[2020-05-20 18:49:16] [INFO ] Deduced a trap composed of 10 places in 139 ms
[2020-05-20 18:49:16] [INFO ] Deduced a trap composed of 78 places in 101 ms
[2020-05-20 18:49:17] [INFO ] Deduced a trap composed of 28 places in 247 ms
[2020-05-20 18:49:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 1471 ms
[2020-05-20 18:49:17] [INFO ] [Real]Absence check using 35 positive place invariants in 26 ms returned sat
[2020-05-20 18:49:17] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-05-20 18:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:17] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2020-05-20 18:49:17] [INFO ] [Real]Added 68 Read/Feed constraints in 51 ms returned sat
[2020-05-20 18:49:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-05-20 18:49:17] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-05-20 18:49:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:18] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2020-05-20 18:49:18] [INFO ] [Nat]Added 68 Read/Feed constraints in 52 ms returned sat
[2020-05-20 18:49:18] [INFO ] Deduced a trap composed of 5 places in 249 ms
[2020-05-20 18:49:18] [INFO ] Deduced a trap composed of 5 places in 94 ms
[2020-05-20 18:49:18] [INFO ] Deduced a trap composed of 5 places in 110 ms
[2020-05-20 18:49:18] [INFO ] Deduced a trap composed of 8 places in 175 ms
[2020-05-20 18:49:18] [INFO ] Deduced a trap composed of 44 places in 115 ms
[2020-05-20 18:49:19] [INFO ] Deduced a trap composed of 7 places in 90 ms
[2020-05-20 18:49:19] [INFO ] Deduced a trap composed of 21 places in 105 ms
[2020-05-20 18:49:19] [INFO ] Deduced a trap composed of 54 places in 95 ms
[2020-05-20 18:49:19] [INFO ] Deduced a trap composed of 14 places in 194 ms
[2020-05-20 18:49:19] [INFO ] Deduced a trap composed of 83 places in 116 ms
[2020-05-20 18:49:19] [INFO ] Deduced a trap composed of 8 places in 123 ms
[2020-05-20 18:49:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 1658 ms
[2020-05-20 18:49:19] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2020-05-20 18:49:19] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 24 ms returned sat
[2020-05-20 18:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:20] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2020-05-20 18:49:20] [INFO ] [Real]Added 68 Read/Feed constraints in 40 ms returned sat
[2020-05-20 18:49:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-05-20 18:49:20] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2020-05-20 18:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:20] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2020-05-20 18:49:20] [INFO ] [Nat]Added 68 Read/Feed constraints in 13 ms returned sat
[2020-05-20 18:49:21] [INFO ] Deduced a trap composed of 5 places in 780 ms
[2020-05-20 18:49:21] [INFO ] Deduced a trap composed of 8 places in 114 ms
[2020-05-20 18:49:21] [INFO ] Deduced a trap composed of 7 places in 103 ms
[2020-05-20 18:49:21] [INFO ] Deduced a trap composed of 5 places in 102 ms
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 7 places in 425 ms
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 10 places in 225 ms
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 14 places in 81 ms
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 50 places in 86 ms
[2020-05-20 18:49:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 2046 ms
[2020-05-20 18:49:22] [INFO ] [Real]Absence check using 35 positive place invariants in 50 ms returned sat
[2020-05-20 18:49:22] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2020-05-20 18:49:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:23] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2020-05-20 18:49:23] [INFO ] [Real]Added 68 Read/Feed constraints in 31 ms returned sat
[2020-05-20 18:49:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-05-20 18:49:23] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2020-05-20 18:49:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:23] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2020-05-20 18:49:23] [INFO ] [Nat]Added 68 Read/Feed constraints in 20 ms returned sat
[2020-05-20 18:49:23] [INFO ] Deduced a trap composed of 7 places in 136 ms
[2020-05-20 18:49:23] [INFO ] Deduced a trap composed of 7 places in 94 ms
[2020-05-20 18:49:24] [INFO ] Deduced a trap composed of 7 places in 104 ms
[2020-05-20 18:49:24] [INFO ] Deduced a trap composed of 30 places in 324 ms
[2020-05-20 18:49:24] [INFO ] Deduced a trap composed of 24 places in 94 ms
[2020-05-20 18:49:24] [INFO ] Deduced a trap composed of 9 places in 146 ms
[2020-05-20 18:49:24] [INFO ] Deduced a trap composed of 6 places in 233 ms
[2020-05-20 18:49:25] [INFO ] Deduced a trap composed of 5 places in 91 ms
[2020-05-20 18:49:25] [INFO ] Deduced a trap composed of 32 places in 167 ms
[2020-05-20 18:49:25] [INFO ] Deduced a trap composed of 13 places in 329 ms
[2020-05-20 18:49:25] [INFO ] Deduced a trap composed of 79 places in 216 ms
[2020-05-20 18:49:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 2162 ms
[2020-05-20 18:49:26] [INFO ] [Real]Absence check using 35 positive place invariants in 247 ms returned sat
[2020-05-20 18:49:26] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-05-20 18:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:26] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-05-20 18:49:26] [INFO ] [Real]Added 68 Read/Feed constraints in 38 ms returned sat
[2020-05-20 18:49:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 27 ms returned sat
[2020-05-20 18:49:26] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-05-20 18:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:26] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2020-05-20 18:49:26] [INFO ] [Nat]Added 68 Read/Feed constraints in 13 ms returned sat
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 7 places in 86 ms
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 10 places in 105 ms
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 24 places in 101 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 8 places in 105 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 7 places in 97 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 10 places in 101 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 11 places in 103 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 8 places in 110 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 41 places in 89 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 92 places in 89 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 45 places in 104 ms
[2020-05-20 18:49:28] [INFO ] Deduced a trap composed of 5 places in 91 ms
[2020-05-20 18:49:28] [INFO ] Deduced a trap composed of 29 places in 93 ms
[2020-05-20 18:49:28] [INFO ] Deduced a trap composed of 44 places in 99 ms
[2020-05-20 18:49:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 1647 ms
[2020-05-20 18:49:28] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-05-20 18:49:28] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-05-20 18:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:28] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2020-05-20 18:49:28] [INFO ] [Real]Added 68 Read/Feed constraints in 81 ms returned sat
[2020-05-20 18:49:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned sat
[2020-05-20 18:49:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-05-20 18:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:29] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2020-05-20 18:49:29] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2020-05-20 18:49:29] [INFO ] Deduced a trap composed of 8 places in 92 ms
[2020-05-20 18:49:29] [INFO ] Deduced a trap composed of 5 places in 109 ms
[2020-05-20 18:49:29] [INFO ] Deduced a trap composed of 10 places in 101 ms
[2020-05-20 18:49:29] [INFO ] Deduced a trap composed of 10 places in 56 ms
[2020-05-20 18:49:29] [INFO ] Deduced a trap composed of 21 places in 51 ms
[2020-05-20 18:49:29] [INFO ] Deduced a trap composed of 25 places in 55 ms
[2020-05-20 18:49:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 545 ms
[2020-05-20 18:49:29] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned sat
[2020-05-20 18:49:29] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-05-20 18:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:29] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-05-20 18:49:29] [INFO ] [Real]Added 68 Read/Feed constraints in 28 ms returned sat
[2020-05-20 18:49:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-05-20 18:49:29] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-05-20 18:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:30] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2020-05-20 18:49:30] [INFO ] [Nat]Added 68 Read/Feed constraints in 14 ms returned sat
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 6 places in 100 ms
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 7 places in 85 ms
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 5 places in 113 ms
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 5 places in 105 ms
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 26 places in 94 ms
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 14 places in 106 ms
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 24 places in 92 ms
[2020-05-20 18:49:31] [INFO ] Deduced a trap composed of 45 places in 89 ms
[2020-05-20 18:49:31] [INFO ] Deduced a trap composed of 34 places in 90 ms
[2020-05-20 18:49:31] [INFO ] Deduced a trap composed of 7 places in 84 ms
[2020-05-20 18:49:31] [INFO ] Deduced a trap composed of 38 places in 84 ms
[2020-05-20 18:49:31] [INFO ] Deduced a trap composed of 53 places in 80 ms
[2020-05-20 18:49:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1287 ms
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
[2020-05-20 18:49:31] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-20 18:49:31] [INFO ] Flatten gal took : 131 ms
FORMULA ParamProductionCell-PT-1-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-20 18:49:31] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-20 18:49:31] [INFO ] Applying decomposition
[2020-05-20 18:49:32] [INFO ] Flatten gal took : 19 ms
[2020-05-20 18:49:32] [INFO ] Input system was already deterministic with 202 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/graph10538409318299372976.txt, -o, /tmp/graph10538409318299372976.bin, -w, /tmp/graph10538409318299372976.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/graph10538409318299372976.bin, -l, -1, -v, -w, /tmp/graph10538409318299372976.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 18:49:32] [INFO ] Decomposing Gal with order
[2020-05-20 18:49:32] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 202 rows 231 cols
[2020-05-20 18:49:32] [INFO ] Computed 59 place invariants in 6 ms
inv : arm2_storing + arm2_having_swivel_1 + arm2_waiting_for_swivel_2 + A2U_rotated + A2U_in + A2U_rot1_in + A2U_rot2_in + A2U_rot3_in + A2U_rot1_rs + A2U_rot1_run + A2U_rot2_rs + A2U_rot2_run + A2U_rot3_rs + A2U_rot3_run + A2U_extended - arm2_magnet_on + A2U_ext_rs + A2U_ext_run + A2L_out + A2L_loaded + A2L_ret_rs + A2L_ret_run = 0
inv : arm2_magnet_off + arm2_magnet_on = 1
inv : belt1_start - FB_trans_rs - FB_trans_run - FB_deliver_rs - FB_deliver_run = 0
inv : ch_DC_full + ch_CF_full - ch_A1P_free - ch_TA1_free - ch_A2D_free + ch_FT_full + ch_PA2_full - press_ready_for_unloading - PL_in - PL_out - PL_lower_rs - PL_lower_run + table_ready_for_unloading + TU_in + TU_out + table_at_unload_angle + TU_lift_rs + TU_lift_run + TU_rot_rs + TU_rot_run - deposit_belt_empty + feed_belt_occupied + FB_in + FB_at_end + FB_out + FB_trans_rs + FB_trans_run + FB_deliver_rs + FB_deliver_run + arm2_waiting_for_swivel_1 - arm2_waiting_for_swivel_2 - A2U_rotated - A2U_in - A2U_rot1_in - A2U_rot2_in - A2U_rot3_in - A2U_rot1_rs - A2U_rot1_run - A2U_rot2_rs - A2U_rot2_run - A2U_rot3_rs - A2U_rot3_run - A2U_extended + arm2_magnet_on - A2U_ext_rs - A2U_ext_run + A2L_rotated + A2L_in + A2L_rot1_in + A2L_rot2_in + A2L_rot3_in + A2L_rot1_rs + A2L_rot1_run + A2L_rot2_rs + A2L_rot2_run + A2L_rot3_rs + A2L_rot3_run + A2L_extended + A2L_ext_rs + A2L_ext_run - arm1_waiting_for_swivel_2 - A1L_out - A1L_loaded - arm1_magnet_off - A1L_ret_rs - A1L_ret_run - A1U_rotated - A1U_in - A1U_rot1_in - A1U_rot2_in - A1U_rot3_in - A1U_rot1_rs - A1U_rot1_run - A1U_rot2_rs - A1U_rot2_run - A1U_rot3_rs - A1U_rot3_run - A1U_extendet - A1U_ext_rs - A1U_ext_run + crane_mag_on + CU_unloaded + CU_ready_to_transport + CU_out + CU_lift_rs + CU_lift_run + CU_trans_rs + CU_trans_run + CL_in + CL_ready_to_grasp + CL_lower_rs + CL_lower_run = -2
inv : swivel + arm2_having_swivel_2 + arm2_having_swivel_1 + A2U_rotated + A2U_in + A2U_out + A2U_rot1_in + A2U_rot2_in + A2U_rot3_in + A2U_rot1_rs + A2U_rot1_run + A2U_rot2_rs + A2U_rot2_run + A2U_rot3_rs + A2U_rot3_run + A2U_extended + A2U_unloaded + A2U_ext_rs + A2U_ext_run + A2U_ret_rs + A2U_ret_run + A2L_rotated + A2L_in + A2L_out + A2L_rot1_in + A2L_rot2_in + A2L_rot3_in + A2L_rot1_rs + A2L_rot1_run + A2L_rot2_rs + A2L_rot2_run + A2L_rot3_rs + A2L_rot3_run + A2L_extended + A2L_loaded + A2L_ext_rs + A2L_ext_run + A2L_ret_rs + A2L_ret_run + arm1_having_swivel_2 + arm1_having_swivel_1 + A1L_rotated + A1L_in + A1L_out + A1L_rot1_in + A1L_rot2_in + A1L_rot3_in + A1L_rot1_rs + A1L_rot1_run + A1L_rot2_rs + A1L_rot2_run + A1L_rot3_rs + A1L_rot3_run + A1_extended + A1L_loaded + A1L_ext_rs + A1L_ext_run + A1L_ret_rs + A1L_ret_run + A1U_rotated + A1U_out + A1U_in + A1U_rot1_in + A1U_rot2_in + A1U_rot3_in + A1U_rot1_rs + A1U_rot1_run + A1U_rot2_rs + A1U_rot2_run + A1U_rot3_rs + A1U_rot3_run + A1U_extendet + A1U_unloadet + A1U_ext_rs + A1U_ext_run + A1U_ret_rs + A1U_ret_run = 1
inv : arm1_magnet_on + arm1_magnet_off = 1
inv : robot_left - A2U_rot2_rs - A2U_rot2_run - A2L_rot1_rs - A2L_rot1_run - A2L_rot2_rs - A2L_rot2_run - A2L_rot3_rs - A2L_rot3_run - A1L_rot1_rs - A1L_rot1_run - A1L_rot2_rs - A1L_rot2_run - A1L_rot3_rs - A1L_rot3_run - A1U_rot3_rs - A1U_rot3_run = 0
inv : belt2_start - DB_trans_rs - DB_trans_run - DB_deliver_rs - DB_deliver_run = 0
inv : arm1_pick_up_ext + arm1_retract_ext + arm1_release_ext = 1
inv : table_load_angle + table_unload_angle = 1
inv : crane_store_free + crane_mag_on + CU_unloaded + CU_ready_to_transport + CU_out + CU_lift_rs + CU_lift_run + CU_trans_rs + CU_trans_run + CL_in + CL_ready_to_grasp + CL_lower_rs + CL_lower_run = 1
inv : arm2_forward - A2U_ext_rs - A2U_ext_run - A2L_ext_rs - A2L_ext_run = 0
inv : ch_DC_free - ch_CF_full + ch_A1P_free + ch_TA1_free + ch_A2D_free - ch_FT_full - ch_PA2_full + press_ready_for_unloading + PL_in + PL_out + PL_lower_rs + PL_lower_run - table_ready_for_unloading - TU_in - TU_out - table_at_unload_angle - TU_lift_rs - TU_lift_run - TU_rot_rs - TU_rot_run + deposit_belt_empty + DB_in + DB_at_end + DB_out + DB_trans_rs + DB_trans_run + DB_deliver_rs + DB_deliver_run - feed_belt_occupied - FB_in - FB_at_end - FB_out - FB_trans_rs - FB_trans_run - FB_deliver_rs - FB_deliver_run - arm2_waiting_for_swivel_1 + arm2_waiting_for_swivel_2 + A2U_rotated + A2U_in + A2U_rot1_in + A2U_rot2_in + A2U_rot3_in + A2U_rot1_rs + A2U_rot1_run + A2U_rot2_rs + A2U_rot2_run + A2U_rot3_rs + A2U_rot3_run + A2U_extended - arm2_magnet_on + A2U_ext_rs + A2U_ext_run - A2L_rotated - A2L_in - A2L_rot1_in - A2L_rot2_in - A2L_rot3_in - A2L_rot1_rs - A2L_rot1_run - A2L_rot2_rs - A2L_rot2_run - A2L_rot3_rs - A2L_rot3_run - A2L_extended - A2L_ext_rs - A2L_ext_run + arm1_waiting_for_swivel_2 + A1L_out + A1L_loaded + arm1_magnet_off + A1L_ret_rs + A1L_ret_run + A1U_rotated + A1U_in + A1U_rot1_in + A1U_rot2_in + A1U_rot3_in + A1U_rot1_rs + A1U_rot1_run + A1U_rot2_rs + A1U_rot2_run + A1U_rot3_rs + A1U_rot3_run + A1U_extendet + A1U_ext_rs + A1U_ext_run - crane_mag_on - CU_unloaded - CU_ready_to_transport - CU_out - CU_lift_rs - CU_lift_run - CU_trans_rs - CU_trans_run + CL_out + CL_ready_to_transport + CL_loaded + CL_trans_rs + CL_trans_run + CL_lift_rs + CL_lift_run = 3
inv : robot_stop + A2U_rot1_rs + A2U_rot1_run + A2U_rot2_rs + A2U_rot2_run + A2U_rot3_rs + A2U_rot3_run + A2L_rot1_rs + A2L_rot1_run + A2L_rot2_rs + A2L_rot2_run + A2L_rot3_rs + A2L_rot3_run + A1L_rot1_rs + A1L_rot1_run + A1L_rot2_rs + A1L_rot2_run + A1L_rot3_rs + A1L_rot3_run + A1U_rot1_rs + A1U_rot1_run + A1U_rot2_rs + A1U_rot2_run + A1U_rot3_rs + A1U_rot3_run = 1
inv : deposit_belt_idle + deposit_belt_occupied + deposit_belt_empty + DB_in + DB_at_end + DB_out + DB_trans_rs + DB_trans_run + DB_deliver_rs + DB_deliver_run = 1
inv : press_stop + PU_lower_rs + PU_lower_run + forge_rs + forge_run + PL_lower_rs + PL_lower_run = 1
inv : table_ready_for_loading + table_ready_for_unloading + TL_out + TL_in + table_at_load_angle + TL_rot_rs + TL_rot_run + TL_lower_rs + TL_lower_run + TU_in + TU_out + table_at_unload_angle + TU_lift_rs + TU_lift_run + TU_rot_rs + TU_rot_run = 1
inv : crane_storing - crane_mag_on + CU_ready_to_ungrasp + CU_in + CU_lower_rs + CU_lower_run + CL_out + CL_ready_to_transport + CL_loaded + CL_trans_rs + CL_trans_run + CL_lift_rs + CL_lift_run = 0
inv : ch_FT_free + ch_FT_full + table_ready_for_unloading + TL_out + TL_in + table_at_load_angle + TL_rot_rs + TL_rot_run + TL_lower_rs + TL_lower_run + TU_in + TU_out + table_at_unload_angle + TU_lift_rs + TU_lift_run + TU_rot_rs + TU_rot_run + FB_in + FB_at_end + FB_out + FB_trans_rs + FB_trans_run + FB_deliver_rs + FB_deliver_run = 1
inv : arm1_store_free + arm1_waiting_for_swivel_1 + arm1_having_swivel_2 + A1L_rotated + A1L_in + A1L_rot1_in + A1L_rot2_in + A1L_rot3_in + A1L_rot1_rs + A1L_rot1_run + A1L_rot2_rs + A1L_rot2_run + A1L_rot3_rs + A1L_rot3_run + A1_extended - arm1_magnet_off + A1L_ext_rs + A1L_ext_run + A1U_out + A1U_unloadet + A1U_ret_rs + A1U_ret_run = 0
inv : arm1_storing + arm1_having_swivel_1 + arm1_waiting_for_swivel_2 + A1L_out + A1L_loaded + arm1_magnet_off + A1L_ret_rs + A1L_ret_run + A1U_rotated + A1U_in + A1U_rot1_in + A1U_rot2_in + A1U_rot3_in + A1U_rot1_rs + A1U_rot1_run + A1U_rot2_rs + A1U_rot2_run + A1U_rot3_rs + A1U_rot3_run + A1U_extendet + A1U_ext_rs + A1U_ext_run = 1
inv : arm2_release_ext + arm2_retract_ext + arm2_pick_up_ext = 1
inv : press_ready_for_loading + press_ready_for_unloading + PU_out + blank_forged + PU_in + PU_lower_rs + PU_lower_run + forge_rs + forge_run + PL_in + PL_out + PL_lower_rs + PL_lower_run = 1
inv : arm2_backward - A2U_ret_rs - A2U_ret_run - A2L_ret_rs - A2L_ret_run = 0
inv : ch_CF_free + ch_CF_full + feed_belt_occupied + feed_belt_empty + FB_in + FB_at_end + FB_out + FB_trans_rs + FB_trans_run + FB_deliver_rs + FB_deliver_run + CU_unloaded + CU_ready_to_transport + CU_out + CU_ready_to_ungrasp + CU_in + CU_lift_rs + CU_lift_run + CU_trans_rs + CU_trans_run + CU_lower_rs + CU_lower_run = 1
inv : press_at_upper_pos + press_at_lower_pos + press_at_middle_pos = 1
inv : feed_belt_idle + feed_belt_occupied + feed_belt_empty + FB_in + FB_at_end + FB_out + FB_trans_rs + FB_trans_run + FB_deliver_rs + FB_deliver_run = 1
inv : arm2_store_free + arm2_waiting_for_swivel_1 + arm2_having_swivel_2 + A2U_out + A2U_unloaded + arm2_magnet_on + A2U_ret_rs + A2U_ret_run + A2L_rotated + A2L_in + A2L_rot1_in + A2L_rot2_in + A2L_rot3_in + A2L_rot1_rs + A2L_rot1_run + A2L_rot2_rs + A2L_rot2_run + A2L_rot3_rs + A2L_rot3_run + A2L_extended + A2L_ext_rs + A2L_ext_run = 1
inv : table_stop_v + TL_lower_rs + TL_lower_run + TU_lift_rs + TU_lift_run = 1
inv : press_down - PU_lower_rs - PU_lower_run = 0
inv : crane_lower - CU_lower_rs - CU_lower_run - CL_lower_rs - CL_lower_run = 0
inv : ch_TA1_full + ch_TA1_free - table_ready_for_unloading + arm1_waiting_for_swivel_1 + A1L_rotated + A1L_in + A1L_out + A1L_rot1_in + A1L_rot2_in + A1L_rot3_in + A1L_rot1_rs + A1L_rot1_run + A1L_rot2_rs + A1L_rot2_run + A1L_rot3_rs + A1L_rot3_run + A1_extended + A1L_loaded + A1L_ext_rs + A1L_ext_run + A1L_ret_rs + A1L_ret_run = 0
inv : crane_lift - CU_lift_rs - CU_lift_run - CL_lift_rs - CL_lift_run = 0
inv : crane_transport_height + crane_release_height + crane_pick_up_height = 1
inv : table_right - TL_rot_rs - TL_rot_run - TU_rot_rs - TU_rot_run = 0
inv : crane_to_belt2 - CU_trans_rs - CU_trans_run = 0
inv : ch_A1P_full + ch_A1P_free + press_ready_for_unloading + PU_out + blank_forged + PU_in + PU_lower_rs + PU_lower_run + forge_rs + forge_run + PL_in + PL_out + PL_lower_rs + PL_lower_run + arm1_waiting_for_swivel_2 + A1U_rotated + A1U_out + A1U_in + A1U_rot1_in + A1U_rot2_in + A1U_rot3_in + A1U_rot1_rs + A1U_rot1_run + A1U_rot2_rs + A1U_rot2_run + A1U_rot3_rs + A1U_rot3_run + A1U_extendet + A1U_unloadet + A1U_ext_rs + A1U_ext_run + A1U_ret_rs + A1U_ret_run = 1
inv : press_upward - forge_rs - forge_run = 0
inv : belt2_light_barrier_true + belt2_light_barrier_false = 1
inv : ch_A2D_full + ch_A2D_free + deposit_belt_occupied + deposit_belt_empty + DB_in + DB_at_end + DB_out + DB_trans_rs + DB_trans_run + DB_deliver_rs + DB_deliver_run + arm2_waiting_for_swivel_2 + A2U_rotated + A2U_in + A2U_out + A2U_rot1_in + A2U_rot2_in + A2U_rot3_in + A2U_rot1_rs + A2U_rot1_run + A2U_rot2_rs + A2U_rot2_run + A2U_rot3_rs + A2U_rot3_run + A2U_extended + A2U_unloaded + A2U_ext_rs + A2U_ext_run + A2U_ret_rs + A2U_ret_run = 1
inv : crane_stop_h + CU_trans_rs + CU_trans_run + CL_trans_rs + CL_trans_run = 1
inv : crane_stop_v + CU_lift_rs + CU_lift_run + CU_lower_rs + CU_lower_run + CL_lower_rs + CL_lower_run + CL_lift_rs + CL_lift_run = 1
inv : belt2_stop + DB_trans_rs + DB_trans_run + DB_deliver_rs + DB_deliver_run = 1
inv : crane_mag_off + crane_mag_on = 1
inv : robot_right - A2U_rot1_rs - A2U_rot1_run - A2U_rot3_rs - A2U_rot3_run - A1U_rot1_rs - A1U_rot1_run - A1U_rot2_rs - A1U_rot2_run = 0
inv : press_up - PL_lower_rs - PL_lower_run = 0
inv : belt1_stop + FB_trans_rs + FB_trans_run + FB_deliver_rs + FB_deliver_run = 1
inv : arm1_backward - A1L_ret_rs - A1L_ret_run - A1U_ret_rs - A1U_ret_run = 0
inv : ch_PA2_free + ch_PA2_full - press_ready_for_unloading + arm2_waiting_for_swivel_1 + A2L_rotated + A2L_in + A2L_out + A2L_rot1_in + A2L_rot2_in + A2L_rot3_in + A2L_rot1_rs + A2L_rot1_run + A2L_rot2_rs + A2L_rot2_run + A2L_rot3_rs + A2L_rot3_run + A2L_extended + A2L_loaded + A2L_ext_rs + A2L_ext_run + A2L_ret_rs + A2L_ret_run = 0
inv : arm1_forward - A1L_ext_rs - A1L_ext_run - A1U_ext_rs - A1U_ext_run = 0
inv : table_upward - TL_lower_rs - TL_lower_run - TU_lift_rs - TU_lift_run = 0
inv : crane_above_deposit_belt + crane_above_feed_belt = 1
inv : crane_to_belt1 - CL_trans_rs - CL_trans_run = 0
inv : table_bottom_pos + table_top_pos = 1
inv : belt1_light_barrier_true + belt1_light_barrier_false = 1
inv : table_stop_h + TL_rot_rs + TL_rot_run + TU_rot_rs + TU_rot_run = 1
inv : arm1_stop + A1L_ext_rs + A1L_ext_run + A1L_ret_rs + A1L_ret_run + A1U_ext_rs + A1U_ext_run + A1U_ret_rs + A1U_ret_run = 1
inv : arm2_stop + A2U_ext_rs + A2U_ext_run + A2U_ret_rs + A2U_ret_run + A2L_ext_rs + A2L_ext_run + A2L_ret_rs + A2L_ret_run = 1
inv : arm2_release_angle + arm1_pick_up_angle + arm1_release_angle + arm2_pick_up_angle = 1
Total of 59 invariants.
[2020-05-20 18:49:32] [INFO ] Computed 59 place invariants in 8 ms
[2020-05-20 18:49:32] [INFO ] Removed a total of 86 redundant transitions.
[2020-05-20 18:49:32] [INFO ] Flatten gal took : 161 ms
[2020-05-20 18:49:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-20 18:49:32] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 33 ms
[2020-05-20 18:49:32] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((G((!(X("((i7.u53.arm2_pick_up_ext==1)&&(i7.u53.A2L_ext_run==1))")))U((!(F(X("((i7.u53.arm2_pick_up_ext==1)&&(i7.u53.A2L_ext_run==1))"))))&&(!(X("((i7.u53.arm2_pick_up_ext==1)&&(i7.u53.A2L_ext_run==1))")))))))
Formula 0 simplified : !G(!X"((i7.u53.arm2_pick_up_ext==1)&&(i7.u53.A2L_ext_run==1))" U (!X"((i7.u53.arm2_pick_up_ext==1)&&(i7.u53.A2L_ext_run==1))" & !FX"((i7.u53.arm2_pick_up_ext==1)&&(i7.u53.A2L_ext_run==1))"))
built 14 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 22 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 63 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions PL_lower_Pstart, TL_rot_Pstart, TU_rot_Pstart, DB_trans_Pstart, A2U_ext_Pstart, A2L_ext_Pstart, A1L_ext_Pstart, A1U_ext_Pstart, CU_lower_Pstart, CL_lower_Pstart, CL_trans_Pstart, i0.arm1_unlock_swivel_2, i0.arm2_unlock_swivel_2, i1.forge_Pstart, i1.i0.PU_lower_Pstart, i2.TU_lift_Pstart, i2.i1.TL_lower_Pstart, i3.i3.CU_trans_Pstart, i4.DB_deliver_Pstart, i5.FB_trans_Pstart, i5.i2.FB_deliver_Pstart, i6.A1U_rot1_Pstart, i6.A1L_rot3_Pstart, i6.A2L_rot2_Pstart, i6.A2U_rot3_Pstart, i7.A2L_ret_Pstart, i7.A2U_ret_Pstart, i8.A1U_ret_Pstart, i8.A1L_ret_Pstart, i9.CL_lift_Pstart, i9.CU_lift_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :40/131/31/202
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
29 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.340563,25748,1,0,17118,533,3653,19808,289,1308,79581
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ParamProductionCell-PT-1-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(((!(F(((F("((i0.i4.u55.swivel==1)&&(i0.i0.u3.arm1_waiting_for_swivel_1==1))"))&&("(i1.i0.u10.press_stop==1)"))&&("(i1.i0.u10.blank_forged==1)"))))||(!(G("((i1.i0.u10.press_stop==1)&&(i1.i0.u10.blank_forged==1))"))))U(X("((i6.u40.arm2_release_angle==1)&&(i6.u42.A2U_rot3_run==1))")))))
Formula 1 simplified : (!F("(i1.i0.u10.blank_forged==1)" & "(i1.i0.u10.press_stop==1)" & F"((i0.i4.u55.swivel==1)&&(i0.i0.u3.arm1_waiting_for_swivel_1==1))") | !G"((i1.i0.u10.press_stop==1)&&(i1.i0.u10.blank_forged==1))") U X"((i6.u40.arm2_release_angle==1)&&(i6.u42.A2U_rot3_run==1))"
108 unique states visited
108 strongly connected components in search stack
108 transitions explored
108 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.488963,32068,1,0,27399,535,3827,29273,307,1318,119908
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ParamProductionCell-PT-1-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(X(G(F("((i8.u60.arm1_stop==1)&&(i6.u39.A1U_rotated==1))")))))))
Formula 2 simplified : XXGF"((i8.u60.arm1_stop==1)&&(i6.u39.A1U_rotated==1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
37 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.857229,47436,1,0,65767,536,3868,67577,307,1329,200614
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ParamProductionCell-PT-1-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((G("((((i6.u40.arm2_release_angle!=1)||(i6.u39.robot_left!=1))||(i6.u59.A1L_rot3_run!=1))&&(i0.i3.u4.A1L_out==1))"))||((((G(("((i3.i3.u77.crane_above_deposit_belt==1)&&(i3.i3.u77.CU_trans_run==1))")U("((i3.i3.u77.crane_above_deposit_belt!=1)||(i3.i3.u77.CU_trans_run!=1))")))&&("(i6.u40.arm2_release_angle==1)"))&&("(i6.u39.robot_left==1)"))&&("(i6.u59.A1L_rot3_run==1)")))))
Formula 3 simplified : !X(G"((((i6.u40.arm2_release_angle!=1)||(i6.u39.robot_left!=1))||(i6.u59.A1L_rot3_run!=1))&&(i0.i3.u4.A1L_out==1))" | ("(i6.u39.robot_left==1)" & "(i6.u40.arm2_release_angle==1)" & "(i6.u59.A1L_rot3_run==1)" & G("((i3.i3.u77.crane_above_deposit_belt==1)&&(i3.i3.u77.CU_trans_run==1))" U "((i3.i3.u77.crane_above_deposit_belt!=1)||(i3.i3.u77.CU_trans_run!=1))")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.879753,47948,1,0,65923,536,4007,67807,316,1329,201318
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ParamProductionCell-PT-1-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F("((i2.i1.u21.table_bottom_pos==1)&&(i2.i1.u21.TL_lower_run==1))")))
Formula 4 simplified : !F"((i2.i1.u21.table_bottom_pos==1)&&(i2.i1.u21.TL_lower_run==1))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.996622,52172,1,0,78989,538,4040,74697,316,1331,230466
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-1-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(((F("(((i7.u47.arm2_release_ext==1)&&(i7.u43.arm2_backward==1))&&(i7.u48.A2U_ret_run==1))"))&&(F(G("((i0.i3.u4.ch_TA1_free==1)&&(i0.i3.u16.table_ready_for_unloading==1))"))))U("((i0.i3.u4.ch_TA1_free==1)&&(i0.i3.u16.table_ready_for_unloading==1))"))))
Formula 5 simplified : !G((F"(((i7.u47.arm2_release_ext==1)&&(i7.u43.arm2_backward==1))&&(i7.u48.A2U_ret_run==1))" & FG"((i0.i3.u4.ch_TA1_free==1)&&(i0.i3.u16.table_ready_for_unloading==1))") U "((i0.i3.u4.ch_TA1_free==1)&&(i0.i3.u16.table_ready_for_unloading==1))")
4 unique states visited
3 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
17 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.17261,60620,1,0,103398,538,4121,89054,316,1331,279424
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ParamProductionCell-PT-1-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(!(F("((i6.u37.A2U_in==1)&&(i6.u50.arm2_pick_up_angle==1))")))))
Formula 6 simplified : !F!F"((i6.u37.A2U_in==1)&&(i6.u50.arm2_pick_up_angle==1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
25 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.43779,69068,1,0,122797,539,4161,105787,316,1333,319719
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ParamProductionCell-PT-1-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(X(G((G((G(X(F("(i5.i0.u17.TL_out==1)"))))&&(X("(((i5.i2.u33.belt1_light_barrier_true==1)&&(i5.i2.u32.belt1_start==1))&&(i5.i2.u34.FB_deliver_run==1))"))))&&(X("(i5.i0.u17.TL_out==1)"))))))))
Formula 7 simplified : !XXXG(G(GXF"(i5.i0.u17.TL_out==1)" & X"(((i5.i2.u33.belt1_light_barrier_true==1)&&(i5.i2.u32.belt1_start==1))&&(i5.i2.u34.FB_deliver_run==1))") & X"(i5.i0.u17.TL_out==1)")
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.4415,69332,1,0,122806,539,4213,105807,316,1333,319840
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ParamProductionCell-PT-1-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((!(F(X(F("(((i9.u73.crane_lower==1)&&(i9.u81.CL_lower_rs==1))||((i1.i0.u10.press_upward==1)&&(i1.i0.u13.forge_rs==1)))")))))&&(!(X(F("((i9.u73.crane_lower==1)&&(i9.u81.CL_lower_rs==1))"))))))
Formula 8 simplified : !(!FXF"(((i9.u73.crane_lower==1)&&(i9.u81.CL_lower_rs==1))||((i1.i0.u10.press_upward==1)&&(i1.i0.u13.forge_rs==1)))" & !XF"((i9.u73.crane_lower==1)&&(i9.u81.CL_lower_rs==1))")
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.44404,69332,1,0,122812,539,4268,105837,317,1333,320053
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ParamProductionCell-PT-1-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(X(G(X("((i3.i1.u25.ch_A2D_free==1)&&(i0.i1.u36.arm2_storing==1))"))))))
Formula 9 simplified : XGX"((i3.i1.u25.ch_A2D_free==1)&&(i0.i1.u36.arm2_storing==1))"
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.44479,69332,1,0,122812,539,4295,105837,317,1333,320080
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-1-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(!(X(G(X(X((G("((i7.u43.arm2_stop==1)&&(i6.u39.A2L_rotated==1))"))U(X("((i7.u43.arm2_stop==1)&&(i6.u39.A2L_rotated==1))"))))))))))
Formula 10 simplified : !F!XGXX(G"((i7.u43.arm2_stop==1)&&(i6.u39.A2L_rotated==1))" U X"((i7.u43.arm2_stop==1)&&(i6.u39.A2L_rotated==1))")
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.44582,69332,1,0,122812,539,4322,105837,317,1333,320114
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-1-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(((G("((i3.i2.u27.ch_DC_free==1)&&(i3.i1.u24.deposit_belt_occupied==1))"))&&("(i6.u39.A2U_rotated==1)"))&&("(i7.u43.arm2_stop==1)"))))
Formula 11 simplified : !F("(i6.u39.A2U_rotated==1)" & "(i7.u43.arm2_stop==1)" & G"((i3.i2.u27.ch_DC_free==1)&&(i3.i1.u24.deposit_belt_occupied==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.49579,71180,1,0,126612,539,4378,109349,319,1333,333108
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ParamProductionCell-PT-1-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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-20 18:49:34] [INFO ] Built C files in 2520ms 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 1590000575037

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ParamProductionCell-PT-1"
export BK_EXAMINATION="LTLFireability"
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 ParamProductionCell-PT-1, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961257700474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-1.tgz
mv ParamProductionCell-PT-1 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;