Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025600675.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 ShieldPPPt-PT-050A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600675
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.6K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 13:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 337K May 10 09:34 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-050A-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653031996404

Running Version 202205111006
[2022-05-20 07:33:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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]
[2022-05-20 07:33:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:33:17] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2022-05-20 07:33:17] [INFO ] Transformed 1253 places.
[2022-05-20 07:33:17] [INFO ] Transformed 903 transitions.
[2022-05-20 07:33:17] [INFO ] Found NUPN structural information;
[2022-05-20 07:33:17] [INFO ] Parsed PT model containing 1253 places and 903 transitions in 291 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 133 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:33:18] [INFO ] Computed 551 place invariants in 29 ms
[2022-05-20 07:33:19] [INFO ] Implicit Places using invariants in 918 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:33:19] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 07:33:20] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 2399 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:33:20] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 07:33:21] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Support contains 38 out of 1253 places after structural reductions.
[2022-05-20 07:33:21] [INFO ] Flatten gal took : 182 ms
[2022-05-20 07:33:21] [INFO ] Flatten gal took : 86 ms
[2022-05-20 07:33:21] [INFO ] Input system was already deterministic with 902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 23) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:33:23] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:33:23] [INFO ] [Real]Absence check using 551 positive place invariants in 88 ms returned sat
[2022-05-20 07:33:24] [INFO ] After 1572ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2022-05-20 07:33:25] [INFO ] [Nat]Absence check using 551 positive place invariants in 95 ms returned sat
[2022-05-20 07:33:26] [INFO ] After 1360ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2022-05-20 07:33:27] [INFO ] After 2264ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 776 ms.
[2022-05-20 07:33:28] [INFO ] After 3668ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 1010 ms.
Support contains 13 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Partial Free-agglomeration rule applied 190 times.
Drop transitions removed 190 transitions
Iterating global reduction 0 with 190 rules applied. Total rules applied 194 place count 1251 transition count 900
Applied a total of 194 rules in 285 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1253 places, 900/902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 900 rows 1251 cols
[2022-05-20 07:33:30] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 07:33:31] [INFO ] [Real]Absence check using 551 positive place invariants in 93 ms returned sat
[2022-05-20 07:33:32] [INFO ] After 1339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 07:33:32] [INFO ] [Nat]Absence check using 551 positive place invariants in 85 ms returned sat
[2022-05-20 07:33:33] [INFO ] After 1071ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 07:33:33] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-20 07:33:34] [INFO ] After 786ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 07:33:34] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2022-05-20 07:33:34] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2022-05-20 07:33:35] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2022-05-20 07:33:35] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-05-20 07:33:35] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2022-05-20 07:33:35] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2022-05-20 07:33:35] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 5 ms to minimize.
[2022-05-20 07:33:35] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2022-05-20 07:33:35] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2022-05-20 07:33:35] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2022-05-20 07:33:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1287 ms
[2022-05-20 07:33:36] [INFO ] After 2711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 671 ms.
[2022-05-20 07:33:37] [INFO ] After 4950ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 569 ms.
Support contains 11 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 900/900 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1251 transition count 900
Applied a total of 2 rules in 146 ms. Remains 1251 /1251 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 900/900 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 89827 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89827 steps, saw 86688 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 900 rows 1251 cols
[2022-05-20 07:33:41] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:33:41] [INFO ] [Real]Absence check using 551 positive place invariants in 91 ms returned sat
[2022-05-20 07:33:42] [INFO ] After 1301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 07:33:43] [INFO ] [Nat]Absence check using 551 positive place invariants in 87 ms returned sat
[2022-05-20 07:33:44] [INFO ] After 1043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 07:33:44] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-20 07:33:45] [INFO ] After 709ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 07:33:45] [INFO ] After 1539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 646 ms.
[2022-05-20 07:33:46] [INFO ] After 3785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 589 ms.
Support contains 11 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 900/900 transitions.
Applied a total of 0 rules in 40 ms. Remains 1251 /1251 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 900/900 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 900/900 transitions.
Applied a total of 0 rules in 36 ms. Remains 1251 /1251 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2022-05-20 07:33:47] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 07:33:48] [INFO ] Implicit Places using invariants in 726 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 729 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1250/1251 places, 900/900 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 1250 transition count 898
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 1248 transition count 898
Applied a total of 4 rules in 63 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2022-05-20 07:33:48] [INFO ] Computed 550 place invariants in 5 ms
[2022-05-20 07:33:48] [INFO ] Implicit Places using invariants in 748 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 749 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1246/1251 places, 898/900 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1244 transition count 896
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 130 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:33:48] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:33:49] [INFO ] Implicit Places using invariants in 655 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:33:49] [INFO ] Computed 548 place invariants in 6 ms
[2022-05-20 07:33:50] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-20 07:33:51] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 2756 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 1244/1251 places, 896/900 transitions.
Finished structural reductions, in 3 iterations. Remains : 1244/1251 places, 896/900 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 89555 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89555 steps, saw 86419 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:33:55] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:33:55] [INFO ] [Real]Absence check using 548 positive place invariants in 84 ms returned sat
[2022-05-20 07:33:56] [INFO ] After 1220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 07:33:57] [INFO ] [Nat]Absence check using 548 positive place invariants in 82 ms returned sat
[2022-05-20 07:33:58] [INFO ] After 1230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 07:33:58] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-20 07:33:58] [INFO ] After 510ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 07:33:59] [INFO ] After 1099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 682 ms.
[2022-05-20 07:34:00] [INFO ] After 3444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 1548 steps, including 2 resets, run visited all 6 properties in 32 ms. (steps per millisecond=48 )
Parikh walk visited 6 properties in 32 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(((G(p1)||p0)&&p1))||X(X(p2))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 33 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:00] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 07:34:01] [INFO ] Implicit Places using invariants in 726 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:01] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:34:02] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:02] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 07:34:03] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 576 ms :[(NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 4}]], initial=3, aps=[p2:(OR (EQ s225 0) (EQ s272 1)), p1:(OR (EQ s119 0) (EQ s1172 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 779 ms.
Product exploration explored 100000 steps with 0 reset in 940 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 128 ms :[true, false, false, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:05] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:34:06] [INFO ] [Real]Absence check using 551 positive place invariants in 86 ms returned sat
[2022-05-20 07:34:06] [INFO ] After 414ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 07:34:06] [INFO ] After 499ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:06] [INFO ] After 802ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:07] [INFO ] [Nat]Absence check using 551 positive place invariants in 90 ms returned sat
[2022-05-20 07:34:07] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:07] [INFO ] After 492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-20 07:34:07] [INFO ] After 847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Partial Free-agglomeration rule applied 197 times.
Drop transitions removed 197 transitions
Iterating global reduction 0 with 197 rules applied. Total rules applied 201 place count 1251 transition count 900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 1250 transition count 899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 203 place count 1249 transition count 899
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 203 place count 1249 transition count 897
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 207 place count 1247 transition count 897
Applied a total of 207 rules in 195 ms. Remains 1247 /1253 variables (removed 6) and now considering 897/902 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 1247/1253 places, 897/902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 255577 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255577 steps, saw 248539 distinct states, run finished after 3003 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 897 rows 1247 cols
[2022-05-20 07:34:10] [INFO ] Computed 550 place invariants in 5 ms
[2022-05-20 07:34:11] [INFO ] [Real]Absence check using 550 positive place invariants in 83 ms returned sat
[2022-05-20 07:34:11] [INFO ] After 410ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 07:34:11] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-20 07:34:11] [INFO ] After 55ms SMT Verify possible using 51 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:11] [INFO ] After 810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:12] [INFO ] [Nat]Absence check using 550 positive place invariants in 91 ms returned sat
[2022-05-20 07:34:12] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:12] [INFO ] After 108ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:12] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2022-05-20 07:34:12] [INFO ] After 950ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1247/1247 places, 897/897 transitions.
Applied a total of 0 rules in 42 ms. Remains 1247 /1247 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1247/1247 places, 897/897 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1247/1247 places, 897/897 transitions.
Applied a total of 0 rules in 31 ms. Remains 1247 /1247 variables (removed 0) and now considering 897/897 (removed 0) transitions.
// Phase 1: matrix 897 rows 1247 cols
[2022-05-20 07:34:12] [INFO ] Computed 550 place invariants in 5 ms
[2022-05-20 07:34:13] [INFO ] Implicit Places using invariants in 648 ms returned [1230, 1234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 650 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1245/1247 places, 897/897 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1243 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1243 transition count 895
Applied a total of 4 rules in 51 ms. Remains 1243 /1245 variables (removed 2) and now considering 895/897 (removed 2) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:13] [INFO ] Computed 548 place invariants in 6 ms
[2022-05-20 07:34:14] [INFO ] Implicit Places using invariants in 608 ms returned []
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:14] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:34:14] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-20 07:34:15] [INFO ] Implicit Places using invariants and state equation in 1892 ms returned []
Implicit Place search using SMT with State Equation took 2508 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1243/1247 places, 895/897 transitions.
Finished structural reductions, in 2 iterations. Remains : 1243/1247 places, 895/897 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 263541 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 263541 steps, saw 256366 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:19] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:34:19] [INFO ] [Real]Absence check using 548 positive place invariants in 89 ms returned sat
[2022-05-20 07:34:19] [INFO ] After 691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:20] [INFO ] [Nat]Absence check using 548 positive place invariants in 88 ms returned sat
[2022-05-20 07:34:20] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:20] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-20 07:34:20] [INFO ] After 96ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:20] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-20 07:34:20] [INFO ] After 889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 39 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1243/1243 places, 895/895 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 47 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:20] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:34:21] [INFO ] Implicit Places using invariants in 603 ms returned []
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:21] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:34:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-20 07:34:23] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 2333 ms to find 0 implicit places.
[2022-05-20 07:34:23] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:23] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:34:23] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 27 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:34:23] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:34:23] [INFO ] [Real]Absence check using 548 positive place invariants in 87 ms returned sat
[2022-05-20 07:34:24] [INFO ] After 691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:34:24] [INFO ] [Nat]Absence check using 548 positive place invariants in 82 ms returned sat
[2022-05-20 07:34:25] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:25] [INFO ] After 481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-20 07:34:25] [INFO ] After 758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:34:25] [INFO ] Flatten gal took : 47 ms
[2022-05-20 07:34:25] [INFO ] Flatten gal took : 41 ms
[2022-05-20 07:34:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality420503049222765031.gal : 20 ms
[2022-05-20 07:34:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6609433167543596973.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11239389510760668316;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality420503049222765031.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6609433167543596973.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality6609433167543596973.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :28 after 53
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :53 after 103
Reachability property apf2 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,210,0.49846,12232,2,2651,11,9511,6,0,5724,2717,0
Total reachable state count : 210

Verifying 1 reachability properties.
Reachability property apf2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,74,0.501901,12232,2,1474,11,9511,7,0,5730,2717,0
Knowledge obtained : [(AND p2 p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[true, false, false, (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[true, false, false, (NOT p1)]
Support contains 4 out of 1253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 28 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:26] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 07:34:27] [INFO ] Implicit Places using invariants in 740 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:27] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:34:28] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:28] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:34:29] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 192 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished probabilistic random walk after 55993 steps, run visited all 1 properties in 581 ms. (steps per millisecond=96 )
Probabilistic random walk after 55993 steps, saw 55234 distinct states, run finished after 583 ms. (steps per millisecond=96 ) properties seen :1
Knowledge obtained : [(AND p1 p2), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 330 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 705 ms.
Product exploration explored 100000 steps with 0 reset in 921 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 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 1253 transition count 902
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 191 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2022-05-20 07:34:32] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:32] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:34:33] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/1253 places, 902/902 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Product exploration explored 100000 steps with 0 reset in 713 ms.
Product exploration explored 100000 steps with 0 reset in 967 ms.
Built C files in :
/tmp/ltsmin16342319936540319274
[2022-05-20 07:34:35] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16342319936540319274
Running compilation step : cd /tmp/ltsmin16342319936540319274;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1771 ms.
Running link step : cd /tmp/ltsmin16342319936540319274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin16342319936540319274;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17486879294551054554.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 39 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:50] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 07:34:50] [INFO ] Implicit Places using invariants in 685 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:50] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:34:52] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:34:52] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:34:53] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Built C files in :
/tmp/ltsmin12671781746908432571
[2022-05-20 07:34:53] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12671781746908432571
Running compilation step : cd /tmp/ltsmin12671781746908432571;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1588 ms.
Running link step : cd /tmp/ltsmin12671781746908432571;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12671781746908432571;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7596619310141491240.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 07:35:08] [INFO ] Flatten gal took : 59 ms
[2022-05-20 07:35:08] [INFO ] Flatten gal took : 60 ms
[2022-05-20 07:35:08] [INFO ] Time to serialize gal into /tmp/LTL7987599827814248235.gal : 5 ms
[2022-05-20 07:35:08] [INFO ] Time to serialize properties into /tmp/LTL6002826696781751906.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7987599827814248235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6002826696781751906.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7987599...266
Read 1 LTL properties
Checking formula 0 : !(((G((((G("((p119==0)||(p1172==1))"))||("(p1125==0)"))||("(p330==1)"))&&("((p119==0)||(p1172==1))")))||(X(X("((p225==0)||(p272==1))")...159
Formula 0 simplified : !(G("((p119==0)||(p1172==1))" & ("(p330==1)" | "(p1125==0)" | G"((p119==0)||(p1172==1))")) | XX"((p225==0)||(p272==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-20 07:35:23] [INFO ] Flatten gal took : 52 ms
[2022-05-20 07:35:23] [INFO ] Applying decomposition
[2022-05-20 07:35:23] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5166084306925645824.txt' '-o' '/tmp/graph5166084306925645824.bin' '-w' '/tmp/graph5166084306925645824.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5166084306925645824.bin' '-l' '-1' '-v' '-w' '/tmp/graph5166084306925645824.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:35:23] [INFO ] Decomposing Gal with order
[2022-05-20 07:35:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:35:23] [INFO ] Removed a total of 150 redundant transitions.
[2022-05-20 07:35:23] [INFO ] Flatten gal took : 120 ms
[2022-05-20 07:35:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 121 ms.
[2022-05-20 07:35:24] [INFO ] Time to serialize gal into /tmp/LTL12392704074507041108.gal : 16 ms
[2022-05-20 07:35:24] [INFO ] Time to serialize properties into /tmp/LTL13295895728011679430.ltl : 33 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12392704074507041108.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13295895728011679430.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1239270...247
Read 1 LTL properties
Checking formula 0 : !(((G((((G("((i3.u36.p119==0)||(i21.u374.p1172==1))"))||("(i20.u359.p1125==0)"))||("(i6.i1.i1.i1.u106.p330==1)"))&&("((i3.u36.p119==0)...231
Formula 0 simplified : !(G("((i3.u36.p119==0)||(i21.u374.p1172==1))" & ("(i6.i1.i1.i1.u106.p330==1)" | "(i20.u359.p1125==0)" | G"((i3.u36.p119==0)||(i21.u3...215
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12575283044083134579
[2022-05-20 07:35:39] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12575283044083134579
Running compilation step : cd /tmp/ltsmin12575283044083134579;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1717 ms.
Running link step : cd /tmp/ltsmin12575283044083134579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12575283044083134579;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((([]((LTLAPp1==true))||(LTLAPp0==true))&&(LTLAPp1==true)))||X(X((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-00 finished in 113835 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 1250 transition count 898
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 7 place count 1248 transition count 898
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 9 place count 1247 transition count 897
Applied a total of 9 rules in 106 ms. Remains 1247 /1253 variables (removed 6) and now considering 897/902 (removed 5) transitions.
// Phase 1: matrix 897 rows 1247 cols
[2022-05-20 07:35:54] [INFO ] Computed 550 place invariants in 4 ms
[2022-05-20 07:35:55] [INFO ] Implicit Places using invariants in 634 ms returned [1230, 1234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 640 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1245/1253 places, 897/902 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 1243 transition count 895
Applied a total of 4 rules in 54 ms. Remains 1243 /1245 variables (removed 2) and now considering 895/897 (removed 2) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:35:55] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:35:55] [INFO ] Implicit Places using invariants in 657 ms returned []
// Phase 1: matrix 895 rows 1243 cols
[2022-05-20 07:35:55] [INFO ] Computed 548 place invariants in 6 ms
[2022-05-20 07:35:56] [INFO ] Implicit Places using invariants and state equation in 1269 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1243/1253 places, 895/902 transitions.
Finished structural reductions, in 2 iterations. Remains : 1243/1253 places, 895/902 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s906 0) (EQ s1144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 680 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-01 finished in 3473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||(X(p2)&&p2)||p0)))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 26 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:35:57] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:35:58] [INFO ] Implicit Places using invariants in 688 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:35:58] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:35:59] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 2100 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:35:59] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:36:00] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (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=[p2:(OR (EQ s1003 0) (EQ s656 1)), p1:(EQ s354 1), p0:(OR (EQ s1201 0) (EQ s180 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3124 ms.
Product exploration explored 100000 steps with 50000 reset in 3185 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 p2)))
Knowledge based reduction with 10 factoid took 179 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-02 finished in 9458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p0)&&!p1) U X(X(!p1)))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 28 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:36:07] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:36:07] [INFO ] Implicit Places using invariants in 711 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:36:07] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:36:09] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 2147 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:36:09] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:36:10] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 199 ms :[p1, p1, (AND (NOT p0) p1), p1, true]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s428 0) (EQ s888 1)), p0:(OR (EQ s1228 0) (EQ s866 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25195 reset in 1955 ms.
Product exploration explored 100000 steps with 25112 reset in 2070 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 149 ms :[p1, p1, (AND (NOT p0) p1), p1, true]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 165 ms :[p1, p1, (AND (NOT p0) p1), p1, true]
Stuttering acceptance computed with spot in 161 ms :[p1, p1, (AND (NOT p0) p1), p1, true]
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:36:15] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:36:16] [INFO ] [Real]Absence check using 551 positive place invariants in 351 ms returned sat
[2022-05-20 07:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:36:16] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2022-05-20 07:36:16] [INFO ] Computed and/alt/rep : 901/2799/901 causal constraints (skipped 0 transitions) in 51 ms.
[2022-05-20 07:36:16] [INFO ] Added : 0 causal constraints over 0 iterations in 147 ms. Result :sat
Could not prove EG p1
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 23 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:36:16] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:36:17] [INFO ] Implicit Places using invariants in 717 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:36:17] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 07:36:18] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 2073 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:36:18] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:36:19] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 163 ms :[p1, p1, (AND (NOT p0) p1), p1, true]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 170 ms :[p1, p1, (AND (NOT p0) p1), p1, true]
Stuttering acceptance computed with spot in 172 ms :[p1, p1, (AND (NOT p0) p1), p1, true]
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:36:20] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:36:21] [INFO ] [Real]Absence check using 551 positive place invariants in 360 ms returned sat
[2022-05-20 07:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:36:21] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2022-05-20 07:36:21] [INFO ] Computed and/alt/rep : 901/2799/901 causal constraints (skipped 0 transitions) in 57 ms.
[2022-05-20 07:36:22] [INFO ] Added : 0 causal constraints over 0 iterations in 159 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 160 ms :[p1, p1, (AND (NOT p0) p1), p1, true]
Product exploration explored 100000 steps with 25098 reset in 1924 ms.
Product exploration explored 100000 steps with 25134 reset in 2070 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 185 ms :[p1, p1, (AND (NOT p0) p1), p1, true]
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 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 1253 transition count 902
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 62 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2022-05-20 07:36:26] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:36:26] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:36:27] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/1253 places, 902/902 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Product exploration explored 100000 steps with 25227 reset in 6085 ms.
Product exploration explored 100000 steps with 25067 reset in 6178 ms.
Built C files in :
/tmp/ltsmin6239283573604048817
[2022-05-20 07:36:39] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6239283573604048817
Running compilation step : cd /tmp/ltsmin6239283573604048817;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1762 ms.
Running link step : cd /tmp/ltsmin6239283573604048817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6239283573604048817;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8094761326441584174.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 26 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:36:54] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:36:55] [INFO ] Implicit Places using invariants in 654 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:36:55] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:36:56] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:36:56] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 07:36:57] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Built C files in :
/tmp/ltsmin6965845448388280055
[2022-05-20 07:36:57] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6965845448388280055
Running compilation step : cd /tmp/ltsmin6965845448388280055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1672 ms.
Running link step : cd /tmp/ltsmin6965845448388280055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6965845448388280055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11288597996449743107.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 07:37:12] [INFO ] Flatten gal took : 45 ms
[2022-05-20 07:37:12] [INFO ] Flatten gal took : 45 ms
[2022-05-20 07:37:12] [INFO ] Time to serialize gal into /tmp/LTL15150413105208424341.gal : 6 ms
[2022-05-20 07:37:12] [INFO ] Time to serialize properties into /tmp/LTL13066147197270765219.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15150413105208424341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13066147197270765219.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1515041...268
Read 1 LTL properties
Checking formula 0 : !((G(((X("((p1228==0)||(p866==1))"))&&(!("((p428==0)||(p888==1))")))U(X(X(!("((p428==0)||(p888==1))")))))))
Formula 0 simplified : !G((!"((p428==0)||(p888==1))" & X"((p1228==0)||(p866==1))") U XX!"((p428==0)||(p888==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-20 07:37:27] [INFO ] Flatten gal took : 45 ms
[2022-05-20 07:37:27] [INFO ] Applying decomposition
[2022-05-20 07:37:27] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10758775199428494936.txt' '-o' '/tmp/graph10758775199428494936.bin' '-w' '/tmp/graph10758775199428494936.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10758775199428494936.bin' '-l' '-1' '-v' '-w' '/tmp/graph10758775199428494936.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:37:27] [INFO ] Decomposing Gal with order
[2022-05-20 07:37:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:37:28] [INFO ] Removed a total of 150 redundant transitions.
[2022-05-20 07:37:28] [INFO ] Flatten gal took : 73 ms
[2022-05-20 07:37:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 79 ms.
[2022-05-20 07:37:28] [INFO ] Time to serialize gal into /tmp/LTL13354874982278513992.gal : 25 ms
[2022-05-20 07:37:28] [INFO ] Time to serialize properties into /tmp/LTL1363477421993817403.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13354874982278513992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1363477421993817403.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1335487...246
Read 1 LTL properties
Checking formula 0 : !((G(((X("((i23.u393.p1228==0)||(i17.i0.i0.i1.u276.p866==1))"))&&(!("((i8.u137.p428==0)||(i17.i0.i1.i2.u283.p888==1))")))U(X(X(!("((i8...207
Formula 0 simplified : !G((!"((i8.u137.p428==0)||(i17.i0.i1.i2.u283.p888==1))" & X"((i23.u393.p1228==0)||(i17.i0.i0.i1.u276.p866==1))") U XX!"((i8.u137.p42...192
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1045110588548826537
[2022-05-20 07:37:43] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1045110588548826537
Running compilation step : cd /tmp/ltsmin1045110588548826537;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1716 ms.
Running link step : cd /tmp/ltsmin1045110588548826537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1045110588548826537;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((X((LTLAPp0==true))&&!(LTLAPp1==true)) U X(X(!(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-03 finished in 111143 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U !(p0 U (!F(X(!p0))||p1))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 28 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:37:58] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:37:59] [INFO ] Implicit Places using invariants in 721 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:37:59] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:38:00] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 2150 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:00] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:38:01] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (OR p0 p1), (OR p1 p0), true, p0]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s988 0) (EQ s1003 1)), p1:(OR (EQ s943 0) (EQ s201 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 763 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-05 finished in 3768 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(p1)&&p0))))'
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 26 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:02] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:38:02] [INFO ] Implicit Places using invariants in 692 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:02] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 07:38:04] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 2122 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:04] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:38:04] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s10 0) (EQ s25 1)), p1:(EQ s891 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 685 ms.
Stack based approach found an accepted trace after 87 steps with 0 reset with depth 88 and stack size 88 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-09 finished in 3599 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(X(p0)))&&F(p1))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 27 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:05] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:38:06] [INFO ] Implicit Places using invariants in 690 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:06] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:38:07] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned []
Implicit Place search using SMT with State Equation took 2071 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:07] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:38:08] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s561 0) (EQ s303 1)), p0:(AND (EQ s501 0) (EQ s1251 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 675 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-10 finished in 3603 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!(!p0 U G(p1))&&X(p2)))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 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 1251 transition count 900
Applied a total of 4 rules in 65 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2022-05-20 07:38:09] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:38:10] [INFO ] Implicit Places using invariants in 667 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 675 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 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 1250 transition count 898
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 1248 transition count 898
Applied a total of 4 rules in 38 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2022-05-20 07:38:10] [INFO ] Computed 550 place invariants in 3 ms
[2022-05-20 07:38:10] [INFO ] Implicit Places using invariants in 733 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 735 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 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 1244 transition count 896
Applied a total of 4 rules in 59 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:38:10] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:38:11] [INFO ] Implicit Places using invariants in 692 ms returned []
// Phase 1: matrix 896 rows 1244 cols
[2022-05-20 07:38:11] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:38:13] [INFO ] Implicit Places using invariants and state equation in 1492 ms returned []
Implicit Place search using SMT with State Equation took 2186 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions, in 3 iterations. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p2) p1), p1]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s147 0) (EQ s792 1)), p1:(OR (EQ s646 0) (EQ s713 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 672 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-12 finished in 4520 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&(G(X(G(p1)))||F(p1))))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 27 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:13] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 07:38:14] [INFO ] Implicit Places using invariants in 692 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:14] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 07:38:15] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:15] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:38:16] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 401 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s37 0) (EQ s1072 1)), p1:(OR (EQ s967 0) (EQ s195 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 667 ms.
Product exploration explored 100000 steps with 0 reset in 921 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Finished probabilistic random walk after 69005 steps, run visited all 1 properties in 819 ms. (steps per millisecond=84 )
Probabilistic random walk after 69005 steps, saw 68177 distinct states, run finished after 821 ms. (steps per millisecond=84 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 25 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:20] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 07:38:20] [INFO ] Implicit Places using invariants in 703 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:20] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 07:38:22] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 2117 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:22] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:38:22] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Finished probabilistic random walk after 69005 steps, run visited all 1 properties in 674 ms. (steps per millisecond=102 )
Probabilistic random walk after 69005 steps, saw 68177 distinct states, run finished after 676 ms. (steps per millisecond=102 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 671 ms.
Product exploration explored 100000 steps with 0 reset in 889 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 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 1253 transition count 902
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 60 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2022-05-20 07:38:26] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:26] [INFO ] Computed 551 place invariants in 1 ms
[2022-05-20 07:38:27] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/1253 places, 902/902 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Product exploration explored 100000 steps with 0 reset in 660 ms.
Product exploration explored 100000 steps with 0 reset in 882 ms.
Built C files in :
/tmp/ltsmin16131308178425897532
[2022-05-20 07:38:28] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16131308178425897532
Running compilation step : cd /tmp/ltsmin16131308178425897532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1757 ms.
Running link step : cd /tmp/ltsmin16131308178425897532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16131308178425897532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10566717754038818269.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 26 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:43] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:38:44] [INFO ] Implicit Places using invariants in 664 ms returned []
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:44] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 07:38:45] [INFO ] Implicit Places using invariants and state equation in 1330 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 1253 cols
[2022-05-20 07:38:45] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 07:38:46] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 902/902 transitions.
Built C files in :
/tmp/ltsmin705525115169766887
[2022-05-20 07:38:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin705525115169766887
Running compilation step : cd /tmp/ltsmin705525115169766887;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1574 ms.
Running link step : cd /tmp/ltsmin705525115169766887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin705525115169766887;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12937428258460660152.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 07:39:01] [INFO ] Flatten gal took : 41 ms
[2022-05-20 07:39:01] [INFO ] Flatten gal took : 42 ms
[2022-05-20 07:39:01] [INFO ] Time to serialize gal into /tmp/LTL14864978656150812051.gal : 4 ms
[2022-05-20 07:39:01] [INFO ] Time to serialize properties into /tmp/LTL18212208103882943517.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14864978656150812051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18212208103882943517.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1486497...268
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((p37==0)||(p1072==1))"))&&((G(X(G("((p967==0)||(p195==1))"))))||(F("((p967==0)||(p195==1))")))))))
Formula 0 simplified : !XX(G"((p37==0)||(p1072==1))" & (GXG"((p967==0)||(p195==1))" | F"((p967==0)||(p195==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-20 07:39:16] [INFO ] Flatten gal took : 41 ms
[2022-05-20 07:39:16] [INFO ] Applying decomposition
[2022-05-20 07:39:16] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4142630798730354576.txt' '-o' '/tmp/graph4142630798730354576.bin' '-w' '/tmp/graph4142630798730354576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4142630798730354576.bin' '-l' '-1' '-v' '-w' '/tmp/graph4142630798730354576.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:39:16] [INFO ] Decomposing Gal with order
[2022-05-20 07:39:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:39:16] [INFO ] Removed a total of 150 redundant transitions.
[2022-05-20 07:39:16] [INFO ] Flatten gal took : 54 ms
[2022-05-20 07:39:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 29 ms.
[2022-05-20 07:39:16] [INFO ] Time to serialize gal into /tmp/LTL14058944366173113717.gal : 7 ms
[2022-05-20 07:39:16] [INFO ] Time to serialize properties into /tmp/LTL15352560460594169625.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14058944366173113717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15352560460594169625.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1405894...247
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((i0.u11.p37==0)||(i20.u342.p1072==1))"))&&((G(X(G("((i18.u308.p967==0)||(i2.u61.p195==1))"))))||(F("((i18.u308.p967==0)||(...179
Formula 0 simplified : !XX(G"((i0.u11.p37==0)||(i20.u342.p1072==1))" & (GXG"((i18.u308.p967==0)||(i2.u61.p195==1))" | F"((i18.u308.p967==0)||(i2.u61.p195==...161
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13825864146102659598
[2022-05-20 07:39:31] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13825864146102659598
Running compilation step : cd /tmp/ltsmin13825864146102659598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1654 ms.
Running link step : cd /tmp/ltsmin13825864146102659598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13825864146102659598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp0==true))&&([](X([]((LTLAPp1==true))))||<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-13 finished in 93174 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(((G(p1)||p0)&&p1))||X(X(p2))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p0)&&!p1) U X(X(!p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&(G(X(G(p1)))||F(p1))))))'
[2022-05-20 07:39:47] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9741163645475555074
[2022-05-20 07:39:47] [INFO ] Computing symmetric may disable matrix : 902 transitions.
[2022-05-20 07:39:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:39:47] [INFO ] Computing symmetric may enable matrix : 902 transitions.
[2022-05-20 07:39:47] [INFO ] Applying decomposition
[2022-05-20 07:39:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:39:47] [INFO ] Flatten gal took : 42 ms
[2022-05-20 07:39:47] [INFO ] Computing Do-Not-Accords matrix : 902 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16363475583041793774.txt' '-o' '/tmp/graph16363475583041793774.bin' '-w' '/tmp/graph16363475583041793774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16363475583041793774.bin' '-l' '-1' '-v' '-w' '/tmp/graph16363475583041793774.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:39:47] [INFO ] Decomposing Gal with order
[2022-05-20 07:39:47] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:39:47] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9741163645475555074
Running compilation step : cd /tmp/ltsmin9741163645475555074;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 07:39:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:39:47] [INFO ] Removed a total of 150 redundant transitions.
[2022-05-20 07:39:47] [INFO ] Flatten gal took : 52 ms
[2022-05-20 07:39:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 47 ms.
[2022-05-20 07:39:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality12347987850112171000.gal : 12 ms
[2022-05-20 07:39:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality1617409345548752463.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12347987850112171000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1617409345548752463.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 3 LTL properties
Checking formula 0 : !(((G((((G("((i2.i0.i1.i1.u36.p119==0)||(i20.u374.p1172==1))"))||("(i19.u359.p1125==0)"))||("(i6.u106.p330==1)"))&&("((i2.i0.i1.i1.u36...240
Formula 0 simplified : !(G("((i2.i0.i1.i1.u36.p119==0)||(i20.u374.p1172==1))" & ("(i6.u106.p330==1)" | "(i19.u359.p1125==0)" | G"((i2.i0.i1.i1.u36.p119==0)...224
Compilation finished in 2585 ms.
Running link step : cd /tmp/ltsmin9741163645475555074;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin9741163645475555074;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((([]((LTLAPp1==true))||(LTLAPp0==true))&&(LTLAPp1==true)))||X(X((LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.049: LTL layer: formula: ([]((([]((LTLAPp1==true))||(LTLAPp0==true))&&(LTLAPp1==true)))||X(X((LTLAPp2==true))))
pins2lts-mc-linux64( 1/ 8), 0.049: "([]((([]((LTLAPp1==true))||(LTLAPp0==true))&&(LTLAPp1==true)))||X(X((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.049: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.068: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.209: DFS-FIFO for weak LTL, using special progress label 910
pins2lts-mc-linux64( 0/ 8), 0.209: There are 911 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.209: State length is 1254, there are 913 groups
pins2lts-mc-linux64( 0/ 8), 0.209: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.209: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.209: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.209: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.296: ~1 levels ~960 states ~3768 transitions
pins2lts-mc-linux64( 1/ 8), 0.373: ~1 levels ~1920 states ~8744 transitions
pins2lts-mc-linux64( 1/ 8), 0.541: ~1 levels ~3840 states ~20048 transitions
pins2lts-mc-linux64( 1/ 8), 0.842: ~1 levels ~7680 states ~43752 transitions
pins2lts-mc-linux64( 1/ 8), 1.465: ~1 levels ~15360 states ~94232 transitions
pins2lts-mc-linux64( 6/ 8), 2.501: ~1 levels ~30720 states ~207128 transitions
pins2lts-mc-linux64( 1/ 8), 4.468: ~1 levels ~61440 states ~439936 transitions
pins2lts-mc-linux64( 1/ 8), 8.298: ~1 levels ~122880 states ~949712 transitions
pins2lts-mc-linux64( 1/ 8), 15.685: ~1 levels ~245760 states ~1995000 transitions
pins2lts-mc-linux64( 6/ 8), 29.992: ~1 levels ~491520 states ~4175272 transitions
pins2lts-mc-linux64( 6/ 8), 58.703: ~1 levels ~983040 states ~8926104 transitions
pins2lts-mc-linux64( 6/ 8), 117.026: ~1 levels ~1966080 states ~18437960 transitions
pins2lts-mc-linux64( 1/ 8), 236.435: ~1 levels ~3932160 states ~39718168 transitions
pins2lts-mc-linux64( 1/ 8), 320.555: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 320.736:
pins2lts-mc-linux64( 0/ 8), 320.736: mean standard work distribution: 2.0% (states) 3.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 320.736:
pins2lts-mc-linux64( 0/ 8), 320.736: Explored 5149637 states 55549520 transitions, fanout: 10.787
pins2lts-mc-linux64( 0/ 8), 320.736: Total exploration time 320.520 sec (320.360 sec minimum, 320.429 sec on average)
pins2lts-mc-linux64( 0/ 8), 320.736: States per second: 16067, Transitions per second: 173311
pins2lts-mc-linux64( 0/ 8), 320.736:
pins2lts-mc-linux64( 0/ 8), 320.736: Progress states detected: 10608354
pins2lts-mc-linux64( 0/ 8), 320.736: Redundant explorations: -51.4571
pins2lts-mc-linux64( 0/ 8), 320.736:
pins2lts-mc-linux64( 0/ 8), 320.736: Queue width: 8B, total height: 9259965, memory: 70.65MB
pins2lts-mc-linux64( 0/ 8), 320.736: Tree memory: 336.9MB, 33.3 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 320.736: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 320.736: Stored 909 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 320.736: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 320.736: Est. total memory use: 407.6MB (~1094.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9741163645475555074;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((([]((LTLAPp1==true))||(LTLAPp0==true))&&(LTLAPp1==true)))||X(X((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9741163645475555074;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((([]((LTLAPp1==true))||(LTLAPp0==true))&&(LTLAPp1==true)))||X(X((LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-20 08:01:58] [INFO ] Applying decomposition
[2022-05-20 08:01:58] [INFO ] Flatten gal took : 418 ms
[2022-05-20 08:01:58] [INFO ] Decomposing Gal with order
[2022-05-20 08:01:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:01:59] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 08:01:59] [INFO ] Flatten gal took : 365 ms
[2022-05-20 08:01:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 100 ms.
[2022-05-20 08:01:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality6033694571294879014.gal : 54 ms
[2022-05-20 08:01:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality7172626204419012513.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6033694571294879014.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7172626204419012513.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...267
Read 3 LTL properties
Checking formula 0 : !(((G((((G("((i36.u67.p119==0)||(u657.p1172==1))"))||("(u630.p1125==0)"))||("(i106.u852.p330==1)"))&&("((i36.u67.p119==0)||(u657.p1172...210
Formula 0 simplified : !(G("((i36.u67.p119==0)||(u657.p1172==1))" & ("(i106.u852.p330==1)" | "(u630.p1125==0)" | G"((i36.u67.p119==0)||(u657.p1172==1))")) ...194
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
26910 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,269.307,5518228,1,0,1.24723e+07,1370,12482,2.03746e+07,45,1040,10819639
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(((X("((u688.p1228==0)||(i276.u486.p866==1))"))&&(!("((u240.p428==0)||(i283.u498.p888==1))")))U(X(X(!("((u240.p428==0)||(i283.u498...173
Formula 1 simplified : !G((!"((u240.p428==0)||(i283.u498.p888==1))" & X"((u688.p1228==0)||(i276.u486.p866==1))") U XX!"((u240.p428==0)||(i283.u498.p888==1)...158
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
18769 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,457.003,6687552,1,0,1.55027e+07,1370,8571,2.39837e+07,35,1040,33678
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X((G("((i11.u21.p37==0)||(u601.p1072==1))"))&&((G(X(G("((i308.u542.p967==0)||(u110.p195==1))"))))||(F("((i308.u542.p967==0)||(u11...174
Formula 2 simplified : !XX(G"((i11.u21.p37==0)||(u601.p1072==1))" & (GXG"((i308.u542.p967==0)||(u110.p195==1))" | F"((i308.u542.p967==0)||(u110.p195==1))")...156
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
10138 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,558.388,6687680,1,0,1.55027e+07,1370,11012,2.39837e+07,38,1040,20904858
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 2336379 ms.

BK_STOP 1653034334342

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -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=@none -Xss128m -Xms40m -Xmx8192m

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-050A"
export BK_EXAMINATION="LTLCardinality"
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-050A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025600675"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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