fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r235-smll-162106564700277
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ShieldRVt-PT-020A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
679.176 48483.00 70728.00 598.00 FFFFFFTFFFFFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r235-smll-162106564700277.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-020A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564700277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 27 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 19:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 19:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 54K May 5 16:52 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 ShieldRVt-PT-020A-00
FORMULA_NAME ShieldRVt-PT-020A-01
FORMULA_NAME ShieldRVt-PT-020A-02
FORMULA_NAME ShieldRVt-PT-020A-03
FORMULA_NAME ShieldRVt-PT-020A-04
FORMULA_NAME ShieldRVt-PT-020A-05
FORMULA_NAME ShieldRVt-PT-020A-06
FORMULA_NAME ShieldRVt-PT-020A-07
FORMULA_NAME ShieldRVt-PT-020A-08
FORMULA_NAME ShieldRVt-PT-020A-09
FORMULA_NAME ShieldRVt-PT-020A-10
FORMULA_NAME ShieldRVt-PT-020A-11
FORMULA_NAME ShieldRVt-PT-020A-12
FORMULA_NAME ShieldRVt-PT-020A-13
FORMULA_NAME ShieldRVt-PT-020A-14
FORMULA_NAME ShieldRVt-PT-020A-15

=== Now, execution of the tool begins

BK_START 1621259732883

