Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r649-smll-171774451500013.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ResIsolation-PT-N08P3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r649-smll-171774451500013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 6.8K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 21M Jun 7 06:26 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 ResIsolation-PT-N08P3-LTLFireability-00
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-01
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-02
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-03
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-04
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-05
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-06
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-07
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-08
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-09
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-10
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-11
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-12
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-13
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-14
FORMULA_NAME ResIsolation-PT-N08P3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717756318077

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResIsolation-PT-N08P3
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-07 10:32:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 10:32:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 10:32:03] [INFO ] Load time of PNML (sax parser for PT used): 1535 ms
[2024-06-07 10:32:03] [INFO ] Transformed 348 places.
[2024-06-07 10:32:03] [INFO ] Transformed 18744 transitions.
[2024-06-07 10:32:03] [INFO ] Found NUPN structural information;
[2024-06-07 10:32:03] [INFO ] Parsed PT model containing 348 places and 18744 transitions and 406138 arcs in 1938 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ResIsolation-PT-N08P3-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P3-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P3-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P3-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 18744/18744 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 337 transition count 18744
Discarding 183 places :
Symmetric choice reduction at 1 with 183 rule applications. Total rules 194 place count 154 transition count 18561
Iterating global reduction 1 with 183 rules applied. Total rules applied 377 place count 154 transition count 18561
Ensure Unique test removed 773 transitions
Reduce isomorphic transitions removed 773 transitions.
Iterating post reduction 1 with 773 rules applied. Total rules applied 1150 place count 154 transition count 17788
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1168 place count 136 transition count 17770
Iterating global reduction 2 with 18 rules applied. Total rules applied 1186 place count 136 transition count 17770
Applied a total of 1186 rules in 858 ms. Remains 136 /348 variables (removed 212) and now considering 17770/18744 (removed 974) transitions.
// Phase 1: matrix 17770 rows 136 cols
[2024-06-07 10:32:05] [INFO ] Computed 0 invariants in 675 ms
[2024-06-07 10:32:06] [INFO ] Implicit Places using invariants in 1617 ms returned []
Implicit Place search using SMT only with invariants took 1674 ms to find 0 implicit places.
[2024-06-07 10:32:06] [INFO ] Invariant cache hit.
[2024-06-07 10:32:21] [INFO ] Dead Transitions using invariants and state equation in 15207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/348 places, 17770/18744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17765 ms. Remains : 136/348 places, 17770/18744 transitions.
Support contains 48 out of 136 places after structural reductions.
[2024-06-07 10:32:26] [INFO ] Flatten gal took : 3664 ms
[2024-06-07 10:32:29] [INFO ] Flatten gal took : 3131 ms
[2024-06-07 10:32:34] [INFO ] Input system was already deterministic with 17770 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1668 ms. (steps per millisecond=5 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 47708 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{1=1, 9=1, 11=1}
Probabilistic random walk after 47708 steps, saw 18241 distinct states, run finished after 3002 ms. (steps per millisecond=15 ) properties seen :3
Running SMT prover for 14 properties.
[2024-06-07 10:32:39] [INFO ] Invariant cache hit.
[2024-06-07 10:32:40] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-06-07 10:32:59] [INFO ] After 18551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-06-07 10:33:05] [INFO ] After 24860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-06-07 10:33:05] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 9 properties in 379 ms.
Support contains 35 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Graph (complete) has 1066 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.168 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 134 transition count 17729
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 68 place count 106 transition count 17729
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 124 place count 78 transition count 17701
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 140 place count 78 transition count 17685
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 768 transitions
Reduce isomorphic transitions removed 768 transitions.
Iterating post reduction 2 with 784 rules applied. Total rules applied 924 place count 62 transition count 16917
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 925 place count 62 transition count 16916
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 926 place count 61 transition count 16915
Applied a total of 926 rules in 15891 ms. Remains 61 /136 variables (removed 75) and now considering 16915/17770 (removed 855) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15893 ms. Remains : 61/136 places, 16915/17770 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3046 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 156559 steps, run timeout after 9001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 156559 steps, saw 26571 distinct states, run finished after 9003 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 16915 rows 61 cols
[2024-06-07 10:33:34] [INFO ] Computed 11 invariants in 132 ms
[2024-06-07 10:33:34] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-07 10:33:44] [INFO ] After 9815ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2024-06-07 10:33:49] [INFO ] After 14848ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:1
Attempting to minimize the solution found.
Minimization took 2445 ms.
[2024-06-07 10:33:52] [INFO ] After 17354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:1
[2024-06-07 10:33:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-07 10:34:02] [INFO ] After 9828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-07 10:34:07] [INFO ] After 15281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 3162 ms.
[2024-06-07 10:34:10] [INFO ] After 18558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 135 ms.
Support contains 15 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 16915/16915 transitions.
Graph (trivial) has 9 edges and 61 vertex of which 4 / 61 are part of one of the 2 SCC in 11 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 59 transition count 16910
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 58 transition count 16910
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 58 transition count 16906
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3072 transitions
Reduce isomorphic transitions removed 3072 transitions.
Iterating post reduction 0 with 3076 rules applied. Total rules applied 3083 place count 54 transition count 13834
Applied a total of 3083 rules in 52394 ms. Remains 54 /61 variables (removed 7) and now considering 13834/16915 (removed 3081) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52395 ms. Remains : 54/61 places, 13834/16915 transitions.
Computed a total of 46 stabilizing places and 57 stable transitions
Graph (complete) has 1066 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.650 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(p0) U p1)&&X(p1)))))'
Support contains 16 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Applied a total of 0 rules in 161 ms. Remains 136 /136 variables (removed 0) and now considering 17770/17770 (removed 0) transitions.
// Phase 1: matrix 17770 rows 136 cols
[2024-06-07 10:35:04] [INFO ] Computed 0 invariants in 358 ms
[2024-06-07 10:35:09] [INFO ] Implicit Places using invariants in 4560 ms returned []
Implicit Place search using SMT only with invariants took 4567 ms to find 0 implicit places.
[2024-06-07 10:35:09] [INFO ] Invariant cache hit.
[2024-06-07 10:35:20] [INFO ] Dead Transitions using invariants and state equation in 11090 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15828 ms. Remains : 136/136 places, 17770/17770 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 373 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResIsolation-PT-N08P3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(AND (EQ s24 1) (EQ s46 1) (EQ s66 1) (EQ s78 1) (EQ s86 1) (EQ s94 1) (EQ s102 1) (EQ s110 1) (EQ s118 1) (EQ s126 1) (EQ s134 1)), p0:(AND (EQ s24 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6303 ms.
Stack based approach found an accepted trace after 77 steps with 0 reset with depth 78 and stack size 78 in 3 ms.
FORMULA ResIsolation-PT-N08P3-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P3-LTLFireability-00 finished in 22667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&G(p1)))))'
Support contains 17 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Applied a total of 0 rules in 127 ms. Remains 136 /136 variables (removed 0) and now considering 17770/17770 (removed 0) transitions.
[2024-06-07 10:35:27] [INFO ] Invariant cache hit.
[2024-06-07 10:35:30] [INFO ] Implicit Places using invariants in 3911 ms returned []
Implicit Place search using SMT only with invariants took 3917 ms to find 0 implicit places.
[2024-06-07 10:35:30] [INFO ] Invariant cache hit.
[2024-06-07 10:35:42] [INFO ] Dead Transitions using invariants and state equation in 11265 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15313 ms. Remains : 136/136 places, 17770/17770 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s24 1) (EQ s46 1) (EQ s66 1) (EQ s78 1) (EQ s86 1) (EQ s94 1) (EQ s102 1) (EQ s110 1) (EQ s118 1) (EQ s126 1) (EQ s134 1)), p1:(AND (EQ s24 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6385 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 3 ms.
FORMULA ResIsolation-PT-N08P3-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P3-LTLFireability-01 finished in 21944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0||(!p1 U (G(!p1)||(!p1&&G(!p2)))))) U G(p3)))'
Support contains 28 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Graph (complete) has 1066 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.342 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 133 transition count 17751
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 117 transition count 17751
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 117 transition count 17740
Deduced a syphon composed of 11 places in 12 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 106 transition count 17740
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 6 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 89 place count 89 transition count 17723
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 86 transition count 17731
Applied a total of 95 rules in 5295 ms. Remains 86 /136 variables (removed 50) and now considering 17731/17770 (removed 39) transitions.
// Phase 1: matrix 17731 rows 86 cols
[2024-06-07 10:35:54] [INFO ] Computed 0 invariants in 532 ms
[2024-06-07 10:35:56] [INFO ] Implicit Places using invariants in 2560 ms returned []
Implicit Place search using SMT only with invariants took 2561 ms to find 0 implicit places.
[2024-06-07 10:35:56] [INFO ] Invariant cache hit.
[2024-06-07 10:36:08] [INFO ] Dead Transitions using invariants and state equation in 12176 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/136 places, 17731/17770 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20043 ms. Remains : 86/136 places, 17731/17770 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p3), (AND p0 p1), (AND p0 p2 p1)]
Running random walk in product with property : ResIsolation-PT-N08P3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={1} source=0 dest: 0}, { cond=(NOT p3), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p3:(AND (EQ s3 1) (EQ s25 1) (EQ s28 1) (EQ s40 1) (EQ s46 1) (EQ s55 1) (EQ s58 1) (EQ s64 1) (EQ s73 1) (EQ s76 1) (EQ s85 1)), p0:(OR (AND (EQ s13 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 9114 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA ResIsolation-PT-N08P3-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P3-LTLFireability-02 finished in 29430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))||(G((G(p2)||p1))&&F(p3))))'
Support contains 28 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Applied a total of 0 rules in 103 ms. Remains 136 /136 variables (removed 0) and now considering 17770/17770 (removed 0) transitions.
// Phase 1: matrix 17770 rows 136 cols
[2024-06-07 10:36:18] [INFO ] Computed 0 invariants in 278 ms
[2024-06-07 10:36:21] [INFO ] Implicit Places using invariants in 3047 ms returned []
Implicit Place search using SMT only with invariants took 3052 ms to find 0 implicit places.
[2024-06-07 10:36:21] [INFO ] Invariant cache hit.
[2024-06-07 10:36:30] [INFO ] Dead Transitions using invariants and state equation in 9275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12432 ms. Remains : 136/136 places, 17770/17770 transitions.
Stuttering acceptance computed with spot in 661 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p0)), (NOT p0), (NOT p0), true, (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3)]
Running random walk in product with property : ResIsolation-PT-N08P3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=p2, acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 8}, { cond=p1, acceptance={} source=3 dest: 9}], [{ cond=(NOT p3), acceptance={} source=4 dest: 10}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 11}, { cond=p1, acceptance={} source=9 dest: 12}], [{ cond=(NOT p3), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p2) p0), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=11 dest: 7}, { cond=(AND p2 p0), acceptance={} source=11 dest: 11}, { cond=(AND p2 (NOT p0)), acceptance={} source=11 dest: 14}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=12 dest: 11}, { cond=(AND p1 p0), acceptance={} source=12 dest: 12}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=12 dest: 14}, { cond=(AND p1 (NOT p0)), acceptance={} source=12 dest: 15}], [{ cond=(AND (NOT p3) p0), acceptance={} source=13 dest: 13}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=13 dest: 16}], [{ cond=(NOT p2), acceptance={} source=14 dest: 7}, { cond=p2, acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=15 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=15 dest: 14}, { cond=p1, acceptance={} source=15 dest: 15}], [{ cond=(NOT p3), acceptance={0} source=16 dest: 16}]], initial=0, aps=[p1:(OR (EQ s21 0) (EQ s43 0) (EQ s66 0) (EQ s77 0) (EQ s86 0) (EQ s94 0) (EQ s102 0) (EQ s109 0) (EQ s117 0) (EQ s125 0) (EQ s133 0)), p2:(OR (EQ s24 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6462 ms.
Product exploration explored 100000 steps with 0 reset in 6162 ms.
Computed a total of 46 stabilizing places and 57 stable transitions
Graph (complete) has 1066 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.229 ms
Computed a total of 46 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p3) (NOT p0)), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p3)), (X p1), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 129 ms. Reduced automaton from 17 states, 39 edges and 4 AP (stutter sensitive) to 11 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 481 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), true, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1180 ms. (steps per millisecond=8 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 39329 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{2=1, 4=1, 13=1}
Probabilistic random walk after 39329 steps, saw 18162 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :3
Running SMT prover for 15 properties.
[2024-06-07 10:36:49] [INFO ] Invariant cache hit.
[2024-06-07 10:36:50] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-06-07 10:37:04] [INFO ] After 14600ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :10
[2024-06-07 10:37:14] [INFO ] After 24679ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :10
Attempting to minimize the solution found.
Minimization took 183 ms.
[2024-06-07 10:37:15] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :10
Fused 15 Parikh solutions to 4 different solutions.
Finished Parikh walk after 77 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=7 )
Parikh walk visited 6 properties in 82 ms.
Support contains 28 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Graph (complete) has 1066 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.141 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 134 transition count 17728
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 70 place count 105 transition count 17728
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 126 place count 77 transition count 17700
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 142 place count 77 transition count 17684
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2048 transitions
Reduce isomorphic transitions removed 2048 transitions.
Iterating post reduction 2 with 2064 rules applied. Total rules applied 2206 place count 61 transition count 15636
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2207 place count 61 transition count 15635
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2208 place count 60 transition count 15634
Applied a total of 2208 rules in 13566 ms. Remains 60 /136 variables (removed 76) and now considering 15634/17770 (removed 2136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13567 ms. Remains : 60/136 places, 15634/17770 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2636 ms. (steps per millisecond=3 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 136015 steps, run timeout after 9001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 136015 steps, saw 23110 distinct states, run finished after 9001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 15634 rows 60 cols
[2024-06-07 10:37:41] [INFO ] Computed 11 invariants in 119 ms
[2024-06-07 10:37:41] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-07 10:37:49] [INFO ] After 7847ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-06-07 10:37:50] [INFO ] After 8843ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 638 ms.
[2024-06-07 10:37:50] [INFO ] After 9536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2024-06-07 10:37:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-07 10:38:00] [INFO ] After 9219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-07 10:38:04] [INFO ] After 13267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2298 ms.
[2024-06-07 10:38:06] [INFO ] After 15646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 88 ms.
Support contains 11 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 15634/15634 transitions.
Graph (trivial) has 13 edges and 60 vertex of which 8 / 60 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 56 transition count 15623
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 53 transition count 15623
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 53 transition count 15621
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1536 transitions
Reduce isomorphic transitions removed 1536 transitions.
Iterating post reduction 0 with 1538 rules applied. Total rules applied 1547 place count 51 transition count 14085
Applied a total of 1547 rules in 72249 ms. Remains 51 /60 variables (removed 9) and now considering 14085/15634 (removed 1549) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72250 ms. Remains : 51/60 places, 14085/15634 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p3) (NOT p0)), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p3)), (X p1), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X p1)), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p1 p0)), (F (AND (NOT p1) p2 p0)), (F (AND (NOT p1) p2 (NOT p0))), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p1) p2)), (F (AND p2 p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (AND (NOT p3) (NOT p0)))), (F p0), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT p1)), (F (AND (NOT p3) p0)), (F (NOT (AND p1 (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p2) (NOT p0)))
Knowledge based reduction with 13 factoid took 577 ms. Reduced automaton from 11 states, 25 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P3-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P3-LTLFireability-04 finished in 181081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F((G(!p0)||(!p0&&F(!p1)))))||(!p2&&F((G(!p0)||(!p0&&F(!p1)))))))))'
Support contains 22 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Applied a total of 0 rules in 181 ms. Remains 136 /136 variables (removed 0) and now considering 17770/17770 (removed 0) transitions.
// Phase 1: matrix 17770 rows 136 cols
[2024-06-07 10:39:19] [INFO ] Computed 0 invariants in 406 ms
[2024-06-07 10:39:23] [INFO ] Implicit Places using invariants in 3982 ms returned []
Implicit Place search using SMT only with invariants took 3986 ms to find 0 implicit places.
[2024-06-07 10:39:23] [INFO ] Invariant cache hit.
[2024-06-07 10:39:34] [INFO ] Dead Transitions using invariants and state equation in 11420 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15589 ms. Remains : 136/136 places, 17770/17770 transitions.
Stuttering acceptance computed with spot in 267 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
Running random walk in product with property : ResIsolation-PT-N08P3-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0 p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p2:(AND (EQ s21 1) (EQ s46 1) (EQ s63 1) (EQ s77 1) (EQ s86 1) (EQ s94 1) (EQ s102 1) (EQ s109 1) (EQ s117 1) (EQ s125 1) (EQ s134 1)), p0:(AND (EQ s24 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1541 ms.
Product exploration explored 100000 steps with 50000 reset in 1159 ms.
Computed a total of 46 stabilizing places and 57 stable transitions
Graph (complete) has 1066 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.222 ms
Computed a total of 46 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 20 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P3-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P3-LTLFireability-05 finished in 19001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(p0)) U (!p0 U p1)))))'
Support contains 18 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Applied a total of 0 rules in 195 ms. Remains 136 /136 variables (removed 0) and now considering 17770/17770 (removed 0) transitions.
[2024-06-07 10:39:38] [INFO ] Invariant cache hit.
[2024-06-07 10:39:42] [INFO ] Implicit Places using invariants in 3950 ms returned []
Implicit Place search using SMT only with invariants took 3952 ms to find 0 implicit places.
[2024-06-07 10:39:42] [INFO ] Invariant cache hit.
[2024-06-07 10:39:51] [INFO ] Dead Transitions using invariants and state equation in 9223 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13373 ms. Remains : 136/136 places, 17770/17770 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s24 1) (EQ s46 1) (EQ s64 1) (EQ s77 1) (EQ s85 1) (EQ s93 1) (EQ s101 1) (EQ s110 1) (EQ s118 1) (EQ s125 1) (EQ s133 1)), p0:(AND (EQ s24 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6124 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 1 ms.
FORMULA ResIsolation-PT-N08P3-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P3-LTLFireability-07 finished in 19740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Applied a total of 0 rules in 140 ms. Remains 136 /136 variables (removed 0) and now considering 17770/17770 (removed 0) transitions.
[2024-06-07 10:39:58] [INFO ] Invariant cache hit.
[2024-06-07 10:40:02] [INFO ] Implicit Places using invariants in 4726 ms returned []
Implicit Place search using SMT only with invariants took 4733 ms to find 0 implicit places.
[2024-06-07 10:40:02] [INFO ] Invariant cache hit.
[2024-06-07 10:40:12] [INFO ] Dead Transitions using invariants and state equation in 9196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14075 ms. Remains : 136/136 places, 17770/17770 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Running random walk in product with property : ResIsolation-PT-N08P3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s24 1) (EQ s46 1) (EQ s66 1) (EQ s78 1) (EQ s86 1) (EQ s94 1) (EQ s102 1) (EQ s110 1) (EQ s118 1) (EQ s126 1) (EQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6285 ms.
Product exploration explored 100000 steps with 0 reset in 5844 ms.
Computed a total of 46 stabilizing places and 57 stable transitions
Graph (complete) has 1066 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.220 ms
Computed a total of 46 stabilizing places and 57 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1006 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8045 steps, run visited all 1 properties in 569 ms. (steps per millisecond=14 )
Probabilistic random walk after 8045 steps, saw 5118 distinct states, run finished after 575 ms. (steps per millisecond=13 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P3-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P3-LTLFireability-09 finished in 28704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Applied a total of 0 rules in 173 ms. Remains 136 /136 variables (removed 0) and now considering 17770/17770 (removed 0) transitions.
[2024-06-07 10:40:26] [INFO ] Invariant cache hit.
[2024-06-07 10:40:32] [INFO ] Implicit Places using invariants in 5544 ms returned []
Implicit Place search using SMT only with invariants took 5546 ms to find 0 implicit places.
[2024-06-07 10:40:32] [INFO ] Invariant cache hit.
[2024-06-07 10:40:43] [INFO ] Dead Transitions using invariants and state equation in 10778 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16504 ms. Remains : 136/136 places, 17770/17770 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P3-LTLFireability-11 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 (EQ s24 1) (EQ s39 1) (EQ s59 1) (EQ s78 1) (EQ s84 1) (EQ s92 1) (EQ s102 1) (EQ s110 1) (EQ s118 1) (EQ s126 1) (EQ s132 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 0 reset in 6310 ms.
Stack based approach found an accepted trace after 90 steps with 0 reset with depth 91 and stack size 91 in 4 ms.
FORMULA ResIsolation-PT-N08P3-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P3-LTLFireability-11 finished in 22985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Graph (trivial) has 85 edges and 136 vertex of which 6 / 136 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1060 edges and 132 vertex of which 130 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.126 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 129 transition count 17742
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 44 place count 108 transition count 17742
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 44 place count 108 transition count 17730
Deduced a syphon composed of 12 places in 20 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 96 transition count 17730
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 98 place count 81 transition count 17715
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 78 transition count 17723
Applied a total of 104 rules in 37029 ms. Remains 78 /136 variables (removed 58) and now considering 17723/17770 (removed 47) transitions.
[2024-06-07 10:41:26] [INFO ] Flow matrix only has 17722 transitions (discarded 1 similar events)
// Phase 1: matrix 17722 rows 78 cols
[2024-06-07 10:41:27] [INFO ] Computed 0 invariants in 556 ms
[2024-06-07 10:41:32] [INFO ] Implicit Places using invariants in 5266 ms returned []
Implicit Place search using SMT only with invariants took 5274 ms to find 0 implicit places.
[2024-06-07 10:41:32] [INFO ] Flow matrix only has 17722 transitions (discarded 1 similar events)
[2024-06-07 10:41:32] [INFO ] Invariant cache hit.
[2024-06-07 10:41:41] [INFO ] Dead Transitions using invariants and state equation in 9437 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/136 places, 17723/17770 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51743 ms. Remains : 78/136 places, 17723/17770 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s22 1) (EQ s30 1) (EQ s37 1) (EQ s43 1) (EQ s48 1) (EQ s54 1) (EQ s59 1) (EQ s65 1) (EQ s71 1) (EQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 2 ms.
FORMULA ResIsolation-PT-N08P3-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P3-LTLFireability-12 finished in 51842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Applied a total of 0 rules in 147 ms. Remains 136 /136 variables (removed 0) and now considering 17770/17770 (removed 0) transitions.
// Phase 1: matrix 17770 rows 136 cols
[2024-06-07 10:41:42] [INFO ] Computed 0 invariants in 375 ms
[2024-06-07 10:41:47] [INFO ] Implicit Places using invariants in 5297 ms returned []
Implicit Place search using SMT only with invariants took 5299 ms to find 0 implicit places.
[2024-06-07 10:41:47] [INFO ] Invariant cache hit.
[2024-06-07 10:42:00] [INFO ] Dead Transitions using invariants and state equation in 13027 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18481 ms. Remains : 136/136 places, 17770/17770 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, p0, p0]
Running random walk in product with property : ResIsolation-PT-N08P3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s24 1) (EQ s46 1) (EQ s66 1) (EQ s78 1) (EQ s86 1) (EQ s94 1) (EQ s102 1) (EQ s110 1) (EQ s118 1) (EQ s126 1) (EQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6472 ms.
Product exploration explored 100000 steps with 0 reset in 6026 ms.
Computed a total of 46 stabilizing places and 57 stable transitions
Graph (complete) has 1066 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.227 ms
Computed a total of 46 stabilizing places and 57 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 896 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8045 steps, run visited all 1 properties in 721 ms. (steps per millisecond=11 )
Probabilistic random walk after 8045 steps, saw 5118 distinct states, run finished after 721 ms. (steps per millisecond=11 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P3-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P3-LTLFireability-13 finished in 33540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&F(p1)))||G(p2))))'
Support contains 17 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Applied a total of 0 rules in 138 ms. Remains 136 /136 variables (removed 0) and now considering 17770/17770 (removed 0) transitions.
[2024-06-07 10:42:15] [INFO ] Invariant cache hit.
[2024-06-07 10:42:19] [INFO ] Implicit Places using invariants in 4165 ms returned []
Implicit Place search using SMT only with invariants took 4166 ms to find 0 implicit places.
[2024-06-07 10:42:19] [INFO ] Invariant cache hit.
[2024-06-07 10:42:30] [INFO ] Dead Transitions using invariants and state equation in 11374 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15680 ms. Remains : 136/136 places, 17770/17770 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ResIsolation-PT-N08P3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=3, aps=[p1:(AND (EQ s24 1) (EQ s46 1) (EQ s66 1) (EQ s78 1) (EQ s86 1) (EQ s94 1) (EQ s102 1) (EQ s110 1) (EQ s118 1) (EQ s126 1) (EQ s134 1)), p0:(OR (EQ s24 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, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5852 ms.
Product exploration explored 100000 steps with 0 reset in 5706 ms.
Computed a total of 46 stabilizing places and 57 stable transitions
Graph (complete) has 1066 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.221 ms
Computed a total of 46 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 110 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 949 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 46619 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 46619 steps, saw 18237 distinct states, run finished after 3003 ms. (steps per millisecond=15 ) properties seen :2
Running SMT prover for 1 properties.
[2024-06-07 10:42:47] [INFO ] Invariant cache hit.
[2024-06-07 10:42:56] [INFO ] After 8522ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 10:42:57] [INFO ] After 9830ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 760 ms.
[2024-06-07 10:42:58] [INFO ] After 10636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 75 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 8 factoid took 202 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 17 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Applied a total of 0 rules in 209 ms. Remains 136 /136 variables (removed 0) and now considering 17770/17770 (removed 0) transitions.
[2024-06-07 10:42:59] [INFO ] Invariant cache hit.
[2024-06-07 10:43:03] [INFO ] Implicit Places using invariants in 4084 ms returned []
Implicit Place search using SMT only with invariants took 4086 ms to find 0 implicit places.
[2024-06-07 10:43:03] [INFO ] Invariant cache hit.
[2024-06-07 10:43:12] [INFO ] Dead Transitions using invariants and state equation in 8694 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12990 ms. Remains : 136/136 places, 17770/17770 transitions.
Computed a total of 46 stabilizing places and 57 stable transitions
Graph (complete) has 1066 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.222 ms
Computed a total of 46 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 952 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 45602 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 45602 steps, saw 18227 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :2
Running SMT prover for 1 properties.
[2024-06-07 10:43:17] [INFO ] Invariant cache hit.
[2024-06-07 10:43:25] [INFO ] After 8068ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 10:43:26] [INFO ] After 9038ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 679 ms.
[2024-06-07 10:43:27] [INFO ] After 9755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 75 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND (NOT p1) p2), true]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 6095 ms.
Product exploration explored 100000 steps with 0 reset in 6015 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 17 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Graph (complete) has 1066 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.144 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 134 transition count 17768
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 20 place count 134 transition count 17779
Deduced a syphon composed of 30 places in 17 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 31 place count 134 transition count 17779
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 41 place count 124 transition count 17769
Deduced a syphon composed of 20 places in 12 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 51 place count 124 transition count 17769
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 38 places in 4 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 69 place count 124 transition count 17770
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 123 transition count 17768
Deduced a syphon composed of 37 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 123 transition count 17768
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 40 places in 4 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 123 transition count 17805
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 120 transition count 17799
Deduced a syphon composed of 37 places in 4 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 120 transition count 17799
Deduced a syphon composed of 37 places in 4 ms
Applied a total of 80 rules in 5797 ms. Remains 120 /136 variables (removed 16) and now considering 17799/17770 (removed -29) transitions.
// Phase 1: matrix 17799 rows 120 cols
[2024-06-07 10:43:46] [INFO ] Computed 0 invariants in 273 ms
[2024-06-07 10:43:55] [INFO ] Dead Transitions using invariants and state equation in 9051 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/136 places, 17799/17770 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14850 ms. Remains : 120/136 places, 17799/17770 transitions.
Built C files in :
/tmp/ltsmin14718577553414994476
[2024-06-07 10:43:56] [INFO ] Built C files in 704ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14718577553414994476
Running compilation step : cd /tmp/ltsmin14718577553414994476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14718577553414994476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14718577553414994476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 17 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Applied a total of 0 rules in 130 ms. Remains 136 /136 variables (removed 0) and now considering 17770/17770 (removed 0) transitions.
// Phase 1: matrix 17770 rows 136 cols
[2024-06-07 10:43:59] [INFO ] Computed 0 invariants in 239 ms
[2024-06-07 10:44:03] [INFO ] Implicit Places using invariants in 4117 ms returned []
Implicit Place search using SMT only with invariants took 4118 ms to find 0 implicit places.
[2024-06-07 10:44:03] [INFO ] Invariant cache hit.
[2024-06-07 10:44:14] [INFO ] Dead Transitions using invariants and state equation in 10854 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15103 ms. Remains : 136/136 places, 17770/17770 transitions.
Built C files in :
/tmp/ltsmin15816184910361167237
[2024-06-07 10:44:14] [INFO ] Built C files in 424ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15816184910361167237
Running compilation step : cd /tmp/ltsmin15816184910361167237;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15816184910361167237;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15816184910361167237;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-06-07 10:44:24] [INFO ] Flatten gal took : 3902 ms
[2024-06-07 10:44:27] [INFO ] Flatten gal took : 3135 ms
[2024-06-07 10:44:28] [INFO ] Time to serialize gal into /tmp/LTL14597860995421274990.gal : 397 ms
[2024-06-07 10:44:28] [INFO ] Time to serialize properties into /tmp/LTL14245140531851743115.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14597860995421274990.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7942985526978967773.hoa' '-atoms' '/tmp/LTL14245140531851743115.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14245140531851743115.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7942985526978967773.hoa
Detected timeout of ITS tools.
[2024-06-07 10:44:49] [INFO ] Flatten gal took : 3365 ms
[2024-06-07 10:44:52] [INFO ] Flatten gal took : 3038 ms
[2024-06-07 10:44:52] [INFO ] Time to serialize gal into /tmp/LTL16149183125335732798.gal : 403 ms
[2024-06-07 10:44:52] [INFO ] Time to serialize properties into /tmp/LTL2807821707961838618.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16149183125335732798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2807821707961838618.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(("(((((p38==0)||(p76==0))||((p114==0)||(p145==0)))||(((p173==0)||(p201==0))||((p229==0)||(p257==0))))||(((p285==0)||(p313==0))...467
Formula 0 simplified : X(X(!"(((((p38==0)||(p76==0))||((p114==0)||(p145==0)))||(((p173==0)||(p201==0))||((p229==0)||(p257==0))))||(((p285==0)||(p313==0))||...457
Detected timeout of ITS tools.
[2024-06-07 10:45:11] [INFO ] Flatten gal took : 3163 ms
[2024-06-07 10:45:11] [INFO ] Applying decomposition
[2024-06-07 10:45:14] [INFO ] Flatten gal took : 3080 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16037131659604122313.txt' '-o' '/tmp/graph16037131659604122313.bin' '-w' '/tmp/graph16037131659604122313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16037131659604122313.bin' '-l' '-1' '-v' '-w' '/tmp/graph16037131659604122313.weights' '-q' '0' '-e' '0.001'
[2024-06-07 10:45:23] [INFO ] Decomposing Gal with order
[2024-06-07 10:45:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 10:45:32] [INFO ] Removed a total of 204583 redundant transitions.
[2024-06-07 10:45:32] [INFO ] Flatten gal took : 6903 ms
[2024-06-07 10:45:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 2099 ms.
[2024-06-07 10:45:36] [INFO ] Time to serialize gal into /tmp/LTL5633301723531283381.gal : 169 ms
[2024-06-07 10:45:36] [INFO ] Time to serialize properties into /tmp/LTL14961367162088349660.ltl : 2 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5633301723531283381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14961367162088349660.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((X(("(((((i1.u6.p38==0)||(i2.i0.u26.p76==0))||((i2.i0.u29.p114==0)||(i2.i0.u20.p145==0)))||(((i1.u21.p173==0)||(i2.i1.u23.p201==0...767
Formula 0 simplified : X(X(!"(((((i1.u6.p38==0)||(i2.i0.u26.p76==0))||((i2.i0.u29.p114==0)||(i2.i0.u20.p145==0)))||(((i1.u21.p173==0)||(i2.i1.u23.p201==0))...757
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14223119108084752819
[2024-06-07 10:45:51] [INFO ] Built C files in 406ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14223119108084752819
Running compilation step : cd /tmp/ltsmin14223119108084752819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14223119108084752819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14223119108084752819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 ResIsolation-PT-N08P3-LTLFireability-14 finished in 219398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 17770/17770 transitions.
Graph (complete) has 1066 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.140 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 133 transition count 17746
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 112 transition count 17746
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 43 place count 112 transition count 17735
Deduced a syphon composed of 11 places in 18 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 65 place count 101 transition count 17735
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 99 place count 84 transition count 17718
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 105 place count 81 transition count 17726
Applied a total of 105 rules in 5200 ms. Remains 81 /136 variables (removed 55) and now considering 17726/17770 (removed 44) transitions.
// Phase 1: matrix 17726 rows 81 cols
[2024-06-07 10:46:00] [INFO ] Computed 0 invariants in 380 ms
[2024-06-07 10:46:03] [INFO ] Implicit Places using invariants in 4110 ms returned []
Implicit Place search using SMT only with invariants took 4115 ms to find 0 implicit places.
[2024-06-07 10:46:03] [INFO ] Invariant cache hit.
[2024-06-07 10:46:12] [INFO ] Dead Transitions using invariants and state equation in 9025 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/136 places, 17726/17770 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18342 ms. Remains : 81/136 places, 17726/17770 transitions.
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Running random walk in product with property : ResIsolation-PT-N08P3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s22 1) (EQ s33 1) (EQ s38 1) (EQ s44 1) (EQ s50 1) (EQ s56 1) (EQ s62 1) (EQ s68 1) (EQ s74 1) (EQ s80 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]]
Product exploration explored 100000 steps with 0 reset in 8808 ms.
Product exploration explored 100000 steps with 0 reset in 8626 ms.
Computed a total of 8 stabilizing places and 30 stable transitions
Computed a total of 8 stabilizing places and 30 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1050 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Finished probabilistic random walk after 893 steps, run visited all 1 properties in 89 ms. (steps per millisecond=10 )
Probabilistic random walk after 893 steps, saw 391 distinct states, run finished after 90 ms. (steps per millisecond=9 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Support contains 11 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 17726/17726 transitions.
Applied a total of 0 rules in 4274 ms. Remains 81 /81 variables (removed 0) and now considering 17726/17726 (removed 0) transitions.
[2024-06-07 10:46:36] [INFO ] Invariant cache hit.
[2024-06-07 10:46:41] [INFO ] Implicit Places using invariants in 4242 ms returned []
Implicit Place search using SMT only with invariants took 4244 ms to find 0 implicit places.
[2024-06-07 10:46:41] [INFO ] Invariant cache hit.
[2024-06-07 10:46:51] [INFO ] Dead Transitions using invariants and state equation in 10894 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19417 ms. Remains : 81/81 places, 17726/17726 transitions.
Computed a total of 8 stabilizing places and 30 stable transitions
Computed a total of 8 stabilizing places and 30 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1227 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Finished probabilistic random walk after 893 steps, run visited all 1 properties in 68 ms. (steps per millisecond=13 )
Probabilistic random walk after 893 steps, saw 391 distinct states, run finished after 70 ms. (steps per millisecond=12 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[p0, p0]
Stuttering acceptance computed with spot in 100 ms :[p0, p0]
Stuttering acceptance computed with spot in 99 ms :[p0, p0]
Product exploration explored 100000 steps with 0 reset in 9071 ms.
Product exploration explored 100000 steps with 0 reset in 8710 ms.
Built C files in :
/tmp/ltsmin17465555431902665107
[2024-06-07 10:47:12] [INFO ] Too many transitions (17726) to apply POR reductions. Disabling POR matrices.
[2024-06-07 10:47:12] [INFO ] Built C files in 378ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17465555431902665107
Running compilation step : cd /tmp/ltsmin17465555431902665107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17465555431902665107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17465555431902665107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 11 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 17726/17726 transitions.
Applied a total of 0 rules in 3919 ms. Remains 81 /81 variables (removed 0) and now considering 17726/17726 (removed 0) transitions.
[2024-06-07 10:47:19] [INFO ] Invariant cache hit.
[2024-06-07 10:47:23] [INFO ] Implicit Places using invariants in 4276 ms returned []
Implicit Place search using SMT only with invariants took 4284 ms to find 0 implicit places.
[2024-06-07 10:47:24] [INFO ] Invariant cache hit.
[2024-06-07 10:47:36] [INFO ] Dead Transitions using invariants and state equation in 13007 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21216 ms. Remains : 81/81 places, 17726/17726 transitions.
Built C files in :
/tmp/ltsmin6386979486164210888
[2024-06-07 10:47:37] [INFO ] Too many transitions (17726) to apply POR reductions. Disabling POR matrices.
[2024-06-07 10:47:37] [INFO ] Built C files in 378ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6386979486164210888
Running compilation step : cd /tmp/ltsmin6386979486164210888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6386979486164210888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6386979486164210888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-06-07 10:47:46] [INFO ] Flatten gal took : 3431 ms
[2024-06-07 10:47:49] [INFO ] Flatten gal took : 3126 ms
[2024-06-07 10:47:49] [INFO ] Time to serialize gal into /tmp/LTL18085778107608038220.gal : 333 ms
[2024-06-07 10:47:49] [INFO ] Time to serialize properties into /tmp/LTL4021944342653903827.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18085778107608038220.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4645241615213708295.hoa' '-atoms' '/tmp/LTL4021944342653903827.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4021944342653903827.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4645241615213708295.hoa
Detected timeout of ITS tools.
[2024-06-07 10:48:10] [INFO ] Flatten gal took : 3365 ms
[2024-06-07 10:48:13] [INFO ] Flatten gal took : 3383 ms
[2024-06-07 10:48:14] [INFO ] Time to serialize gal into /tmp/LTL1226942234749640521.gal : 348 ms
[2024-06-07 10:48:14] [INFO ] Time to serialize properties into /tmp/LTL12905738420708580685.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1226942234749640521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12905738420708580685.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((p38!=1)||(p76!=1))||((p114!=1)||(p145!=1)))||(((p173!=1)||(p201!=1))||((p229!=1)||(p257!=1))))||(((p285!=1)||(p313!=1))||...171
Formula 0 simplified : FG!"(((((p38!=1)||(p76!=1))||((p114!=1)||(p145!=1)))||(((p173!=1)||(p201!=1))||((p229!=1)||(p257!=1))))||(((p285!=1)||(p313!=1))||(p...165
Detected timeout of ITS tools.
[2024-06-07 10:48:33] [INFO ] Flatten gal took : 3628 ms
[2024-06-07 10:48:33] [INFO ] Applying decomposition
[2024-06-07 10:48:36] [INFO ] Flatten gal took : 2971 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10922312725970762343.txt' '-o' '/tmp/graph10922312725970762343.bin' '-w' '/tmp/graph10922312725970762343.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10922312725970762343.bin' '-l' '-1' '-v' '-w' '/tmp/graph10922312725970762343.weights' '-q' '0' '-e' '0.001'
[2024-06-07 10:48:44] [INFO ] Decomposing Gal with order
[2024-06-07 10:48:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 10:48:51] [INFO ] Removed a total of 202562 redundant transitions.
[2024-06-07 10:48:52] [INFO ] Flatten gal took : 5764 ms
[2024-06-07 10:48:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 1728 ms.
[2024-06-07 10:48:54] [INFO ] Time to serialize gal into /tmp/LTL18188718057782285599.gal : 91 ms
[2024-06-07 10:48:54] [INFO ] Time to serialize properties into /tmp/LTL3745166621216937753.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18188718057782285599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3745166621216937753.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((i1.u1.p38!=1)||(i1.u3.p76!=1))||((i1.u4.p114!=1)||(i2.u5.p145!=1)))||(((i2.u6.p173!=1)||(i1.u10.p201!=1))||((i1.u7.p229!=...234
Formula 0 simplified : FG!"(((((i1.u1.p38!=1)||(i1.u3.p76!=1))||((i1.u4.p114!=1)||(i2.u5.p145!=1)))||(((i2.u6.p173!=1)||(i1.u10.p201!=1))||((i1.u7.p229!=1)...228
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3946976338352219733
[2024-06-07 10:49:10] [INFO ] Built C files in 349ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3946976338352219733
Running compilation step : cd /tmp/ltsmin3946976338352219733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3946976338352219733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3946976338352219733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 ResIsolation-PT-N08P3-LTLFireability-15 finished in 198782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&F(p1)))||G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
[2024-06-07 10:49:16] [INFO ] Flatten gal took : 2938 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14536523195686722588
[2024-06-07 10:49:18] [INFO ] Too many transitions (17770) to apply POR reductions. Disabling POR matrices.
[2024-06-07 10:49:19] [INFO ] Built C files in 781ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14536523195686722588
Running compilation step : cd /tmp/ltsmin14536523195686722588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-06-07 10:49:20] [INFO ] Applying decomposition
[2024-06-07 10:49:24] [INFO ] Flatten gal took : 3349 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11885646348403869792.txt' '-o' '/tmp/graph11885646348403869792.bin' '-w' '/tmp/graph11885646348403869792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11885646348403869792.bin' '-l' '-1' '-v' '-w' '/tmp/graph11885646348403869792.weights' '-q' '0' '-e' '0.001'
[2024-06-07 10:49:33] [INFO ] Decomposing Gal with order
[2024-06-07 10:49:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 10:49:40] [INFO ] Removed a total of 198177 redundant transitions.
[2024-06-07 10:49:40] [INFO ] Flatten gal took : 5258 ms
[2024-06-07 10:49:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 479 ms.
[2024-06-07 10:49:42] [INFO ] Time to serialize gal into /tmp/LTLFireability10551460328488841545.gal : 139 ms
[2024-06-07 10:49:42] [INFO ] Time to serialize properties into /tmp/LTLFireability16443630197182269863.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10551460328488841545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16443630197182269863.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X((X(("(((((i4.u26.p38==0)||(i4.u14.p76==0))||((i4.u20.p114==0)||(i4.u23.p145==0)))||(((i4.u32.p173==0)||(i3.u21.p201==0))||((i4.u2...691
Formula 0 simplified : X(X(!"(((((i4.u26.p38==0)||(i4.u14.p76==0))||((i4.u20.p114==0)||(i4.u23.p145==0)))||(((i4.u32.p173==0)||(i3.u21.p201==0))||((i4.u27....681

BK_STOP 1717757519672

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="ResIsolation-PT-N08P3"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ResIsolation-PT-N08P3, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r649-smll-171774451500013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResIsolation-PT-N08P3.tgz
mv ResIsolation-PT-N08P3 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;