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.r216-tall-162098205600805.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205600805
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 9.9K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K 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.3K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 18:35 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 201K 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 ShieldPPPt-PT-030A-00
FORMULA_NAME ShieldPPPt-PT-030A-01
FORMULA_NAME ShieldPPPt-PT-030A-02
FORMULA_NAME ShieldPPPt-PT-030A-03
FORMULA_NAME ShieldPPPt-PT-030A-04
FORMULA_NAME ShieldPPPt-PT-030A-05
FORMULA_NAME ShieldPPPt-PT-030A-06
FORMULA_NAME ShieldPPPt-PT-030A-07
FORMULA_NAME ShieldPPPt-PT-030A-08
FORMULA_NAME ShieldPPPt-PT-030A-09
FORMULA_NAME ShieldPPPt-PT-030A-10
FORMULA_NAME ShieldPPPt-PT-030A-11
FORMULA_NAME ShieldPPPt-PT-030A-12
FORMULA_NAME ShieldPPPt-PT-030A-13
FORMULA_NAME ShieldPPPt-PT-030A-14
FORMULA_NAME ShieldPPPt-PT-030A-15

=== Now, execution of the tool begins

BK_START 1621179588086

Running Version 0
[2021-05-16 15:39:49] [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-16 15:39:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:39:49] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2021-05-16 15:39:49] [INFO ] Transformed 753 places.
[2021-05-16 15:39:49] [INFO ] Transformed 543 transitions.
[2021-05-16 15:39:49] [INFO ] Found NUPN structural information;
[2021-05-16 15:39:49] [INFO ] Parsed PT model containing 753 places and 543 transitions in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 15:39:49] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-030A-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 74 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:39:49] [INFO ] Computed 331 place invariants in 22 ms
[2021-05-16 15:39:50] [INFO ] Implicit Places using invariants in 563 ms returned []
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:39:50] [INFO ] Computed 331 place invariants in 9 ms
[2021-05-16 15:39:51] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:39:51] [INFO ] Computed 331 place invariants in 3 ms
[2021-05-16 15:39:51] [INFO ] Dead Transitions using invariants and state equation in 347 ms returned []
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 542/542 transitions.
[2021-05-16 15:39:51] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-16 15:39:51] [INFO ] Flatten gal took : 109 ms
FORMULA ShieldPPPt-PT-030A-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 15:39:51] [INFO ] Flatten gal took : 61 ms
[2021-05-16 15:39:51] [INFO ] Input system was already deterministic with 542 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 797 ms. (steps per millisecond=125 ) properties (out of 24) seen :12
Running SMT prover for 12 properties.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:39:52] [INFO ] Computed 331 place invariants in 3 ms
[2021-05-16 15:39:52] [INFO ] [Real]Absence check using 331 positive place invariants in 49 ms returned sat
[2021-05-16 15:39:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:39:52] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-16 15:39:53] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 30 ms.
[2021-05-16 15:39:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:39:53] [INFO ] [Nat]Absence check using 331 positive place invariants in 52 ms returned sat
[2021-05-16 15:39:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:39:53] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2021-05-16 15:39:53] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-16 15:40:00] [INFO ] Added : 502 causal constraints over 107 iterations in 6532 ms. Result :sat
[2021-05-16 15:40:00] [INFO ] [Real]Absence check using 331 positive place invariants in 51 ms returned sat
[2021-05-16 15:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:00] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-16 15:40:00] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 32 ms.
[2021-05-16 15:40:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:40:00] [INFO ] [Nat]Absence check using 331 positive place invariants in 51 ms returned sat
[2021-05-16 15:40:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:01] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2021-05-16 15:40:01] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 30 ms.
[2021-05-16 15:40:06] [INFO ] Added : 453 causal constraints over 92 iterations in 5385 ms. Result :sat
[2021-05-16 15:40:06] [INFO ] [Real]Absence check using 331 positive place invariants in 48 ms returned sat
[2021-05-16 15:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:06] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-16 15:40:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:40:06] [INFO ] [Nat]Absence check using 331 positive place invariants in 52 ms returned sat
[2021-05-16 15:40:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:07] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2021-05-16 15:40:07] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 24 ms.
[2021-05-16 15:40:14] [INFO ] Added : 527 causal constraints over 108 iterations in 7296 ms. Result :sat
[2021-05-16 15:40:14] [INFO ] [Real]Absence check using 331 positive place invariants in 49 ms returned sat
[2021-05-16 15:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:14] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-16 15:40:14] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-16 15:40:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:40:15] [INFO ] [Nat]Absence check using 331 positive place invariants in 56 ms returned sat
[2021-05-16 15:40:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:15] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-16 15:40:15] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-16 15:40:20] [INFO ] Added : 468 causal constraints over 95 iterations in 5477 ms. Result :sat
[2021-05-16 15:40:20] [INFO ] [Real]Absence check using 331 positive place invariants in 52 ms returned sat
[2021-05-16 15:40:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:21] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-16 15:40:21] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-16 15:40:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:40:21] [INFO ] [Nat]Absence check using 331 positive place invariants in 50 ms returned sat
[2021-05-16 15:40:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:21] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2021-05-16 15:40:21] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-16 15:40:26] [INFO ] Added : 427 causal constraints over 86 iterations in 4509 ms. Result :sat
[2021-05-16 15:40:26] [INFO ] [Real]Absence check using 331 positive place invariants in 46 ms returned sat
[2021-05-16 15:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:26] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2021-05-16 15:40:26] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-16 15:40:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:40:26] [INFO ] [Nat]Absence check using 331 positive place invariants in 50 ms returned sat
[2021-05-16 15:40:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:27] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2021-05-16 15:40:27] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-16 15:40:32] [INFO ] Added : 494 causal constraints over 104 iterations in 5870 ms. Result :sat
[2021-05-16 15:40:33] [INFO ] [Real]Absence check using 331 positive place invariants in 49 ms returned sat
[2021-05-16 15:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:33] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-16 15:40:33] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-16 15:40:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:40:33] [INFO ] [Nat]Absence check using 331 positive place invariants in 50 ms returned sat
[2021-05-16 15:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:33] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2021-05-16 15:40:33] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-16 15:40:39] [INFO ] Added : 494 causal constraints over 104 iterations in 5868 ms. Result :sat
[2021-05-16 15:40:39] [INFO ] [Real]Absence check using 331 positive place invariants in 48 ms returned sat
[2021-05-16 15:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:39] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2021-05-16 15:40:39] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-16 15:40:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:40:40] [INFO ] [Nat]Absence check using 331 positive place invariants in 50 ms returned sat
[2021-05-16 15:40:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:40] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2021-05-16 15:40:40] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-16 15:40:45] [INFO ] Added : 461 causal constraints over 93 iterations in 4605 ms. Result :sat
[2021-05-16 15:40:45] [INFO ] [Real]Absence check using 331 positive place invariants in 49 ms returned sat
[2021-05-16 15:40:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:45] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2021-05-16 15:40:45] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-16 15:40:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:40:45] [INFO ] [Nat]Absence check using 331 positive place invariants in 50 ms returned sat
[2021-05-16 15:40:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:45] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2021-05-16 15:40:46] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-16 15:40:50] [INFO ] Added : 393 causal constraints over 79 iterations in 4032 ms. Result :sat
[2021-05-16 15:40:50] [INFO ] [Real]Absence check using 331 positive place invariants in 50 ms returned sat
[2021-05-16 15:40:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:50] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-16 15:40:50] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-16 15:40:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:40:50] [INFO ] [Nat]Absence check using 331 positive place invariants in 50 ms returned sat
[2021-05-16 15:40:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:50] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2021-05-16 15:40:50] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-16 15:40:56] [INFO ] Added : 478 causal constraints over 101 iterations in 5617 ms. Result :sat
[2021-05-16 15:40:56] [INFO ] [Real]Absence check using 331 positive place invariants in 49 ms returned sat
[2021-05-16 15:40:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:56] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2021-05-16 15:40:56] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-16 15:40:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:40:57] [INFO ] [Nat]Absence check using 331 positive place invariants in 50 ms returned sat
[2021-05-16 15:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:57] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-16 15:40:57] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 21 ms.
[2021-05-16 15:41:02] [INFO ] Added : 462 causal constraints over 94 iterations in 4698 ms. Result :sat
[2021-05-16 15:41:02] [INFO ] [Real]Absence check using 331 positive place invariants in 49 ms returned sat
[2021-05-16 15:41:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:41:02] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-16 15:41:02] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-16 15:41:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:41:02] [INFO ] [Nat]Absence check using 331 positive place invariants in 50 ms returned sat
[2021-05-16 15:41:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:41:02] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2021-05-16 15:41:02] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-16 15:41:07] [INFO ] Added : 477 causal constraints over 97 iterations in 4628 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))||(F(p1)&&X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 17 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:07] [INFO ] Computed 331 place invariants in 3 ms
[2021-05-16 15:41:07] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:08] [INFO ] Computed 331 place invariants in 2 ms
[2021-05-16 15:41:08] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:08] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 15:41:08] [INFO ] Dead Transitions using invariants and state equation in 343 ms returned []
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0) p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (NEQ s38 1) (NEQ s52 1)), p2:(NEQ s547 1), p1:(AND (EQ s113 1) (EQ s127 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1742 ms.
Product exploration explored 100000 steps with 50000 reset in 1643 ms.
Knowledge obtained : [p0, p2, (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 1484 ms.
Product exploration explored 100000 steps with 50000 reset in 1546 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Support contains 5 out of 753 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 753 transition count 542
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 96 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2021-05-16 15:41:17] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:17] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:41:17] [INFO ] Dead Transitions using invariants and state equation in 350 ms returned []
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 542/542 transitions.
Product exploration explored 100000 steps with 50000 reset in 5646 ms.
Product exploration explored 100000 steps with 50000 reset in 5663 ms.
[2021-05-16 15:41:28] [INFO ] Flatten gal took : 43 ms
[2021-05-16 15:41:28] [INFO ] Flatten gal took : 40 ms
[2021-05-16 15:41:29] [INFO ] Time to serialize gal into /tmp/LTL7833437207618428829.gal : 16 ms
[2021-05-16 15:41:29] [INFO ] Time to serialize properties into /tmp/LTL2766812512182871293.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/LTL7833437207618428829.gal, -t, CGAL, -LTL, /tmp/LTL2766812512182871293.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/LTL7833437207618428829.gal -t CGAL -LTL /tmp/LTL2766812512182871293.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F("((p38==0)||(p52==0))")))||((F("((p113==1)&&(p127==1))"))&&(X(G("(p547==0)"))))))
Formula 0 simplified : !(XF"((p38==0)||(p52==0))" | (F"((p113==1)&&(p127==1))" & XG"(p547==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
494 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,5.00377,103616,1,0,6,523492,32,0,17633,397226,15
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-030A-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldPPPt-PT-030A-00 finished in 32875 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p1 U p2)||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 45 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2021-05-16 15:41:40] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:41:40] [INFO ] Implicit Places using invariants in 399 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 401 ms to find 1 implicit places.
[2021-05-16 15:41:40] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 540 rows 750 cols
[2021-05-16 15:41:40] [INFO ] Computed 330 place invariants in 2 ms
[2021-05-16 15:41:41] [INFO ] Dead Transitions using invariants and state equation in 340 ms returned []
Starting structural reductions, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 31 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2021-05-16 15:41:41] [INFO ] Computed 330 place invariants in 2 ms
[2021-05-16 15:41:41] [INFO ] Implicit Places using invariants in 379 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 380 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 34 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2021-05-16 15:41:41] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 15:41:42] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 536 rows 744 cols
[2021-05-16 15:41:42] [INFO ] Computed 328 place invariants in 9 ms
[2021-05-16 15:41:42] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-030A-01 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s465 1) (NEQ s499 1)), p2:(EQ s376 1), p1:(AND (EQ s592 1) (EQ s594 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 0 reset in 523 ms.
Stack based approach found an accepted trace after 388 steps with 0 reset with depth 389 and stack size 375 in 4 ms.
FORMULA ShieldPPPt-PT-030A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-01 finished in 2847 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(G(p0))||F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 9 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:43] [INFO ] Computed 331 place invariants in 2 ms
[2021-05-16 15:41:43] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:43] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:41:44] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:44] [INFO ] Computed 331 place invariants in 2 ms
[2021-05-16 15:41:44] [INFO ] Dead Transitions using invariants and state equation in 337 ms returned []
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s747 0), p0:(AND (EQ s429 1) (EQ s448 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2634 reset in 568 ms.
Product exploration explored 100000 steps with 2615 reset in 746 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 2635 reset in 568 ms.
Stack based approach found an accepted trace after 13321 steps with 352 reset with depth 35 and stack size 35 in 94 ms.
FORMULA ShieldPPPt-PT-030A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-03 finished in 3550 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&((X(p1)||G(p2)) U p3)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:46] [INFO ] Computed 331 place invariants in 2 ms
[2021-05-16 15:41:47] [INFO ] Implicit Places using invariants in 375 ms returned []
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:47] [INFO ] Computed 331 place invariants in 2 ms
[2021-05-16 15:41:47] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:47] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 15:41:48] [INFO ] Dead Transitions using invariants and state equation in 347 ms returned []
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldPPPt-PT-030A-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0 p2), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p0 p2 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=1 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p0 p2 (NOT p1)), acceptance={1} source=1 dest: 5}], [{ cond=(AND (NOT p3) p2), acceptance={1} source=2 dest: 1}, { cond=(NOT p3), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) p0 p2), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={1} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p0 p2), acceptance={1} source=4 dest: 5}], [{ cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) p2 p1)), acceptance={1} source=5 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2) p1)), acceptance={0, 1} source=5 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2) p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) p2 p1)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s445 1), p3:(OR (EQ s730 0) (EQ s747 0)), p2:(AND (EQ s593 1) (EQ s600 1)), p1:(AND (EQ s15 1) (EQ s49 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 527 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-030A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-05 finished in 2121 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:48] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:41:49] [INFO ] Implicit Places using invariants in 378 ms returned []
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:49] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:41:49] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:50] [INFO ] Computed 331 place invariants in 9 ms
[2021-05-16 15:41:50] [INFO ] Dead Transitions using invariants and state equation in 337 ms returned []
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-06 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:(OR (NEQ s117 1) (NEQ s119 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]]
Product exploration explored 100000 steps with 0 reset in 496 ms.
Product exploration explored 100000 steps with 0 reset in 651 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 53278 steps with 0 reset in 264 ms.
FORMULA ShieldPPPt-PT-030A-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-06 finished in 6425 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(G(p1)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:55] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 15:41:55] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:55] [INFO ] Computed 331 place invariants in 2 ms
[2021-05-16 15:41:56] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:56] [INFO ] Computed 331 place invariants in 3 ms
[2021-05-16 15:41:56] [INFO ] Dead Transitions using invariants and state equation in 339 ms returned []
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030A-08 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: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (EQ s107 1) (EQ s109 1)), p1:(OR (NEQ s466 1) (NEQ s477 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-030A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-08 finished in 1541 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(X(F(p0)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:56] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:41:57] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:57] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:41:57] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:41:57] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:41:58] [INFO ] Dead Transitions using invariants and state equation in 343 ms returned []
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(OR (NEQ s107 1) (NEQ s109 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]]
Product exploration explored 100000 steps with 16666 reset in 903 ms.
Product exploration explored 100000 steps with 16666 reset in 963 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 905 ms.
Product exploration explored 100000 steps with 16666 reset in 1006 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 753 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 753 transition count 542
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 57 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2021-05-16 15:42:11] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:42:11] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:42:11] [INFO ] Dead Transitions using invariants and state equation in 330 ms returned []
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 542/542 transitions.
Product exploration explored 100000 steps with 16666 reset in 2812 ms.
Product exploration explored 100000 steps with 16666 reset in 2905 ms.
[2021-05-16 15:42:17] [INFO ] Flatten gal took : 39 ms
[2021-05-16 15:42:17] [INFO ] Flatten gal took : 34 ms
[2021-05-16 15:42:23] [INFO ] Time to serialize gal into /tmp/LTL834948374516570399.gal : 5960 ms
[2021-05-16 15:42:23] [INFO ] Time to serialize properties into /tmp/LTL18386172280020901597.ltl : 67 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/LTL834948374516570399.gal, -t, CGAL, -LTL, /tmp/LTL18386172280020901597.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/LTL834948374516570399.gal -t CGAL -LTL /tmp/LTL18386172280020901597.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(F("((p107==0)||(p109==0))"))))))))
Formula 0 simplified : !XXXXXF"((p107==0)||(p109==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
0 strongly connected components in search stack
5 transitions explored
6 items max in DFS search stack
497 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,5.0217,103592,1,0,10,523797,20,0,17823,397226,21
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-030A-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldPPPt-PT-030A-09 finished in 32023 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(G(p2)||X(G(p3))||p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 12 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:42:29] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:42:29] [INFO ] Implicit Places using invariants in 379 ms returned []
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:42:29] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:42:30] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:42:30] [INFO ] Computed 331 place invariants in 2 ms
[2021-05-16 15:42:30] [INFO ] Dead Transitions using invariants and state equation in 335 ms returned []
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 8567 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldPPPt-PT-030A-10 automaton TGBA [mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1 (NOT p3)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p3), acceptance={} source=1 dest: 2}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p1 (NOT p3)) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p3), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (NEQ s738 1) (NEQ s752 1)), p0:(OR (NEQ s738 1) (NEQ s752 1)), p2:(EQ s370 1), p3:(AND (EQ s554 1) (EQ s573 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 531 ms.
Stack based approach found an accepted trace after 147 steps with 0 reset with depth 148 and stack size 121 in 1 ms.
FORMULA ShieldPPPt-PT-030A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-10 finished in 10546 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 38 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2021-05-16 15:42:39] [INFO ] Computed 331 place invariants in 2 ms
[2021-05-16 15:42:39] [INFO ] Implicit Places using invariants in 373 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 374 ms to find 1 implicit places.
[2021-05-16 15:42:39] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 540 rows 750 cols
[2021-05-16 15:42:39] [INFO ] Computed 330 place invariants in 2 ms
[2021-05-16 15:42:40] [INFO ] Dead Transitions using invariants and state equation in 336 ms returned []
Starting structural reductions, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 28 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2021-05-16 15:42:40] [INFO ] Computed 330 place invariants in 2 ms
[2021-05-16 15:42:40] [INFO ] Implicit Places using invariants in 373 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 375 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 31 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2021-05-16 15:42:40] [INFO ] Computed 328 place invariants in 2 ms
[2021-05-16 15:42:41] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 536 rows 744 cols
[2021-05-16 15:42:41] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 15:42:41] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s278 1) (EQ s301 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 1 reset in 492 ms.
Stack based approach found an accepted trace after 102 steps with 0 reset with depth 103 and stack size 103 in 0 ms.
FORMULA ShieldPPPt-PT-030A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-11 finished in 2727 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:42:42] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:42:42] [INFO ] Implicit Places using invariants in 377 ms returned []
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:42:42] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:42:43] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:42:43] [INFO ] Computed 331 place invariants in 2 ms
[2021-05-16 15:42:43] [INFO ] Dead Transitions using invariants and state equation in 337 ms returned []
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030A-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s392 1) (EQ s394 1) (EQ s26 1)), p0:(AND (EQ s392 1) (EQ s394 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-030A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-13 finished in 1457 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 25 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2021-05-16 15:42:43] [INFO ] Computed 331 place invariants in 1 ms
[2021-05-16 15:42:44] [INFO ] Implicit Places using invariants in 383 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 384 ms to find 1 implicit places.
[2021-05-16 15:42:44] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 540 rows 750 cols
[2021-05-16 15:42:44] [INFO ] Computed 330 place invariants in 1 ms
[2021-05-16 15:42:44] [INFO ] Dead Transitions using invariants and state equation in 342 ms returned []
Starting structural reductions, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 21 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2021-05-16 15:42:44] [INFO ] Computed 330 place invariants in 1 ms
[2021-05-16 15:42:44] [INFO ] Implicit Places using invariants in 371 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 373 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 24 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2021-05-16 15:42:44] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 15:42:45] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 536 rows 744 cols
[2021-05-16 15:42:45] [INFO ] Computed 328 place invariants in 2 ms
[2021-05-16 15:42:45] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 8161 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-14 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s9 1)), p0:(OR (NEQ s31 1) (NEQ s46 1) (NEQ s349 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 0 reset in 510 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 0 ms.
FORMULA ShieldPPPt-PT-030A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-14 finished in 10868 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621179775508

--------------------
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="ShieldPPPt-PT-030A"
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 ShieldPPPt-PT-030A, 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 r216-tall-162098205600805"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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