Running Version 0
[2021-05-17 13:55:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 13:55:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:55:35] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2021-05-17 13:55:35] [INFO ] Transformed 163 places.
[2021-05-17 13:55:35] [INFO ] Transformed 163 transitions.
[2021-05-17 13:55:35] [INFO ] Found NUPN structural information;
[2021-05-17 13:55:35] [INFO ] Parsed PT model containing 163 places and 163 transitions in 175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 13:55:35] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Support contains 57 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 24 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:55:36] [INFO ] Computed 81 place invariants in 20 ms
[2021-05-17 13:55:36] [INFO ] Implicit Places using invariants in 506 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:55:36] [INFO ] Computed 81 place invariants in 5 ms
[2021-05-17 13:55:36] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:55:36] [INFO ] Computed 81 place invariants in 4 ms
[2021-05-17 13:55:37] [INFO ] Dead Transitions using invariants and state equation in 303 ms returned []
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
[2021-05-17 13:55:37] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 13:55:37] [INFO ] Flatten gal took : 102 ms
FORMULA ShieldRVt-PT-020A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:55:37] [INFO ] Flatten gal took : 30 ms
[2021-05-17 13:55:37] [INFO ] Input system was already deterministic with 162 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 594 ms. (steps per millisecond=168 ) properties (out of 32) seen :23
Running SMT prover for 9 properties.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:55:38] [INFO ] Computed 81 place invariants in 4 ms
[2021-05-17 13:55:38] [INFO ] [Real]Absence check using 81 positive place invariants in 18 ms returned sat
[2021-05-17 13:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:38] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-17 13:55:38] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-17 13:55:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:55:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 30 ms returned sat
[2021-05-17 13:55:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:38] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-17 13:55:38] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 30 ms.
[2021-05-17 13:55:39] [INFO ] Added : 132 causal constraints over 27 iterations in 746 ms. Result :sat
[2021-05-17 13:55:39] [INFO ] [Real]Absence check using 81 positive place invariants in 27 ms returned sat
[2021-05-17 13:55:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:39] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-17 13:55:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:55:39] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2021-05-17 13:55:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:40] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-17 13:55:40] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-17 13:55:40] [INFO ] Added : 149 causal constraints over 30 iterations in 925 ms. Result :sat
[2021-05-17 13:55:41] [INFO ] [Real]Absence check using 81 positive place invariants in 31 ms returned sat
[2021-05-17 13:55:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:41] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2021-05-17 13:55:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:55:41] [INFO ] [Nat]Absence check using 81 positive place invariants in 18 ms returned sat
[2021-05-17 13:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:41] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-17 13:55:41] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-17 13:55:41] [INFO ] Added : 110 causal constraints over 23 iterations in 519 ms. Result :sat
[2021-05-17 13:55:41] [INFO ] [Real]Absence check using 81 positive place invariants in 33 ms returned sat
[2021-05-17 13:55:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:42] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-17 13:55:42] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-17 13:55:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:55:42] [INFO ] [Nat]Absence check using 81 positive place invariants in 27 ms returned sat
[2021-05-17 13:55:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:42] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-17 13:55:42] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 25 ms.
[2021-05-17 13:55:43] [INFO ] Added : 130 causal constraints over 28 iterations in 681 ms. Result :sat
[2021-05-17 13:55:43] [INFO ] [Real]Absence check using 81 positive place invariants in 30 ms returned sat
[2021-05-17 13:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:43] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2021-05-17 13:55:43] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 17 ms.
[2021-05-17 13:55:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:55:43] [INFO ] [Nat]Absence check using 81 positive place invariants in 18 ms returned sat
[2021-05-17 13:55:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:43] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-17 13:55:43] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-17 13:55:43] [INFO ] Added : 113 causal constraints over 24 iterations in 504 ms. Result :sat
[2021-05-17 13:55:43] [INFO ] [Real]Absence check using 81 positive place invariants in 24 ms returned sat
[2021-05-17 13:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:44] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2021-05-17 13:55:44] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 19 ms.
[2021-05-17 13:55:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:55:44] [INFO ] [Nat]Absence check using 81 positive place invariants in 26 ms returned sat
[2021-05-17 13:55:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:44] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-17 13:55:44] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-17 13:55:45] [INFO ] Added : 138 causal constraints over 28 iterations in 677 ms. Result :sat
[2021-05-17 13:55:45] [INFO ] [Real]Absence check using 81 positive place invariants in 25 ms returned sat
[2021-05-17 13:55:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:45] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-17 13:55:45] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-17 13:55:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:55:45] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2021-05-17 13:55:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:45] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-17 13:55:45] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 13:55:46] [INFO ] Added : 144 causal constraints over 31 iterations in 670 ms. Result :sat
[2021-05-17 13:55:46] [INFO ] [Real]Absence check using 81 positive place invariants in 17 ms returned sat
[2021-05-17 13:55:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:46] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-17 13:55:46] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 13:55:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:55:46] [INFO ] [Nat]Absence check using 81 positive place invariants in 33 ms returned sat
[2021-05-17 13:55:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:46] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-17 13:55:46] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-17 13:55:47] [INFO ] Added : 140 causal constraints over 32 iterations in 824 ms. Result :sat
[2021-05-17 13:55:47] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2021-05-17 13:55:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:47] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-17 13:55:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:55:47] [INFO ] [Nat]Absence check using 81 positive place invariants in 34 ms returned sat
[2021-05-17 13:55:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:55:47] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-17 13:55:47] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-17 13:55:48] [INFO ] Added : 150 causal constraints over 31 iterations in 960 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||G(p1)) U X((G(!p0)&&p2))))], workingDir=/home/mcc/execution]
Support contains 9 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 21 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:55:48] [INFO ] Computed 81 place invariants in 3 ms
[2021-05-17 13:55:48] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:55:48] [INFO ] Computed 81 place invariants in 3 ms
[2021-05-17 13:55:49] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:55:49] [INFO ] Computed 81 place invariants in 3 ms
[2021-05-17 13:55:49] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 553 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), true, p0, p0, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020A-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(OR p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR p0 (AND p1 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(OR (AND p0 p1) (AND p1 (NOT p2))), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s88 1) (EQ s90 1) (EQ s95 1)), p1:(OR (NEQ s52 1) (NEQ s53 1) (NEQ s56 1)), p2:(AND (EQ s136 1) (EQ s138 1) (EQ s143 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29820 steps with 0 reset in 297 ms.
FORMULA ShieldRVt-PT-020A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-00 finished in 1443 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 161
Applied a total of 2 rules in 69 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
// Phase 1: matrix 161 rows 162 cols
[2021-05-17 13:55:50] [INFO ] Computed 81 place invariants in 5 ms
[2021-05-17 13:55:50] [INFO ] Implicit Places using invariants in 207 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 213 ms to find 1 implicit places.
[2021-05-17 13:55:50] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 161 rows 161 cols
[2021-05-17 13:55:50] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 13:55:50] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Starting structural reductions, iteration 1 : 161/163 places, 161/162 transitions.
Applied a total of 0 rules in 12 ms. Remains 161 /161 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2021-05-17 13:55:50] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 161 rows 161 cols
[2021-05-17 13:55:50] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 13:55:50] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
Finished structural reductions, in 2 iterations. Remains : 161/163 places, 161/162 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020A-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s101 0), p0:(AND (EQ s126 1) (EQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9 reset in 416 ms.
Stack based approach found an accepted trace after 332 steps with 0 reset with depth 333 and stack size 242 in 2 ms.
FORMULA ShieldRVt-PT-020A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-01 finished in 1158 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X((p1||X((G(p2) U (G(p2)&&p3))))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 8 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:55:51] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:55:51] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:55:51] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:55:51] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:55:51] [INFO ] Computed 81 place invariants in 2 ms
[2021-05-17 13:55:51] [INFO ] Dead Transitions using invariants and state equation in 194 ms returned []
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-020A-02 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p3 p2), acceptance={0} source=5 dest: 0}, { cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p2:(OR (EQ s96 0) (EQ s98 0) (EQ s103 0)), p1:(AND (EQ s108 1) (EQ s109 1) (EQ s112 1)), p0:(EQ s27 1), p3:(AND (EQ s108 1) (EQ s109 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020A-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-02 finished in 903 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 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 162 transition count 161
Applied a total of 2 rules in 18 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
// Phase 1: matrix 161 rows 162 cols
[2021-05-17 13:55:52] [INFO ] Computed 81 place invariants in 2 ms
[2021-05-17 13:55:52] [INFO ] Implicit Places using invariants in 156 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 159 ms to find 1 implicit places.
[2021-05-17 13:55:52] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 161 rows 161 cols
[2021-05-17 13:55:52] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 13:55:52] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
Starting structural reductions, iteration 1 : 161/163 places, 161/162 transitions.
Applied a total of 0 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2021-05-17 13:55:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 161 rows 161 cols
[2021-05-17 13:55:52] [INFO ] Computed 80 place invariants in 7 ms
[2021-05-17 13:55:52] [INFO ] Dead Transitions using invariants and state equation in 159 ms returned []
Finished structural reductions, in 2 iterations. Remains : 161/163 places, 161/162 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020A-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s16 0) (EQ s18 0) (EQ s23 0)), p0:(OR (EQ s3 0) (EQ s12 0) (EQ s18 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 341 ms.
Product exploration explored 100000 steps with 1 reset in 462 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 361 ms.
Product exploration explored 100000 steps with 0 reset in 444 ms.
[2021-05-17 13:55:54] [INFO ] Flatten gal took : 32 ms
[2021-05-17 13:55:54] [INFO ] Flatten gal took : 28 ms
[2021-05-17 13:55:54] [INFO ] Time to serialize gal into /tmp/LTL10252047095396597769.gal : 13 ms
[2021-05-17 13:55:54] [INFO ] Time to serialize properties into /tmp/LTL18171661852493829963.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10252047095396597769.gal, -t, CGAL, -LTL, /tmp/LTL18171661852493829963.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10252047095396597769.gal -t CGAL -LTL /tmp/LTL18171661852493829963.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((p3==0)||(p12==0))||(p18==0))")U("(((p16==0)||(p18==0))||(p23==0))")))))
Formula 0 simplified : !FG("(((p3==0)||(p12==0))||(p18==0))" U "(((p16==0)||(p18==0))||(p23==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 13:56:09] [INFO ] Flatten gal took : 26 ms
[2021-05-17 13:56:09] [INFO ] Applying decomposition
[2021-05-17 13:56:09] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15861799922315165025.txt, -o, /tmp/graph15861799922315165025.bin, -w, /tmp/graph15861799922315165025.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15861799922315165025.bin, -l, -1, -v, -w, /tmp/graph15861799922315165025.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 13:56:10] [INFO ] Decomposing Gal with order
[2021-05-17 13:56:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 13:56:10] [INFO ] Removed a total of 59 redundant transitions.
[2021-05-17 13:56:10] [INFO ] Flatten gal took : 98 ms
[2021-05-17 13:56:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2021-05-17 13:56:10] [INFO ] Time to serialize gal into /tmp/LTL4176505270006483538.gal : 19 ms
[2021-05-17 13:56:10] [INFO ] Time to serialize properties into /tmp/LTL16536761231061358283.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4176505270006483538.gal, -t, CGAL, -LTL, /tmp/LTL16536761231061358283.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4176505270006483538.gal -t CGAL -LTL /tmp/LTL16536761231061358283.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((i0.u1.p3==0)||(i1.i0.u5.p12==0))||(i1.i0.u8.p18==0))")U("(((i1.i0.u7.p16==0)||(i1.i0.u8.p18==0))||(i1.i1.u11.p23==0))")))))
Formula 0 simplified : !FG("(((i0.u1.p3==0)||(i1.i0.u5.p12==0))||(i1.i0.u8.p18==0))" U "(((i1.i0.u7.p16==0)||(i1.i0.u8.p18==0))||(i1.i1.u11.p23==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
80 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.85341,36772,1,0,30925,67,887,142672,64,109,21668
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-020A-03 finished in 19079 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(p1)||X((p2 U p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:11] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:11] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:11] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:11] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:11] [INFO ] Computed 81 place invariants in 14 ms
[2021-05-17 13:56:11] [INFO ] Dead Transitions using invariants and state equation in 206 ms returned []
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020A-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(AND (EQ s27 1) (EQ s14 1) (EQ s17 1)), p2:(AND (EQ s14 1) (EQ s17 1)), p0:(EQ s27 1), p1:(OR (NEQ s134 1) (NEQ s137 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020A-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-04 finished in 945 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:12] [INFO ] Computed 81 place invariants in 5 ms
[2021-05-17 13:56:12] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:12] [INFO ] Computed 81 place invariants in 2 ms
[2021-05-17 13:56:12] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:12] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:12] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020A-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s40 1) (NEQ s42 1) (NEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18824 steps with 0 reset in 99 ms.
FORMULA ShieldRVt-PT-020A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-05 finished in 832 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||(F(p0)&&X(G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:13] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:13] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:13] [INFO ] Computed 81 place invariants in 2 ms
[2021-05-17 13:56:13] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:13] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:13] [INFO ] Dead Transitions using invariants and state equation in 255 ms returned []
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020A-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s149 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null][false]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-020A-06 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property ShieldRVt-PT-020A-06 finished in 767 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:13] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:13] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:13] [INFO ] Computed 81 place invariants in 2 ms
[2021-05-17 13:56:14] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:14] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:14] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020A-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s88 1) (EQ s90 1) (EQ s95 1) (EQ s141 1)), p1:(OR (EQ s75 0) (EQ s84 0) (EQ s90 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-07 finished in 655 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 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 162 transition count 161
Applied a total of 2 rules in 13 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
// Phase 1: matrix 161 rows 162 cols
[2021-05-17 13:56:14] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:14] [INFO ] Implicit Places using invariants in 171 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
[2021-05-17 13:56:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 161 rows 161 cols
[2021-05-17 13:56:14] [INFO ] Computed 80 place invariants in 2 ms
[2021-05-17 13:56:14] [INFO ] Dead Transitions using invariants and state equation in 163 ms returned []
Starting structural reductions, iteration 1 : 161/163 places, 161/162 transitions.
Applied a total of 0 rules in 16 ms. Remains 161 /161 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2021-05-17 13:56:14] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 161 rows 161 cols
[2021-05-17 13:56:14] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 13:56:15] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
Finished structural reductions, in 2 iterations. Remains : 161/163 places, 161/162 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020A-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s4 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 475 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 1 ms.
FORMULA ShieldRVt-PT-020A-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-09 finished in 1116 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||X((p1 U p2))) U X(G(p3))))], workingDir=/home/mcc/execution]
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:15] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:15] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:15] [INFO ] Computed 81 place invariants in 0 ms
[2021-05-17 13:56:16] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:16] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:16] [INFO ] Dead Transitions using invariants and state equation in 252 ms returned []
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : ShieldRVt-PT-020A-10 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p3 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s75 1) (EQ s84 1) (EQ s90 1)), p0:(EQ s101 1), p2:(AND (EQ s116 1) (EQ s117 1) (EQ s120 1) (EQ s101 1)), p1:(AND (EQ s116 1) (EQ s117 1) (EQ s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-10 finished in 1007 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(p1)&&(p2||X(F(!p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:16] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:16] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:16] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:16] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:16] [INFO ] Computed 81 place invariants in 2 ms
[2021-05-17 13:56:17] [INFO ] Dead Transitions using invariants and state equation in 193 ms returned []
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true]
Running random walk in product with property : ShieldRVt-PT-020A-11 automaton TGBA [mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s158 0) (EQ s161 0)), p2:(EQ s35 1), p1:(AND (EQ s54 1) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-11 finished in 721 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X((p0 U (p1||G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:17] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:17] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:17] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:17] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2021-05-17 13:56:17] [INFO ] Computed 81 place invariants in 1 ms
[2021-05-17 13:56:17] [INFO ] Dead Transitions using invariants and state equation in 224 ms returned []
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020A-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 795 steps with 0 reset in 6 ms.
FORMULA ShieldRVt-PT-020A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-13 finished in 749 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((((p0 U (p1||G(p0))) U (((p0 U (p1||G(p0)))&&(p2||G(p0)))||G(p3))) U p4)))], workingDir=/home/mcc/execution]
Support contains 11 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 162/162 transitions.
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 2 place count 162 transition count 161
Applied a total of 2 rules in 11 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
// Phase 1: matrix 161 rows 162 cols
[2021-05-17 13:56:18] [INFO ] Computed 81 place invariants in 10 ms
[2021-05-17 13:56:18] [INFO ] Implicit Places using invariants in 136 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
[2021-05-17 13:56:18] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 161 rows 161 cols
[2021-05-17 13:56:18] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 13:56:18] [INFO ] Dead Transitions using invariants and state equation in 210 ms returned []
Starting structural reductions, iteration 1 : 161/163 places, 161/162 transitions.
Applied a total of 0 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2021-05-17 13:56:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 161 rows 161 cols
[2021-05-17 13:56:18] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-17 13:56:18] [INFO ] Dead Transitions using invariants and state equation in 244 ms returned []
Finished structural reductions, in 2 iterations. Remains : 161/163 places, 161/162 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p4), true, (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p4), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020A-15 automaton TGBA [mat=[[{ cond=(OR p4 p3 p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p4) p3 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) (NOT p3) p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p4) p3) (AND (NOT p4) p0) (AND (NOT p4) p1)), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p4) (NOT p2) p0) (AND (NOT p4) (NOT p2) p1)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p4) p3 p2 p0 (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p4) p3 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p4) (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p4) p3) (AND (NOT p4) p0) (AND (NOT p4) p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND (NOT p4) (NOT p2) p0) (AND (NOT p4) (NOT p2) p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p4) p3 p2 p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={1} source=5 dest: 5}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=5 dest: 5}, { cond=(AND p3 p2 p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p4:(AND (EQ s100 1) (EQ s101 1) (EQ s104 1)), p3:(OR (NEQ s16 1) (NEQ s18 1) (NEQ s23 1) (AND (OR (NEQ s16 1) (NEQ s18 1) (NEQ s23 1)) (OR (NEQ s6 1) (NEQ s9 1)))), p0:(OR (NEQ s16 1) (NEQ s18 1) (NEQ s23 1)), p1:(AND (OR (NEQ s16 1) (NEQ s18 1) (NEQ s23 1)) (OR (NEQ s6 1) (NEQ s9 1))), p2:(AND (NEQ s72 0) (NEQ s74 0) (NEQ s79 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 42 reset in 920 ms.
Stack based approach found an accepted trace after 12363 steps with 5 reset with depth 8 and stack size 8 in 86 ms.
FORMULA ShieldRVt-PT-020A-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-15 finished in 2020 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621259781366

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-020A, 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 r235-smll-162106564700277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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