About the Execution of 2023-gold for ResIsolation-PT-N08P1
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1828.355 | 404815.00 | 503885.00 | 1834.40 | FFFFFFFFFFFTFFFF | normal |
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-171774451400003.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-N08P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r649-smll-171774451400003
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 5.5K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K 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 41K 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 22K 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 8.8K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K 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 4.1M 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-N08P1-LTLFireability-00
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-01
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-02
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-03
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-04
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-05
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-06
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-07
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-08
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-09
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-10
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-11
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-12
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-13
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-14
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717747600871
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-N08P1
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-07 08:06:43] [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 08:06:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 08:06:44] [INFO ] Load time of PNML (sax parser for PT used): 729 ms
[2024-06-07 08:06:44] [INFO ] Transformed 270 places.
[2024-06-07 08:06:44] [INFO ] Transformed 4850 transitions.
[2024-06-07 08:06:44] [INFO ] Found NUPN structural information;
[2024-06-07 08:06:44] [INFO ] Parsed PT model containing 270 places and 4850 transitions and 83436 arcs in 913 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ResIsolation-PT-N08P1-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 4850/4850 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 261 transition count 4850
Discarding 151 places :
Symmetric choice reduction at 1 with 151 rule applications. Total rules 160 place count 110 transition count 4699
Iterating global reduction 1 with 151 rules applied. Total rules applied 311 place count 110 transition count 4699
Ensure Unique test removed 773 transitions
Reduce isomorphic transitions removed 773 transitions.
Iterating post reduction 1 with 773 rules applied. Total rules applied 1084 place count 110 transition count 3926
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1100 place count 94 transition count 3910
Iterating global reduction 2 with 16 rules applied. Total rules applied 1116 place count 94 transition count 3910
Applied a total of 1116 rules in 185 ms. Remains 94 /270 variables (removed 176) and now considering 3910/4850 (removed 940) transitions.
// Phase 1: matrix 3910 rows 94 cols
[2024-06-07 08:06:45] [INFO ] Computed 0 invariants in 140 ms
[2024-06-07 08:06:45] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-06-07 08:06:45] [INFO ] Invariant cache hit.
[2024-06-07 08:06:46] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1425 ms to find 0 implicit places.
[2024-06-07 08:06:46] [INFO ] Invariant cache hit.
[2024-06-07 08:06:48] [INFO ] Dead Transitions using invariants and state equation in 2147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/270 places, 3910/4850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3769 ms. Remains : 94/270 places, 3910/4850 transitions.
Support contains 39 out of 94 places after structural reductions.
[2024-06-07 08:06:50] [INFO ] Flatten gal took : 1199 ms
[2024-06-07 08:06:50] [INFO ] Flatten gal took : 650 ms
[2024-06-07 08:06:52] [INFO ] Input system was already deterministic with 3910 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 964 ms. (steps per millisecond=10 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 173295 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{1=1, 22=1}
Probabilistic random walk after 173295 steps, saw 29442 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :2
Running SMT prover for 24 properties.
[2024-06-07 08:06:56] [INFO ] Invariant cache hit.
[2024-06-07 08:06:59] [INFO ] After 1746ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:23
[2024-06-07 08:07:03] [INFO ] After 3758ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :21
[2024-06-07 08:07:08] [INFO ] After 8675ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :21
Attempting to minimize the solution found.
Minimization took 2589 ms.
[2024-06-07 08:07:10] [INFO ] After 11572ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :21
Fused 24 Parikh solutions to 20 different solutions.
Parikh walk visited 14 properties in 183 ms.
Support contains 30 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.57 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 92 transition count 3884
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 40 place count 77 transition count 3884
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 76 transition count 3628
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 76 transition count 3628
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 76 transition count 3627
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 43 place count 76 transition count 3626
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 75 transition count 3626
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 93 place count 51 transition count 3602
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 51 transition count 3601
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 51 transition count 3599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 49 transition count 3599
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 99 place count 48 transition count 3598
Applied a total of 99 rules in 1520 ms. Remains 48 /94 variables (removed 46) and now considering 3598/3910 (removed 312) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1526 ms. Remains : 48/94 places, 3598/3910 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 792 ms. (steps per millisecond=12 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 234714 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{0=1, 1=1, 3=1, 5=1}
Probabilistic random walk after 234714 steps, saw 36476 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :4
Running SMT prover for 3 properties.
// Phase 1: matrix 3598 rows 48 cols
[2024-06-07 08:07:16] [INFO ] Computed 9 invariants in 36 ms
[2024-06-07 08:07:17] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-07 08:07:18] [INFO ] After 1604ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-06-07 08:07:19] [INFO ] After 2083ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 275 ms.
[2024-06-07 08:07:19] [INFO ] After 2414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=5 )
Parikh walk visited 3 properties in 15 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA ResIsolation-PT-N08P1-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.111 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))&&((!p1||G(p1)) U X(p2))))'
Support contains 20 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 3654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 3654
Applied a total of 2 rules in 61 ms. Remains 93 /94 variables (removed 1) and now considering 3654/3910 (removed 256) transitions.
// Phase 1: matrix 3654 rows 93 cols
[2024-06-07 08:07:20] [INFO ] Computed 0 invariants in 53 ms
[2024-06-07 08:07:20] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-06-07 08:07:20] [INFO ] Invariant cache hit.
[2024-06-07 08:07:21] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
[2024-06-07 08:07:21] [INFO ] Invariant cache hit.
[2024-06-07 08:07:23] [INFO ] Dead Transitions using invariants and state equation in 2233 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3704 ms. Remains : 93/94 places, 3654/3910 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 382 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s21 1) (EQ s35 1) (EQ s43 1) (EQ s51 1) (EQ s59 1) (EQ s67 1) (EQ s75 1) (EQ s83 1) (EQ s91 1)), p0:(OR (EQ s10 0) (EQ s35 0) (EQ s40 0) (EQ s...], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 1898 ms.
Stack based approach found an accepted trace after 54 steps with 0 reset with depth 55 and stack size 55 in 2 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-00 finished in 6157 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(G(!p1))||p0))))'
Support contains 10 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 91 transition count 3142
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 3142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 91 transition count 3141
Applied a total of 7 rules in 62 ms. Remains 91 /94 variables (removed 3) and now considering 3141/3910 (removed 769) transitions.
// Phase 1: matrix 3141 rows 91 cols
[2024-06-07 08:07:26] [INFO ] Computed 0 invariants in 52 ms
[2024-06-07 08:07:26] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-06-07 08:07:26] [INFO ] Invariant cache hit.
[2024-06-07 08:07:28] [INFO ] Implicit Places using invariants and state equation in 1231 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
[2024-06-07 08:07:28] [INFO ] Invariant cache hit.
[2024-06-07 08:07:30] [INFO ] Dead Transitions using invariants and state equation in 2010 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/94 places, 3141/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3933 ms. Remains : 91/94 places, 3141/3910 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s19 1) (EQ s33 1) (EQ s41 1) (EQ s49 1) (EQ s57 1) (EQ s65 1) (EQ s73 1) (EQ s81 1) (EQ s89 1)), p0:(OR (NEQ s19 1) (NEQ s31 1) (NEQ s41 1) (N...], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1327 ms.
Product exploration explored 100000 steps with 0 reset in 1300 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 648 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.67 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 298487 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{0=1}
Probabilistic random walk after 298487 steps, saw 47398 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :1
Running SMT prover for 1 properties.
[2024-06-07 08:07:36] [INFO ] Invariant cache hit.
[2024-06-07 08:07:38] [INFO ] After 1015ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 08:07:38] [INFO ] After 1166ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2024-06-07 08:07:38] [INFO ] After 1352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 157 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 3141/3141 transitions.
Applied a total of 0 rules in 36 ms. Remains 91 /91 variables (removed 0) and now considering 3141/3141 (removed 0) transitions.
[2024-06-07 08:07:38] [INFO ] Invariant cache hit.
[2024-06-07 08:07:39] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-06-07 08:07:39] [INFO ] Invariant cache hit.
[2024-06-07 08:07:40] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
[2024-06-07 08:07:40] [INFO ] Invariant cache hit.
[2024-06-07 08:07:41] [INFO ] Dead Transitions using invariants and state equation in 1627 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2875 ms. Remains : 91/91 places, 3141/3141 transitions.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 648 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.30 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 274923 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{0=1}
Probabilistic random walk after 274923 steps, saw 45080 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :1
Running SMT prover for 1 properties.
[2024-06-07 08:07:45] [INFO ] Invariant cache hit.
[2024-06-07 08:07:47] [INFO ] After 1379ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 08:07:47] [INFO ] After 1549ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2024-06-07 08:07:47] [INFO ] After 1701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 156 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 160 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 1302 ms.
Product exploration explored 100000 steps with 0 reset in 1328 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 246 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 3141/3141 transitions.
Graph (complete) has 648 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 89 transition count 3139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 89 transition count 3137
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 10 place count 89 transition count 3146
Deduced a syphon composed of 16 places in 2 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 19 place count 89 transition count 3146
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 85 transition count 3142
Deduced a syphon composed of 12 places in 2 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 85 transition count 3142
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 46 place count 85 transition count 3143
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 82 transition count 3139
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 82 transition count 3139
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 82 transition count 3174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 79 transition count 3168
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 79 transition count 3168
Deduced a syphon composed of 28 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 79 transition count 3167
Deduced a syphon composed of 28 places in 1 ms
Applied a total of 62 rules in 841 ms. Remains 79 /91 variables (removed 12) and now considering 3167/3141 (removed -26) transitions.
[2024-06-07 08:08:02] [INFO ] Redundant transitions in 10806 ms returned []
// Phase 1: matrix 3167 rows 79 cols
[2024-06-07 08:08:02] [INFO ] Computed 0 invariants in 26 ms
[2024-06-07 08:08:04] [INFO ] Dead Transitions using invariants and state equation in 2008 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/91 places, 3167/3141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13665 ms. Remains : 79/91 places, 3167/3141 transitions.
Built C files in :
/tmp/ltsmin3084105941470960413
[2024-06-07 08:08:04] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3084105941470960413
Running compilation step : cd /tmp/ltsmin3084105941470960413;'/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/ltsmin3084105941470960413;'/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/ltsmin3084105941470960413;'/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 10 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 3141/3141 transitions.
Applied a total of 0 rules in 23 ms. Remains 91 /91 variables (removed 0) and now considering 3141/3141 (removed 0) transitions.
// Phase 1: matrix 3141 rows 91 cols
[2024-06-07 08:08:08] [INFO ] Computed 0 invariants in 25 ms
[2024-06-07 08:08:08] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-06-07 08:08:08] [INFO ] Invariant cache hit.
[2024-06-07 08:08:09] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1521 ms to find 0 implicit places.
[2024-06-07 08:08:09] [INFO ] Invariant cache hit.
[2024-06-07 08:08:11] [INFO ] Dead Transitions using invariants and state equation in 1890 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3436 ms. Remains : 91/91 places, 3141/3141 transitions.
Built C files in :
/tmp/ltsmin15018899975742744176
[2024-06-07 08:08:11] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15018899975742744176
Running compilation step : cd /tmp/ltsmin15018899975742744176;'/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/ltsmin15018899975742744176;'/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/ltsmin15018899975742744176;'/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 08:08:15] [INFO ] Flatten gal took : 456 ms
[2024-06-07 08:08:16] [INFO ] Flatten gal took : 438 ms
[2024-06-07 08:08:16] [INFO ] Time to serialize gal into /tmp/LTL8929429001659431921.gal : 109 ms
[2024-06-07 08:08:16] [INFO ] Time to serialize properties into /tmp/LTL5541752193834712462.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/LTL8929429001659431921.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5381964649095223493.hoa' '-atoms' '/tmp/LTL5541752193834712462.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...317
Loading property file /tmp/LTL5541752193834712462.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5381964649095223493.hoa
Detected timeout of ITS tools.
[2024-06-07 08:08:32] [INFO ] Flatten gal took : 439 ms
[2024-06-07 08:08:32] [INFO ] Flatten gal took : 414 ms
[2024-06-07 08:08:32] [INFO ] Time to serialize gal into /tmp/LTL7652479519697548843.gal : 113 ms
[2024-06-07 08:08:32] [INFO ] Time to serialize properties into /tmp/LTL14944941333562771140.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/LTL7652479519697548843.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14944941333562771140.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(G(("((((p36!=1)||(p63!=1))||((p95!=1)||(p123!=1)))||(((p151!=1)||(p179!=1))||((p207!=1)||(p235!=1))))")||(("(p263!=1)")||(X(G("((...272
Formula 0 simplified : XF(!"((((p36!=1)||(p63!=1))||((p95!=1)||(p123!=1)))||(((p151!=1)||(p179!=1))||((p207!=1)||(p235!=1))))" & !"(p263!=1)" & XF!"(((((p3...260
Detected timeout of ITS tools.
[2024-06-07 08:08:48] [INFO ] Flatten gal took : 410 ms
[2024-06-07 08:08:48] [INFO ] Applying decomposition
[2024-06-07 08:08:48] [INFO ] Flatten gal took : 426 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/graph7470861794862062060.txt' '-o' '/tmp/graph7470861794862062060.bin' '-w' '/tmp/graph7470861794862062060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7470861794862062060.bin' '-l' '-1' '-v' '-w' '/tmp/graph7470861794862062060.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:08:50] [INFO ] Decomposing Gal with order
[2024-06-07 08:08:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:08:51] [INFO ] Removed a total of 29017 redundant transitions.
[2024-06-07 08:08:51] [INFO ] Flatten gal took : 1258 ms
[2024-06-07 08:08:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 329 ms.
[2024-06-07 08:08:52] [INFO ] Time to serialize gal into /tmp/LTL4247151463906995541.gal : 40 ms
[2024-06-07 08:08:52] [INFO ] Time to serialize properties into /tmp/LTL15949260270284172581.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/LTL4247151463906995541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15949260270284172581.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(G(("((((i3.u5.p36!=1)||(i3.u11.p63!=1))||((i3.u14.p95!=1)||(i3.u15.p123!=1)))||(((i3.u24.p151!=1)||(i3.u21.p179!=1))||((i3.u22.p2...396
Formula 0 simplified : XF(!"((((i3.u5.p36!=1)||(i3.u11.p63!=1))||((i3.u14.p95!=1)||(i3.u15.p123!=1)))||(((i3.u24.p151!=1)||(i3.u21.p179!=1))||((i3.u22.p207...384
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11265279100320329393
[2024-06-07 08:09:07] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11265279100320329393
Running compilation step : cd /tmp/ltsmin11265279100320329393;'/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/ltsmin11265279100320329393;'/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/ltsmin11265279100320329393;'/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-N08P1-LTLFireability-03 finished in 104373 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)&&F(p1))))'
Support contains 9 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (trivial) has 53 edges and 94 vertex of which 6 / 94 are part of one of the 2 SCC in 4 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 670 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 87 transition count 3896
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 80 transition count 3896
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 16 place count 80 transition count 3887
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 34 place count 71 transition count 3887
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 68 transition count 3119
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 68 transition count 3119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 68 transition count 3116
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 43 place count 68 transition count 3113
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 49 place count 65 transition count 3113
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 75 place count 52 transition count 3100
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 81 place count 49 transition count 3108
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 49 transition count 3107
Applied a total of 82 rules in 2019 ms. Remains 49 /94 variables (removed 45) and now considering 3107/3910 (removed 803) transitions.
[2024-06-07 08:09:12] [INFO ] Flow matrix only has 3106 transitions (discarded 1 similar events)
// Phase 1: matrix 3106 rows 49 cols
[2024-06-07 08:09:12] [INFO ] Computed 0 invariants in 44 ms
[2024-06-07 08:09:13] [INFO ] Implicit Places using invariants in 568 ms returned []
[2024-06-07 08:09:13] [INFO ] Flow matrix only has 3106 transitions (discarded 1 similar events)
[2024-06-07 08:09:13] [INFO ] Invariant cache hit.
[2024-06-07 08:09:14] [INFO ] Implicit Places using invariants and state equation in 1055 ms returned []
Implicit Place search using SMT with State Equation took 1633 ms to find 0 implicit places.
[2024-06-07 08:09:26] [INFO ] Redundant transitions in 11916 ms returned []
[2024-06-07 08:09:26] [INFO ] Flow matrix only has 3106 transitions (discarded 1 similar events)
[2024-06-07 08:09:26] [INFO ] Invariant cache hit.
[2024-06-07 08:09:28] [INFO ] Dead Transitions using invariants and state equation in 2170 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/94 places, 3107/3910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17760 ms. Remains : 49/94 places, 3107/3910 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s10 0) (EQ s15 0) (EQ s20 0) (EQ s23 0) (EQ s31 0) (EQ s37 0) (EQ s43 0) (EQ s46 0)), p1:(AND (EQ s5 1) (EQ s10 1) (EQ s15 1) (EQ s20...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1941 ms.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-04 finished in 19875 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)||(!p1 U (G(!p1)||(!p1&&G(!p0)))))))'
Support contains 16 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 3654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 3654
Applied a total of 2 rules in 40 ms. Remains 93 /94 variables (removed 1) and now considering 3654/3910 (removed 256) transitions.
// Phase 1: matrix 3654 rows 93 cols
[2024-06-07 08:09:30] [INFO ] Computed 0 invariants in 39 ms
[2024-06-07 08:09:30] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-06-07 08:09:30] [INFO ] Invariant cache hit.
[2024-06-07 08:09:31] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1470 ms to find 0 implicit places.
[2024-06-07 08:09:31] [INFO ] Invariant cache hit.
[2024-06-07 08:09:34] [INFO ] Dead Transitions using invariants and state equation in 2445 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3957 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 242 ms :[true, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), (NOT p0), (AND p1 p0), p0]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(AND (EQ s15 1) (EQ s35 1) (EQ s43 1) (EQ s49 1) (EQ s57 1) (EQ s65 1) (EQ s75 1) (EQ s83 1) (EQ s89 1)), p0:(AND (EQ s19 1) (EQ s34 1) (EQ s42 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1766 ms.
Product exploration explored 100000 steps with 0 reset in 2240 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 667 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.47 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 183 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[true, p1, (AND p1 p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 688 ms. (steps per millisecond=14 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 174825 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174825 steps, saw 29689 distinct states, run finished after 3002 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 6 properties.
[2024-06-07 08:09:43] [INFO ] Invariant cache hit.
[2024-06-07 08:09:45] [INFO ] After 1766ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:3
[2024-06-07 08:09:46] [INFO ] After 2248ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :2 real:3
Attempting to minimize the solution found.
Minimization took 250 ms.
[2024-06-07 08:09:46] [INFO ] After 2581ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :2 real:3
[2024-06-07 08:09:48] [INFO ] After 1864ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-06-07 08:09:49] [INFO ] After 2608ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 414 ms.
[2024-06-07 08:09:49] [INFO ] After 3111ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 53 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=13 )
Parikh walk visited 4 properties in 11 ms.
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 3654/3654 transitions.
Graph (trivial) has 57 edges and 93 vertex of which 12 / 93 are part of one of the 4 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 651 edges and 85 vertex of which 83 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 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 25 rules applied. Total rules applied 27 place count 83 transition count 3615
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 44 place count 67 transition count 3614
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 44 place count 67 transition count 3612
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 65 transition count 3612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 64 transition count 3356
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 64 transition count 3356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 64 transition count 3355
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 64 transition count 3354
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 63 transition count 3354
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 93 place count 43 transition count 3334
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 43 transition count 3333
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 43 transition count 3332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 42 transition count 3332
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 41 transition count 3331
Applied a total of 97 rules in 6193 ms. Remains 41 /93 variables (removed 52) and now considering 3331/3654 (removed 323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6193 ms. Remains : 41/93 places, 3331/3654 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 740 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3624 steps, run visited all 1 properties in 41 ms. (steps per millisecond=88 )
Probabilistic random walk after 3624 steps, saw 1993 distinct states, run finished after 41 ms. (steps per millisecond=88 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1)), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND p0 p1))
Knowledge based reduction with 11 factoid took 234 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P1-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P1-LTLFireability-05 finished in 26393 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 9 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 91 transition count 3142
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 3142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 91 transition count 3141
Applied a total of 7 rules in 40 ms. Remains 91 /94 variables (removed 3) and now considering 3141/3910 (removed 769) transitions.
// Phase 1: matrix 3141 rows 91 cols
[2024-06-07 08:09:56] [INFO ] Computed 0 invariants in 43 ms
[2024-06-07 08:09:57] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-06-07 08:09:57] [INFO ] Invariant cache hit.
[2024-06-07 08:09:58] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2024-06-07 08:09:58] [INFO ] Invariant cache hit.
[2024-06-07 08:10:00] [INFO ] Dead Transitions using invariants and state equation in 1923 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/94 places, 3141/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3510 ms. Remains : 91/94 places, 3141/3910 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s33 1) (EQ s39 1) (EQ s47 1) (EQ s55 1) (EQ s65 1) (EQ s71 1) (EQ s81 1) (EQ s89 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 1299 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 0 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-06 finished in 4904 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 9 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 91 transition count 3142
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 3142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 91 transition count 3141
Applied a total of 7 rules in 45 ms. Remains 91 /94 variables (removed 3) and now considering 3141/3910 (removed 769) transitions.
[2024-06-07 08:10:01] [INFO ] Invariant cache hit.
[2024-06-07 08:10:02] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-07 08:10:02] [INFO ] Invariant cache hit.
[2024-06-07 08:10:03] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
[2024-06-07 08:10:03] [INFO ] Invariant cache hit.
[2024-06-07 08:10:04] [INFO ] Dead Transitions using invariants and state equation in 1655 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/94 places, 3141/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3048 ms. Remains : 91/94 places, 3141/3910 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-07 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 s19 1) (EQ s33 1) (EQ s41 1) (EQ s49 1) (EQ s57 1) (EQ s65 1) (EQ s73 1) (EQ s81 1) (EQ s89 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 1380 ms.
Stack based approach found an accepted trace after 73 steps with 0 reset with depth 74 and stack size 74 in 1 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-07 finished in 4526 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)&&F(G(!p1)))))'
Support contains 14 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 91 transition count 3901
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 85 transition count 3901
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 85 transition count 3892
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 76 transition count 3892
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 74 transition count 3380
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 74 transition count 3380
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 74 transition count 3378
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 37 place count 74 transition count 3376
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 41 place count 72 transition count 3376
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 71 place count 57 transition count 3361
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 77 place count 54 transition count 3369
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 54 transition count 3368
Applied a total of 78 rules in 595 ms. Remains 54 /94 variables (removed 40) and now considering 3368/3910 (removed 542) transitions.
// Phase 1: matrix 3368 rows 54 cols
[2024-06-07 08:10:06] [INFO ] Computed 0 invariants in 52 ms
[2024-06-07 08:10:07] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-06-07 08:10:07] [INFO ] Invariant cache hit.
[2024-06-07 08:10:08] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
[2024-06-07 08:10:19] [INFO ] Redundant transitions in 11352 ms returned []
[2024-06-07 08:10:19] [INFO ] Invariant cache hit.
[2024-06-07 08:10:21] [INFO ] Dead Transitions using invariants and state equation in 2025 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/94 places, 3368/3910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15481 ms. Remains : 54/94 places, 3368/3910 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s13 1) (EQ s15 1) (EQ s23 1) (EQ s26 1) (EQ s32 1) (EQ s38 1) (EQ s47 1) (EQ s53 1)), p1:(AND (EQ s8 1) (EQ s13 1) (EQ s18 1) (EQ s2...], nbAcceptance=1, 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 1946 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-N08P1-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-09 finished in 17574 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(G(p0)))'
Support contains 18 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 91 transition count 3900
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 84 transition count 3900
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 15 place count 84 transition count 3891
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 33 place count 75 transition count 3891
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 73 transition count 3379
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 73 transition count 3379
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 73 transition count 3377
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 39 place count 73 transition count 3375
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 71 transition count 3375
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 73 place count 56 transition count 3360
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 79 place count 53 transition count 3368
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 53 transition count 3367
Applied a total of 80 rules in 590 ms. Remains 53 /94 variables (removed 41) and now considering 3367/3910 (removed 543) transitions.
// Phase 1: matrix 3367 rows 53 cols
[2024-06-07 08:10:24] [INFO ] Computed 0 invariants in 35 ms
[2024-06-07 08:10:24] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-06-07 08:10:24] [INFO ] Invariant cache hit.
[2024-06-07 08:10:25] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
[2024-06-07 08:10:37] [INFO ] Redundant transitions in 11906 ms returned []
[2024-06-07 08:10:37] [INFO ] Invariant cache hit.
[2024-06-07 08:10:39] [INFO ] Dead Transitions using invariants and state equation in 2022 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/94 places, 3367/3910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15674 ms. Remains : 53/94 places, 3367/3910 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s11 1) (EQ s16 1) (EQ s22 1) (EQ s27 1) (EQ s33 1) (EQ s39 1) (EQ s46 1) (EQ s51 1) (OR (AND (EQ s12 1) (EQ s17 1) (EQ s28 1) (EQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1979 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-10 finished in 17733 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(((F(!p0)&&F(!p1))||G((!p2||(F(!p0)&&F(!p1))))||(!p2&&F(!p0))))))'
Support contains 20 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 91 transition count 3901
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 85 transition count 3901
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 85 transition count 3892
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 76 transition count 3892
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 75 transition count 3636
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 75 transition count 3636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 75 transition count 3635
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 34 place count 75 transition count 3634
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 74 transition count 3634
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 66 place count 59 transition count 3619
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 56 transition count 3627
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 56 transition count 3626
Applied a total of 73 rules in 630 ms. Remains 56 /94 variables (removed 38) and now considering 3626/3910 (removed 284) transitions.
// Phase 1: matrix 3626 rows 56 cols
[2024-06-07 08:10:42] [INFO ] Computed 0 invariants in 36 ms
[2024-06-07 08:10:42] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-06-07 08:10:42] [INFO ] Invariant cache hit.
[2024-06-07 08:10:43] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
[2024-06-07 08:10:55] [INFO ] Redundant transitions in 11805 ms returned []
[2024-06-07 08:10:55] [INFO ] Invariant cache hit.
[2024-06-07 08:10:57] [INFO ] Dead Transitions using invariants and state equation in 1923 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/94 places, 3626/3910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15575 ms. Remains : 56/94 places, 3626/3910 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (AND p0 p2) (AND p1 p2)), (AND p2 p0), (AND p1 p2), (AND p2 p0 p1)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s7 1) (EQ s14 1) (EQ s19 1) (EQ s24 1) (EQ s31 1) (EQ s37 1) (EQ s42 1) (EQ s48 1) (EQ s55 1)), p0:(AND (EQ s10 1) (EQ s15 1) (EQ s20 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 2145 ms.
Product exploration explored 100000 steps with 0 reset in 2069 ms.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 141 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (AND p0 p2) (AND p1 p2)), (AND p2 p0), (AND p1 p2), (AND p2 p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 234449 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{2=1}
Probabilistic random walk after 234449 steps, saw 35909 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :1
Running SMT prover for 4 properties.
[2024-06-07 08:11:06] [INFO ] Invariant cache hit.
[2024-06-07 08:11:07] [INFO ] After 1260ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2024-06-07 08:11:08] [INFO ] After 1163ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND p1 (NOT p2) p0))), (G (NOT (AND p2 p0))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p2) p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 28 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P1-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P1-LTLFireability-11 finished in 27072 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))&&G(((X(p1) U p2) U !p3))) U p4))'
Support contains 25 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 3654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 3654
Applied a total of 2 rules in 32 ms. Remains 93 /94 variables (removed 1) and now considering 3654/3910 (removed 256) transitions.
// Phase 1: matrix 3654 rows 93 cols
[2024-06-07 08:11:08] [INFO ] Computed 0 invariants in 38 ms
[2024-06-07 08:11:08] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-06-07 08:11:08] [INFO ] Invariant cache hit.
[2024-06-07 08:11:09] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
[2024-06-07 08:11:09] [INFO ] Invariant cache hit.
[2024-06-07 08:11:11] [INFO ] Dead Transitions using invariants and state equation in 2314 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3314 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p4), acceptance={0} source=0 dest: 0}, { cond=(NOT p4), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p4) p3 (NOT p2)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={0} source=0 dest: 3}, { cond=(NOT p4), acceptance={0} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=p3, acceptance={0} source=3 dest: 3}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p4:(AND (EQ s19 1) (EQ s35 1) (EQ s43 1) (EQ s50 1) (EQ s58 1) (EQ s67 1) (EQ s75 1) (EQ s82 1) (EQ s91 1)), p3:(AND (EQ s15 1) (EQ s33 1) (EQ s43 1) (EQ ...], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 1507 ms.
Product exploration explored 100000 steps with 1 reset in 1492 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 667 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.38 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p4) (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p3)), (X (NOT (AND (NOT p4) p3))), (X (NOT p1)), (X (NOT (AND (NOT p4) p3 (NOT p2)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT p4)), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p4))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 220 ms. Reduced automaton from 6 states, 14 edges and 5 AP (stutter sensitive) to 6 states, 14 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 190624 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190624 steps, saw 32426 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 8 properties.
[2024-06-07 08:11:20] [INFO ] Invariant cache hit.
[2024-06-07 08:11:22] [INFO ] After 1388ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2024-06-07 08:11:22] [INFO ] After 1551ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:7
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-06-07 08:11:22] [INFO ] After 1710ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:7
[2024-06-07 08:11:24] [INFO ] After 1964ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-07 08:11:25] [INFO ] After 3161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 700 ms.
[2024-06-07 08:11:26] [INFO ] After 3954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 4 different solutions.
Finished Parikh walk after 54 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=13 )
Parikh walk visited 8 properties in 23 ms.
Knowledge obtained : [(AND (NOT p4) (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p3)), (X (NOT (AND (NOT p4) p3))), (X (NOT p1)), (X (NOT (AND (NOT p4) p3 (NOT p2)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT p4)), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p4))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F p0), (F (AND (NOT p2) p3)), (F p1), (F p4), (F (AND p3 (NOT p4))), (F (AND (NOT p2) p3 (NOT p4))), (F p3)]
Knowledge based reduction with 18 factoid took 428 ms. Reduced automaton from 6 states, 14 edges and 5 AP (stutter sensitive) to 6 states, 14 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
Stuttering acceptance computed with spot in 240 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
[2024-06-07 08:11:27] [INFO ] Invariant cache hit.
Proved EG (NOT p4)
Knowledge obtained : [(AND (NOT p4) (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p3)), (X (NOT (AND (NOT p4) p3))), (X (NOT p1)), (X (NOT (AND (NOT p4) p3 (NOT p2)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT p4)), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p4))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F p0), (F (AND (NOT p2) p3)), (F p1), (F p4), (F (AND p3 (NOT p4))), (F (AND (NOT p2) p3 (NOT p4))), (F p3), (G (NOT p4))]
Property proved to be false thanks to negative knowledge :(G (NOT p4))
Knowledge based reduction with 18 factoid took 460 ms. Reduced automaton from 6 states, 14 edges and 5 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P1-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P1-LTLFireability-12 finished in 20879 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((X(p0)&&(p1||F(G(p2))))))'
Support contains 13 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 92 transition count 3398
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 92 transition count 3398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 3397
Applied a total of 5 rules in 42 ms. Remains 92 /94 variables (removed 2) and now considering 3397/3910 (removed 513) transitions.
// Phase 1: matrix 3397 rows 92 cols
[2024-06-07 08:11:29] [INFO ] Computed 0 invariants in 52 ms
[2024-06-07 08:11:29] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-06-07 08:11:29] [INFO ] Invariant cache hit.
[2024-06-07 08:11:30] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1356 ms to find 0 implicit places.
[2024-06-07 08:11:30] [INFO ] Invariant cache hit.
[2024-06-07 08:11:32] [INFO ] Dead Transitions using invariants and state equation in 1811 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/94 places, 3397/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3212 ms. Remains : 92/94 places, 3397/3910 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s20 1) (EQ s34 1) (EQ s42 1) (EQ s50 1) (EQ s58 1) (EQ s66 1) (EQ s74 1) (EQ s82 1) (EQ s90 1)), p0:(AND (EQ s15 1) (EQ s34 1) (EQ s42 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1501 ms.
Product exploration explored 100000 steps with 0 reset in 1520 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 657 edges and 92 vertex of which 90 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.31 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 230 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 670 ms. (steps per millisecond=14 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 407553 steps, run timeout after 6001 ms. (steps per millisecond=67 ) properties seen :{1=1, 2=1, 5=1, 6=1, 9=1}
Probabilistic random walk after 407553 steps, saw 62236 distinct states, run finished after 6003 ms. (steps per millisecond=67 ) properties seen :5
Running SMT prover for 5 properties.
[2024-06-07 08:11:44] [INFO ] Invariant cache hit.
[2024-06-07 08:11:46] [INFO ] After 1319ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:2
[2024-06-07 08:11:46] [INFO ] After 1468ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-06-07 08:11:46] [INFO ] After 1613ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :1 real:2
[2024-06-07 08:11:47] [INFO ] After 1306ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2024-06-07 08:11:47] [INFO ] After 1448ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-06-07 08:11:47] [INFO ] After 1579ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 55 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 2 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (G (NOT (AND p1 p2))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0) p2))), (F (AND p1 (NOT p2))), (F p0), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 21 factoid took 845 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
[2024-06-07 08:11:49] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (G (NOT (AND p1 p2))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0) p2))), (F (AND p1 (NOT p2))), (F p0), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0) (NOT p2))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 21 factoid took 935 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P1-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P1-LTLFireability-13 finished in 22315 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' '!(((p0||X(p1)) U p2))'
Support contains 17 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 3654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 3654
Applied a total of 2 rules in 37 ms. Remains 93 /94 variables (removed 1) and now considering 3654/3910 (removed 256) transitions.
// Phase 1: matrix 3654 rows 93 cols
[2024-06-07 08:11:51] [INFO ] Computed 0 invariants in 40 ms
[2024-06-07 08:11:52] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-06-07 08:11:52] [INFO ] Invariant cache hit.
[2024-06-07 08:11:53] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
[2024-06-07 08:11:53] [INFO ] Invariant cache hit.
[2024-06-07 08:11:55] [INFO ] Dead Transitions using invariants and state equation in 2522 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3954 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s18 1) (EQ s35 1) (EQ s43 1) (EQ s51 1) (EQ s59 1) (EQ s66 1) (EQ s75 1) (EQ s82 1) (EQ s90 1)), p0:(AND (EQ s21 1) (EQ s35 1) (EQ s43 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-14 finished in 4078 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(G(!p1))||p0))))'
Found a Lengthening insensitive property : ResIsolation-PT-N08P1-LTLFireability-03
Stuttering acceptance computed with spot in 125 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 94 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 91 transition count 3900
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 84 transition count 3900
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 15 place count 84 transition count 3891
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 33 place count 75 transition count 3891
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 72 transition count 3123
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 72 transition count 3123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 72 transition count 3120
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 42 place count 72 transition count 3117
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 69 transition count 3117
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 78 place count 54 transition count 3102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 51 transition count 3110
Applied a total of 84 rules in 344 ms. Remains 51 /94 variables (removed 43) and now considering 3110/3910 (removed 800) transitions.
// Phase 1: matrix 3110 rows 51 cols
[2024-06-07 08:11:56] [INFO ] Computed 0 invariants in 29 ms
[2024-06-07 08:11:56] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-07 08:11:56] [INFO ] Invariant cache hit.
[2024-06-07 08:11:57] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2024-06-07 08:11:57] [INFO ] Invariant cache hit.
[2024-06-07 08:11:59] [INFO ] Dead Transitions using invariants and state equation in 1835 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 51/94 places, 3110/3910 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3458 ms. Remains : 51/94 places, 3110/3910 transitions.
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s5 1) (EQ s10 1) (EQ s15 1) (EQ s20 1) (EQ s26 1) (EQ s32 1) (EQ s38 1) (EQ s44 1) (EQ s50 1)), p0:(OR (NEQ s5 1) (NEQ s8 1) (NEQ s15 1) (NEQ ...], 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1923 ms.
Product exploration explored 100000 steps with 0 reset in 1911 ms.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 306520 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{0=1}
Probabilistic random walk after 306520 steps, saw 46756 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :1
Running SMT prover for 1 properties.
[2024-06-07 08:12:07] [INFO ] Invariant cache hit.
[2024-06-07 08:12:08] [INFO ] After 1072ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 08:12:08] [INFO ] After 1202ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-06-07 08:12:08] [INFO ] After 1309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 124 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 3110/3110 transitions.
Applied a total of 0 rules in 16 ms. Remains 51 /51 variables (removed 0) and now considering 3110/3110 (removed 0) transitions.
[2024-06-07 08:12:09] [INFO ] Invariant cache hit.
[2024-06-07 08:12:09] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-06-07 08:12:09] [INFO ] Invariant cache hit.
[2024-06-07 08:12:10] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
[2024-06-07 08:12:10] [INFO ] Invariant cache hit.
[2024-06-07 08:12:11] [INFO ] Dead Transitions using invariants and state equation in 1545 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2807 ms. Remains : 51/51 places, 3110/3110 transitions.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 308511 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{0=1}
Probabilistic random walk after 308511 steps, saw 47045 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :1
Running SMT prover for 1 properties.
[2024-06-07 08:12:15] [INFO ] Invariant cache hit.
[2024-06-07 08:12:17] [INFO ] After 1280ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 08:12:17] [INFO ] After 1411ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-06-07 08:12:17] [INFO ] After 1519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 123 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 137 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 1945 ms.
Product exploration explored 100000 steps with 0 reset in 1927 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 129 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 3110/3110 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 51 transition count 3109
Applied a total of 1 rules in 332 ms. Remains 51 /51 variables (removed 0) and now considering 3109/3110 (removed 1) transitions.
[2024-06-07 08:12:33] [INFO ] Redundant transitions in 10709 ms returned []
// Phase 1: matrix 3109 rows 51 cols
[2024-06-07 08:12:33] [INFO ] Computed 0 invariants in 33 ms
[2024-06-07 08:12:35] [INFO ] Dead Transitions using invariants and state equation in 2200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/51 places, 3109/3110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13249 ms. Remains : 51/51 places, 3109/3110 transitions.
Built C files in :
/tmp/ltsmin17432741686950366274
[2024-06-07 08:12:35] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17432741686950366274
Running compilation step : cd /tmp/ltsmin17432741686950366274;'/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/ltsmin17432741686950366274;'/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/ltsmin17432741686950366274;'/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 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 3110/3110 transitions.
Applied a total of 0 rules in 16 ms. Remains 51 /51 variables (removed 0) and now considering 3110/3110 (removed 0) transitions.
// Phase 1: matrix 3110 rows 51 cols
[2024-06-07 08:12:38] [INFO ] Computed 0 invariants in 29 ms
[2024-06-07 08:12:38] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-06-07 08:12:38] [INFO ] Invariant cache hit.
[2024-06-07 08:12:39] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2024-06-07 08:12:39] [INFO ] Invariant cache hit.
[2024-06-07 08:12:41] [INFO ] Dead Transitions using invariants and state equation in 1542 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2834 ms. Remains : 51/51 places, 3110/3110 transitions.
Built C files in :
/tmp/ltsmin5612505959208090633
[2024-06-07 08:12:41] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5612505959208090633
Running compilation step : cd /tmp/ltsmin5612505959208090633;'/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/ltsmin5612505959208090633;'/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/ltsmin5612505959208090633;'/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 08:12:45] [INFO ] Flatten gal took : 467 ms
[2024-06-07 08:12:45] [INFO ] Flatten gal took : 474 ms
[2024-06-07 08:12:45] [INFO ] Time to serialize gal into /tmp/LTL7713597895217535185.gal : 53 ms
[2024-06-07 08:12:45] [INFO ] Time to serialize properties into /tmp/LTL11745468001051579712.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/LTL7713597895217535185.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13401607139358943122.hoa' '-atoms' '/tmp/LTL11745468001051579712.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/LTL11745468001051579712.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13401607139358943122.hoa
Detected timeout of ITS tools.
[2024-06-07 08:13:01] [INFO ] Flatten gal took : 485 ms
[2024-06-07 08:13:01] [INFO ] Flatten gal took : 467 ms
[2024-06-07 08:13:01] [INFO ] Time to serialize gal into /tmp/LTL14204454854492387123.gal : 110 ms
[2024-06-07 08:13:01] [INFO ] Time to serialize properties into /tmp/LTL9988603881611487102.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/LTL14204454854492387123.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9988603881611487102.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(G(("((((p36!=1)||(p63!=1))||((p95!=1)||(p123!=1)))||(((p151!=1)||(p179!=1))||((p207!=1)||(p235!=1))))")||(("(p263!=1)")||(X(G("((...272
Formula 0 simplified : XF(!"((((p36!=1)||(p63!=1))||((p95!=1)||(p123!=1)))||(((p151!=1)||(p179!=1))||((p207!=1)||(p235!=1))))" & !"(p263!=1)" & XF!"(((((p3...260
Detected timeout of ITS tools.
[2024-06-07 08:13:17] [INFO ] Flatten gal took : 498 ms
[2024-06-07 08:13:17] [INFO ] Applying decomposition
[2024-06-07 08:13:17] [INFO ] Flatten gal took : 456 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/graph9295550238841512590.txt' '-o' '/tmp/graph9295550238841512590.bin' '-w' '/tmp/graph9295550238841512590.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9295550238841512590.bin' '-l' '-1' '-v' '-w' '/tmp/graph9295550238841512590.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:13:19] [INFO ] Decomposing Gal with order
[2024-06-07 08:13:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:13:20] [INFO ] Removed a total of 27490 redundant transitions.
[2024-06-07 08:13:20] [INFO ] Flatten gal took : 711 ms
[2024-06-07 08:13:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 56 ms.
[2024-06-07 08:13:20] [INFO ] Time to serialize gal into /tmp/LTL14820017242511041674.gal : 23 ms
[2024-06-07 08:13:20] [INFO ] Time to serialize properties into /tmp/LTL2639738929220654743.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/LTL14820017242511041674.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2639738929220654743.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(G(("((((i1.u1.p36!=1)||(i1.u1.p63!=1))||((u3.p95!=1)||(u4.p123!=1)))||(((u5.p151!=1)||(u6.p179!=1))||((u7.p207!=1)||(i1.u8.p235!=...341
Formula 0 simplified : XF(!"((((i1.u1.p36!=1)||(i1.u1.p63!=1))||((u3.p95!=1)||(u4.p123!=1)))||(((u5.p151!=1)||(u6.p179!=1))||((u7.p207!=1)||(i1.u8.p235!=1)...329
Reverse transition relation is NOT exact ! Due to transitions t25_t27_t3906, t19_t21_t3902, t13_t15_t3907, t7_t9_t3901, t6_t12_t18_t24_t30_t36_t42_t48_t49_...1435
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
314 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.67161,70432,1,0,50341,1787,58357,40964,487,8321,580705
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ResIsolation-PT-N08P1-LTLFireability-03 finished in 88239 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-07 08:13:24] [INFO ] Flatten gal took : 558 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 401134 ms.
BK_STOP 1717748005686
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-N08P1"
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-N08P1, 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-171774451400003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResIsolation-PT-N08P1.tgz
mv ResIsolation-PT-N08P1 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 '
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 ;