Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r101-tall-167814475900803.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DLCshifumi-PT-2b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475900803
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.9K Feb 26 07:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 07:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 07:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 07:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 197K Feb 26 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 26 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 729K Mar 5 18:22 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 DLCshifumi-PT-2b-LTLCardinality-00
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-01
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-02
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-03
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-04
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-05
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-06
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-07
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-08
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-09
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-10
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-11
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-12
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-13
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-14
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678320650871

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-2b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 00:10:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 00:10:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 00:10:52] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-09 00:10:52] [INFO ] Transformed 2483 places.
[2023-03-09 00:10:52] [INFO ] Transformed 3183 transitions.
[2023-03-09 00:10:52] [INFO ] Found NUPN structural information;
[2023-03-09 00:10:52] [INFO ] Parsed PT model containing 2483 places and 3183 transitions and 7756 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DLCshifumi-PT-2b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 2483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2483/2483 places, 3183/3183 transitions.
Discarding 390 places :
Symmetric choice reduction at 0 with 390 rule applications. Total rules 390 place count 2093 transition count 2793
Iterating global reduction 0 with 390 rules applied. Total rules applied 780 place count 2093 transition count 2793
Discarding 306 places :
Symmetric choice reduction at 0 with 306 rule applications. Total rules 1086 place count 1787 transition count 2487
Iterating global reduction 0 with 306 rules applied. Total rules applied 1392 place count 1787 transition count 2487
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 1394 place count 1787 transition count 2485
Discarding 110 places :
Symmetric choice reduction at 1 with 110 rule applications. Total rules 1504 place count 1677 transition count 2332
Iterating global reduction 1 with 110 rules applied. Total rules applied 1614 place count 1677 transition count 2332
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 1718 place count 1573 transition count 2228
Iterating global reduction 1 with 104 rules applied. Total rules applied 1822 place count 1573 transition count 2228
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 1835 place count 1573 transition count 2215
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1881 place count 1527 transition count 2169
Iterating global reduction 2 with 46 rules applied. Total rules applied 1927 place count 1527 transition count 2169
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1973 place count 1481 transition count 2123
Iterating global reduction 2 with 46 rules applied. Total rules applied 2019 place count 1481 transition count 2123
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 2064 place count 1436 transition count 2078
Iterating global reduction 2 with 45 rules applied. Total rules applied 2109 place count 1436 transition count 2078
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 2150 place count 1395 transition count 2037
Iterating global reduction 2 with 41 rules applied. Total rules applied 2191 place count 1395 transition count 2037
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 2217 place count 1369 transition count 2011
Iterating global reduction 2 with 26 rules applied. Total rules applied 2243 place count 1369 transition count 2011
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 2269 place count 1343 transition count 1985
Iterating global reduction 2 with 26 rules applied. Total rules applied 2295 place count 1343 transition count 1985
Applied a total of 2295 rules in 1192 ms. Remains 1343 /2483 variables (removed 1140) and now considering 1985/3183 (removed 1198) transitions.
// Phase 1: matrix 1985 rows 1343 cols
[2023-03-09 00:10:54] [INFO ] Computed 79 place invariants in 31 ms
[2023-03-09 00:10:54] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-09 00:10:54] [INFO ] Invariant cache hit.
[2023-03-09 00:10:55] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
[2023-03-09 00:10:55] [INFO ] Invariant cache hit.
[2023-03-09 00:10:56] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1343/2483 places, 1985/3183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3339 ms. Remains : 1343/2483 places, 1985/3183 transitions.
Support contains 21 out of 1343 places after structural reductions.
[2023-03-09 00:10:56] [INFO ] Flatten gal took : 120 ms
[2023-03-09 00:10:56] [INFO ] Flatten gal took : 75 ms
[2023-03-09 00:10:56] [INFO ] Input system was already deterministic with 1985 transitions.
Support contains 19 out of 1343 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 00:10:57] [INFO ] Invariant cache hit.
[2023-03-09 00:10:57] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 00:10:57] [INFO ] [Nat]Absence check using 79 positive place invariants in 34 ms returned sat
[2023-03-09 00:10:57] [INFO ] After 527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 00:10:58] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-09 00:10:58] [INFO ] After 899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 222 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=74 )
Parikh walk visited 1 properties in 9 ms.
FORMULA DLCshifumi-PT-2b-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 143 stabilizing places and 143 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1985/1985 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1331 transition count 1973
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1331 transition count 1973
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1323 transition count 1963
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1323 transition count 1963
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 1317 transition count 1957
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1317 transition count 1957
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 1315 transition count 1953
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 1315 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 1314 transition count 1952
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 1314 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 1313 transition count 1951
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 1313 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 1312 transition count 1950
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 1312 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 1311 transition count 1949
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 1311 transition count 1949
Applied a total of 66 rules in 238 ms. Remains 1311 /1343 variables (removed 32) and now considering 1949/1985 (removed 36) transitions.
// Phase 1: matrix 1949 rows 1311 cols
[2023-03-09 00:10:58] [INFO ] Computed 79 place invariants in 23 ms
[2023-03-09 00:10:58] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-09 00:10:58] [INFO ] Invariant cache hit.
[2023-03-09 00:10:59] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
[2023-03-09 00:10:59] [INFO ] Invariant cache hit.
[2023-03-09 00:11:00] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1311/1343 places, 1949/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2109 ms. Remains : 1311/1343 places, 1949/1985 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s523 0) (EQ s968 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 588 ms.
Product exploration explored 100000 steps with 33333 reset in 536 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCshifumi-PT-2b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCshifumi-PT-2b-LTLCardinality-00 finished in 3600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1985/1985 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1333 transition count 1975
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1333 transition count 1975
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 1326 transition count 1966
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 1326 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 1321 transition count 1961
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 1321 transition count 1961
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 1321 transition count 1959
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 1320 transition count 1958
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 1320 transition count 1958
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 1319 transition count 1957
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 1319 transition count 1957
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 1318 transition count 1956
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 1318 transition count 1956
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 1317 transition count 1955
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 1317 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 1316 transition count 1954
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 1316 transition count 1954
Applied a total of 56 rules in 230 ms. Remains 1316 /1343 variables (removed 27) and now considering 1954/1985 (removed 31) transitions.
// Phase 1: matrix 1954 rows 1316 cols
[2023-03-09 00:11:02] [INFO ] Computed 79 place invariants in 15 ms
[2023-03-09 00:11:02] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-09 00:11:02] [INFO ] Invariant cache hit.
[2023-03-09 00:11:03] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2023-03-09 00:11:03] [INFO ] Invariant cache hit.
[2023-03-09 00:11:03] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1316/1343 places, 1954/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2074 ms. Remains : 1316/1343 places, 1954/1985 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s87 0) (EQ s854 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 675 ms.
Product exploration explored 100000 steps with 50000 reset in 675 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCshifumi-PT-2b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCshifumi-PT-2b-LTLCardinality-01 finished in 3606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p0))&&(F(p1) U X(p2))))))'
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1985/1985 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1334 transition count 1976
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1334 transition count 1976
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 1329 transition count 1970
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 1329 transition count 1970
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 1325 transition count 1966
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 1325 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1325 transition count 1965
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1323 transition count 1963
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1323 transition count 1963
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1322 transition count 1962
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1322 transition count 1962
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1321 transition count 1961
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1321 transition count 1961
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1320 transition count 1960
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1320 transition count 1960
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1319 transition count 1959
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1319 transition count 1959
Applied a total of 49 rules in 230 ms. Remains 1319 /1343 variables (removed 24) and now considering 1959/1985 (removed 26) transitions.
// Phase 1: matrix 1959 rows 1319 cols
[2023-03-09 00:11:05] [INFO ] Computed 79 place invariants in 11 ms
[2023-03-09 00:11:06] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-09 00:11:06] [INFO ] Invariant cache hit.
[2023-03-09 00:11:06] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
[2023-03-09 00:11:06] [INFO ] Invariant cache hit.
[2023-03-09 00:11:07] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1319/1343 places, 1959/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2103 ms. Remains : 1319/1343 places, 1959/1985 transitions.
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (EQ s136 0) (EQ s25 1)), p2:(EQ s580 1), p0:(EQ s170 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10484 steps with 3 reset in 45 ms.
FORMULA DLCshifumi-PT-2b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLCardinality-03 finished in 2580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 1343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1343/1343 places, 1985/1985 transitions.
Graph (trivial) has 1278 edges and 1343 vertex of which 319 / 1343 are part of one of the 23 SCC in 6 ms
Free SCC test removed 296 places
Ensure Unique test removed 332 transitions
Reduce isomorphic transitions removed 332 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 294 transitions
Trivial Post-agglo rules discarded 294 transitions
Performed 294 trivial Post agglomeration. Transition count delta: 294
Iterating post reduction 0 with 294 rules applied. Total rules applied 295 place count 1046 transition count 1358
Reduce places removed 294 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 349 rules applied. Total rules applied 644 place count 752 transition count 1303
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 40 rules applied. Total rules applied 684 place count 716 transition count 1299
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 686 place count 714 transition count 1299
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 107 Pre rules applied. Total rules applied 686 place count 714 transition count 1192
Deduced a syphon composed of 107 places in 2 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 900 place count 607 transition count 1192
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 944 place count 563 transition count 1030
Iterating global reduction 4 with 44 rules applied. Total rules applied 988 place count 563 transition count 1030
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1001 place count 563 transition count 1017
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1001 place count 563 transition count 1016
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1003 place count 562 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1004 place count 561 transition count 1014
Iterating global reduction 5 with 1 rules applied. Total rules applied 1005 place count 561 transition count 1014
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1006 place count 561 transition count 1013
Performed 194 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 6 with 388 rules applied. Total rules applied 1394 place count 367 transition count 817
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1396 place count 367 transition count 815
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 1416 place count 347 transition count 705
Iterating global reduction 7 with 20 rules applied. Total rules applied 1436 place count 347 transition count 705
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1455 place count 347 transition count 686
Performed 50 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 8 with 100 rules applied. Total rules applied 1555 place count 297 transition count 761
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1569 place count 283 transition count 697
Iterating global reduction 8 with 14 rules applied. Total rules applied 1583 place count 283 transition count 697
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 1612 place count 283 transition count 668
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 1629 place count 283 transition count 651
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1633 place count 279 transition count 643
Iterating global reduction 9 with 4 rules applied. Total rules applied 1637 place count 279 transition count 643
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1641 place count 275 transition count 577
Iterating global reduction 9 with 4 rules applied. Total rules applied 1645 place count 275 transition count 577
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1649 place count 275 transition count 573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1650 place count 274 transition count 572
Applied a total of 1650 rules in 242 ms. Remains 274 /1343 variables (removed 1069) and now considering 572/1985 (removed 1413) transitions.
[2023-03-09 00:11:08] [INFO ] Flow matrix only has 545 transitions (discarded 27 similar events)
// Phase 1: matrix 545 rows 274 cols
[2023-03-09 00:11:08] [INFO ] Computed 79 place invariants in 3 ms
[2023-03-09 00:11:08] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-09 00:11:08] [INFO ] Flow matrix only has 545 transitions (discarded 27 similar events)
[2023-03-09 00:11:08] [INFO ] Invariant cache hit.
[2023-03-09 00:11:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 00:11:08] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-09 00:11:08] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-09 00:11:08] [INFO ] Flow matrix only has 545 transitions (discarded 27 similar events)
[2023-03-09 00:11:08] [INFO ] Invariant cache hit.
[2023-03-09 00:11:08] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/1343 places, 572/1985 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 850 ms. Remains : 274/1343 places, 572/1985 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s132 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 3 ms.
FORMULA DLCshifumi-PT-2b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLCardinality-04 finished in 946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p0)))))'
Support contains 1 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1985/1985 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1332 transition count 1974
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1332 transition count 1974
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 1325 transition count 1965
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 1325 transition count 1965
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1320 transition count 1960
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1320 transition count 1960
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 1320 transition count 1958
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 1319 transition count 1957
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 1319 transition count 1957
Applied a total of 50 rules in 164 ms. Remains 1319 /1343 variables (removed 24) and now considering 1957/1985 (removed 28) transitions.
// Phase 1: matrix 1957 rows 1319 cols
[2023-03-09 00:11:09] [INFO ] Computed 79 place invariants in 9 ms
[2023-03-09 00:11:09] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-09 00:11:09] [INFO ] Invariant cache hit.
[2023-03-09 00:11:10] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2023-03-09 00:11:10] [INFO ] Invariant cache hit.
[2023-03-09 00:11:10] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1319/1343 places, 1957/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1963 ms. Remains : 1319/1343 places, 1957/1985 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s322 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 10136 steps with 2 reset in 39 ms.
FORMULA DLCshifumi-PT-2b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLCardinality-06 finished in 2090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1985/1985 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1331 transition count 1973
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1331 transition count 1973
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1323 transition count 1963
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1323 transition count 1963
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 1317 transition count 1957
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1317 transition count 1957
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 1315 transition count 1953
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 1315 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 1314 transition count 1952
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 1314 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 1313 transition count 1951
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 1313 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 1312 transition count 1950
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 1312 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 1311 transition count 1949
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 1311 transition count 1949
Applied a total of 66 rules in 271 ms. Remains 1311 /1343 variables (removed 32) and now considering 1949/1985 (removed 36) transitions.
// Phase 1: matrix 1949 rows 1311 cols
[2023-03-09 00:11:11] [INFO ] Computed 79 place invariants in 10 ms
[2023-03-09 00:11:11] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-09 00:11:11] [INFO ] Invariant cache hit.
[2023-03-09 00:11:12] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
[2023-03-09 00:11:12] [INFO ] Invariant cache hit.
[2023-03-09 00:11:13] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1311/1343 places, 1949/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2098 ms. Remains : 1311/1343 places, 1949/1985 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s992 0) (NEQ s653 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 109 reset in 308 ms.
Product exploration explored 100000 steps with 111 reset in 441 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 922 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=184 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-09 00:11:14] [INFO ] Invariant cache hit.
[2023-03-09 00:11:15] [INFO ] [Real]Absence check using 79 positive place invariants in 58 ms returned sat
[2023-03-09 00:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:11:16] [INFO ] [Real]Absence check using state equation in 1840 ms returned sat
[2023-03-09 00:11:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:11:17] [INFO ] [Nat]Absence check using 79 positive place invariants in 63 ms returned sat
[2023-03-09 00:11:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:11:19] [INFO ] [Nat]Absence check using state equation in 1783 ms returned sat
[2023-03-09 00:11:19] [INFO ] Computed and/alt/rep : 1890/3087/1890 causal constraints (skipped 58 transitions) in 99 ms.
[2023-03-09 00:11:32] [INFO ] Deduced a trap composed of 9 places in 478 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 00:11:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 1949/1949 transitions.
Graph (trivial) has 1242 edges and 1311 vertex of which 319 / 1311 are part of one of the 23 SCC in 1 ms
Free SCC test removed 296 places
Ensure Unique test removed 332 transitions
Reduce isomorphic transitions removed 332 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 277 place count 1014 transition count 1340
Reduce places removed 276 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 327 rules applied. Total rules applied 604 place count 738 transition count 1289
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 638 place count 704 transition count 1289
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 638 place count 704 transition count 1182
Deduced a syphon composed of 107 places in 2 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 852 place count 597 transition count 1182
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 894 place count 555 transition count 1005
Iterating global reduction 3 with 42 rules applied. Total rules applied 936 place count 555 transition count 1005
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 950 place count 555 transition count 991
Performed 192 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 192 places in 0 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 4 with 384 rules applied. Total rules applied 1334 place count 363 transition count 797
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1336 place count 363 transition count 795
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1355 place count 344 transition count 701
Iterating global reduction 5 with 19 rules applied. Total rules applied 1374 place count 344 transition count 701
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1393 place count 344 transition count 682
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 1491 place count 295 transition count 749
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1506 place count 280 transition count 683
Iterating global reduction 6 with 15 rules applied. Total rules applied 1521 place count 280 transition count 683
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 6 with 31 rules applied. Total rules applied 1552 place count 280 transition count 652
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 1567 place count 280 transition count 637
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1571 place count 276 transition count 629
Iterating global reduction 7 with 4 rules applied. Total rules applied 1575 place count 276 transition count 629
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1579 place count 272 transition count 563
Iterating global reduction 7 with 4 rules applied. Total rules applied 1583 place count 272 transition count 563
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1587 place count 272 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1588 place count 271 transition count 558
Applied a total of 1588 rules in 113 ms. Remains 271 /1311 variables (removed 1040) and now considering 558/1949 (removed 1391) transitions.
[2023-03-09 00:11:32] [INFO ] Flow matrix only has 535 transitions (discarded 23 similar events)
// Phase 1: matrix 535 rows 271 cols
[2023-03-09 00:11:32] [INFO ] Computed 79 place invariants in 4 ms
[2023-03-09 00:11:32] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-09 00:11:32] [INFO ] Flow matrix only has 535 transitions (discarded 23 similar events)
[2023-03-09 00:11:32] [INFO ] Invariant cache hit.
[2023-03-09 00:11:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 00:11:32] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-09 00:11:32] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-09 00:11:32] [INFO ] Flow matrix only has 535 transitions (discarded 23 similar events)
[2023-03-09 00:11:32] [INFO ] Invariant cache hit.
[2023-03-09 00:11:33] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/1311 places, 558/1949 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 685 ms. Remains : 271/1311 places, 558/1949 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 78 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-09 00:11:33] [INFO ] Flow matrix only has 535 transitions (discarded 23 similar events)
[2023-03-09 00:11:33] [INFO ] Invariant cache hit.
[2023-03-09 00:11:33] [INFO ] [Real]Absence check using 79 positive place invariants in 15 ms returned sat
[2023-03-09 00:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:11:33] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2023-03-09 00:11:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:11:34] [INFO ] [Nat]Absence check using 79 positive place invariants in 16 ms returned sat
[2023-03-09 00:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:11:34] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-09 00:11:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 00:11:34] [INFO ] [Nat]Added 42 Read/Feed constraints in 6 ms returned sat
[2023-03-09 00:11:34] [INFO ] Computed and/alt/rep : 321/638/321 causal constraints (skipped 145 transitions) in 26 ms.
[2023-03-09 00:11:34] [INFO ] Added : 0 causal constraints over 0 iterations in 62 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLCardinality-10 finished in 23214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((F(p0)||G(p1)))))))'
Support contains 3 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1985/1985 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1333 transition count 1975
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1333 transition count 1975
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 1327 transition count 1968
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 1327 transition count 1968
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 1322 transition count 1963
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 1322 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1322 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1320 transition count 1960
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1320 transition count 1960
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1319 transition count 1959
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1319 transition count 1959
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1318 transition count 1958
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1318 transition count 1958
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1317 transition count 1957
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1317 transition count 1957
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1316 transition count 1956
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1316 transition count 1956
Applied a total of 55 rules in 229 ms. Remains 1316 /1343 variables (removed 27) and now considering 1956/1985 (removed 29) transitions.
// Phase 1: matrix 1956 rows 1316 cols
[2023-03-09 00:11:34] [INFO ] Computed 79 place invariants in 13 ms
[2023-03-09 00:11:34] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-09 00:11:34] [INFO ] Invariant cache hit.
[2023-03-09 00:11:35] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
[2023-03-09 00:11:35] [INFO ] Invariant cache hit.
[2023-03-09 00:11:36] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1316/1343 places, 1956/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2038 ms. Remains : 1316/1343 places, 1956/1985 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (EQ s863 0) (EQ s718 1)), p1:(EQ s377 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 342 ms.
Product exploration explored 100000 steps with 20000 reset in 344 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 00:11:37] [INFO ] Invariant cache hit.
[2023-03-09 00:11:37] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 00:11:38] [INFO ] [Nat]Absence check using 79 positive place invariants in 34 ms returned sat
[2023-03-09 00:11:38] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 00:11:38] [INFO ] After 637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-09 00:11:38] [INFO ] After 875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 191 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=95 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1316/1316 places, 1956/1956 transitions.
Applied a total of 0 rules in 29 ms. Remains 1316 /1316 variables (removed 0) and now considering 1956/1956 (removed 0) transitions.
[2023-03-09 00:11:39] [INFO ] Invariant cache hit.
[2023-03-09 00:11:39] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-09 00:11:39] [INFO ] Invariant cache hit.
[2023-03-09 00:11:40] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
[2023-03-09 00:11:40] [INFO ] Invariant cache hit.
[2023-03-09 00:11:41] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1831 ms. Remains : 1316/1316 places, 1956/1956 transitions.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 00:11:41] [INFO ] Invariant cache hit.
[2023-03-09 00:11:41] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 00:11:42] [INFO ] [Nat]Absence check using 79 positive place invariants in 35 ms returned sat
[2023-03-09 00:11:42] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 00:11:42] [INFO ] After 626ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-09 00:11:42] [INFO ] After 872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 170 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=170 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 387 ms.
Product exploration explored 100000 steps with 20000 reset in 394 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1316/1316 places, 1956/1956 transitions.
Graph (trivial) has 1247 edges and 1316 vertex of which 313 / 1316 are part of one of the 23 SCC in 2 ms
Free SCC test removed 290 places
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 280 rules applied. Total rules applied 281 place count 1026 transition count 1632
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 33 rules applied. Total rules applied 314 place count 1026 transition count 1615
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 314 place count 1026 transition count 1630
Deduced a syphon composed of 326 places in 2 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 344 place count 1026 transition count 1630
Discarding 179 places :
Symmetric choice reduction at 2 with 179 rule applications. Total rules 523 place count 847 transition count 1317
Deduced a syphon composed of 186 places in 3 ms
Iterating global reduction 2 with 179 rules applied. Total rules applied 702 place count 847 transition count 1317
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 716 place count 847 transition count 1303
Performed 289 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 475 places in 1 ms
Iterating global reduction 3 with 289 rules applied. Total rules applied 1005 place count 847 transition count 1305
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1008 place count 847 transition count 1302
Renaming transitions due to excessive name length > 1024 char.
Discarding 260 places :
Symmetric choice reduction at 4 with 260 rule applications. Total rules 1268 place count 587 transition count 967
Deduced a syphon composed of 234 places in 0 ms
Iterating global reduction 4 with 260 rules applied. Total rules applied 1528 place count 587 transition count 967
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 1547 place count 587 transition count 948
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1549 place count 585 transition count 946
Deduced a syphon composed of 232 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1551 place count 585 transition count 946
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 233 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1552 place count 585 transition count 946
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1554 place count 583 transition count 944
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1556 place count 583 transition count 944
Performed 53 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 284 places in 0 ms
Iterating global reduction 5 with 53 rules applied. Total rules applied 1609 place count 583 transition count 1212
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 1640 place count 583 transition count 1181
Discarding 71 places :
Symmetric choice reduction at 6 with 71 rule applications. Total rules 1711 place count 512 transition count 989
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 6 with 71 rules applied. Total rules applied 1782 place count 512 transition count 989
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 6 with 45 rules applied. Total rules applied 1827 place count 512 transition count 944
Discarding 31 places :
Symmetric choice reduction at 7 with 31 rule applications. Total rules 1858 place count 481 transition count 882
Deduced a syphon composed of 198 places in 0 ms
Iterating global reduction 7 with 31 rules applied. Total rules applied 1889 place count 481 transition count 882
Deduced a syphon composed of 198 places in 0 ms
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 7 with 20 rules applied. Total rules applied 1909 place count 481 transition count 862
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1912 place count 478 transition count 857
Deduced a syphon composed of 197 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1915 place count 478 transition count 857
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1917 place count 476 transition count 823
Deduced a syphon composed of 197 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 1919 place count 476 transition count 823
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1922 place count 476 transition count 820
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1924 place count 474 transition count 817
Deduced a syphon composed of 195 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1926 place count 474 transition count 817
Deduced a syphon composed of 195 places in 0 ms
Applied a total of 1926 rules in 388 ms. Remains 474 /1316 variables (removed 842) and now considering 817/1956 (removed 1139) transitions.
[2023-03-09 00:11:45] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-09 00:11:45] [INFO ] Flow matrix only has 795 transitions (discarded 22 similar events)
// Phase 1: matrix 795 rows 474 cols
[2023-03-09 00:11:45] [INFO ] Computed 79 place invariants in 11 ms
[2023-03-09 00:11:45] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 474/1316 places, 817/1956 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 700 ms. Remains : 474/1316 places, 817/1956 transitions.
Built C files in :
/tmp/ltsmin8151134589427050418
[2023-03-09 00:11:45] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8151134589427050418
Running compilation step : cd /tmp/ltsmin8151134589427050418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8151134589427050418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8151134589427050418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1316/1316 places, 1956/1956 transitions.
Applied a total of 0 rules in 28 ms. Remains 1316 /1316 variables (removed 0) and now considering 1956/1956 (removed 0) transitions.
// Phase 1: matrix 1956 rows 1316 cols
[2023-03-09 00:11:48] [INFO ] Computed 79 place invariants in 10 ms
[2023-03-09 00:11:48] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-09 00:11:48] [INFO ] Invariant cache hit.
[2023-03-09 00:11:49] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
[2023-03-09 00:11:49] [INFO ] Invariant cache hit.
[2023-03-09 00:11:50] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1846 ms. Remains : 1316/1316 places, 1956/1956 transitions.
Built C files in :
/tmp/ltsmin6264640949774076260
[2023-03-09 00:11:50] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6264640949774076260
Running compilation step : cd /tmp/ltsmin6264640949774076260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6264640949774076260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6264640949774076260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 00:11:53] [INFO ] Flatten gal took : 59 ms
[2023-03-09 00:11:53] [INFO ] Flatten gal took : 60 ms
[2023-03-09 00:11:53] [INFO ] Time to serialize gal into /tmp/LTL16553492420539827452.gal : 14 ms
[2023-03-09 00:11:53] [INFO ] Time to serialize properties into /tmp/LTL12829297122919479152.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16553492420539827452.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6014041148356935767.hoa' '-atoms' '/tmp/LTL12829297122919479152.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12829297122919479152.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6014041148356935767.hoa
Detected timeout of ITS tools.
[2023-03-09 00:12:08] [INFO ] Flatten gal took : 51 ms
[2023-03-09 00:12:08] [INFO ] Flatten gal took : 48 ms
[2023-03-09 00:12:08] [INFO ] Time to serialize gal into /tmp/LTL7774349676517518848.gal : 8 ms
[2023-03-09 00:12:08] [INFO ] Time to serialize properties into /tmp/LTL10034615291416476018.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7774349676517518848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10034615291416476018.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((F("((p1767==0)||(p1543==1))"))||(G("(p804==0)"))))))))
Formula 0 simplified : XXXX(G!"((p1767==0)||(p1543==1))" & F!"(p804==0)")
Detected timeout of ITS tools.
[2023-03-09 00:12:24] [INFO ] Flatten gal took : 43 ms
[2023-03-09 00:12:24] [INFO ] Applying decomposition
[2023-03-09 00:12:24] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph589286270278437202.txt' '-o' '/tmp/graph589286270278437202.bin' '-w' '/tmp/graph589286270278437202.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph589286270278437202.bin' '-l' '-1' '-v' '-w' '/tmp/graph589286270278437202.weights' '-q' '0' '-e' '0.001'
[2023-03-09 00:12:24] [INFO ] Decomposing Gal with order
[2023-03-09 00:12:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 00:12:24] [INFO ] Removed a total of 1447 redundant transitions.
[2023-03-09 00:12:24] [INFO ] Flatten gal took : 136 ms
[2023-03-09 00:12:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 20 ms.
[2023-03-09 00:12:24] [INFO ] Time to serialize gal into /tmp/LTL16356543355666260630.gal : 19 ms
[2023-03-09 00:12:24] [INFO ] Time to serialize properties into /tmp/LTL16832569446864448690.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16356543355666260630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16832569446864448690.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((F("((i19.u349.p1767==0)||(i15.i1.i2.u288.p1543==1))"))||(G("(i7.i0.i1.u154.p804==0)"))))))))
Formula 0 simplified : XXXX(G!"((i19.u349.p1767==0)||(i15.i1.i2.u288.p1543==1))" & F!"(i7.i0.i1.u154.p804==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11657126536913825572
[2023-03-09 00:12:39] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11657126536913825572
Running compilation step : cd /tmp/ltsmin11657126536913825572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11657126536913825572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11657126536913825572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DLCshifumi-PT-2b-LTLCardinality-11 finished in 68439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((F(p0)||G(p1)))))))'
[2023-03-09 00:12:42] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5460426946066197603
[2023-03-09 00:12:42] [INFO ] Too many transitions (1985) to apply POR reductions. Disabling POR matrices.
[2023-03-09 00:12:42] [INFO ] Applying decomposition
[2023-03-09 00:12:42] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5460426946066197603
Running compilation step : cd /tmp/ltsmin5460426946066197603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 00:12:42] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4935148464277334423.txt' '-o' '/tmp/graph4935148464277334423.bin' '-w' '/tmp/graph4935148464277334423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4935148464277334423.bin' '-l' '-1' '-v' '-w' '/tmp/graph4935148464277334423.weights' '-q' '0' '-e' '0.001'
[2023-03-09 00:12:43] [INFO ] Decomposing Gal with order
[2023-03-09 00:12:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 00:12:43] [INFO ] Removed a total of 1385 redundant transitions.
[2023-03-09 00:12:43] [INFO ] Flatten gal took : 76 ms
[2023-03-09 00:12:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 13 ms.
[2023-03-09 00:12:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality8549811005174021166.gal : 13 ms
[2023-03-09 00:12:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality8453121737613715936.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8549811005174021166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8453121737613715936.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((F("((i19.u348.p1767==0)||(i15.u292.p1543==1))"))||(G("(i8.i1.i1.u152.p804==0)"))))))))
Formula 0 simplified : XXXX(G!"((i19.u348.p1767==0)||(i15.u292.p1543==1))" & F!"(i8.i1.i1.u152.p804==0)")
Compilation finished in 3583 ms.
Running link step : cd /tmp/ltsmin5460426946066197603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin5460426946066197603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X((<>((LTLAPp0==true))||[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
LTSmin run took 674 ms.
FORMULA DLCshifumi-PT-2b-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 114917 ms.

BK_STOP 1678320768182

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DLCshifumi-PT-2b"
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-5348"
echo " Executing tool itstools"
echo " Input is DLCshifumi-PT-2b, 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 r101-tall-167814475900803"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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